Loading...
Please wait, while we are loading the content...
Hardware implementation study of the deficit table egress link scheduling algorithm.
| Content Provider | CiteSeerX |
|---|---|
| Author | Claver, J. M. Alfaro, F. J. Sánchez, J. L. |
| Abstract | Abstract—The provision of Quality of Service (QoS) in com-puting and communication environments has increasingly focused the attention from academia and industry during the last decades. Some of the current interconnection technologies include hard-ware support that, adequately used, allows to offer QoS guaran-tees to the applications. The egress link scheduling algorithm is a key part of that support. Apart from providing a good performance in terms of, for example, good end-to-end delay (also called latency) and fair bandwidth allocation, an ideal scheduling algorithm implemented in a high-performance network with QoS support should satisfy other important property which is to have a low computational and implementation complexity. In this paper, we propose a specific implementation of the DTable scheduling algorithm and show estimates about its com-plexity in terms of silicon area and computation delay. In order to obtain these estimates, we have performed our own hardware implementation using the Handel-C language and employed the DK design suite tool from Celoxica. I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Deficit Table Egress Link Hardware Implementation Study Silicon Area Fair Bandwidth Allocation Last Decade Computation Delay Egress Link Good Performance Qos Support Hard-ware Support Dtable Scheduling Algorithm Low Computational Important Property Specific Implementation Good End-to-end Delay Implementation Complexity Key Part Handel-c Language Current Interconnection Technology Hardware Implementation Communication Environment Qos Guaran-tees Dk Design Suite Tool High-performance Network |
| Content Type | Text |
