Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High-Speed Networks
نویسندگان
چکیده
منابع مشابه
Pipelined Heap ( Priority Queue ) Management for AdvancedScheduling in High - Speed
Per-ow queueing with sophisticated scheduling is a candidate architecture for networks that provide advanced Quality-of-Service (QoS) guarantees. The hardest and most interesting scheduling algorithms rely on a common computational primitive: priority queues. Large priority queues are built using calendar queue or heap data structures. To support such scheduling for a large number of ows at OC-...
متن کاملPriority-based high-speed switch scheduling for ATM networks
In 1], the authors described the design of the AN2 switch which supports high-performance distributed computing. The switch's operation is based on the parallel iterative matching algorithm to nd a maximal matching between the inputs and the outputs of the switch. The number of iterations needed to nd a maximal matching in their algorithm is N in the worst case, and of time complexity O(log N) ...
متن کاملA Probabilistic Priority Scheduling Discipline for High Speed Networks
In high speed networks, the Strict Priority (SP) scheduling discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diverse performance requirements. With this discipline, however, packets at higher priority levels can starve packets at lower priority levels. To resolve this starvation problem, we propose to assign a parame...
متن کاملFunnel Heap - A Cache Oblivious Priority Queue
The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are unknown to the algorithms. A consequence of this assumption is that an algorithm efficient in the cache oblivious model is automatically efficient in a multi-level memory model. Arge et al. recently presented the first optimal cache oblivious priority queue, and demonstr...
متن کاملScalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating between a large number of small packets on a high-speed link requires an efficient hardware implementation of a priority queue. To highlight the challenges of building scalable priority queue architectures, this paper inc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2007
ISSN: 1063-6692
DOI: 10.1109/tnet.2007.892882