—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
— The need for efficient implementation of simple crossbar schedulers has increased in the recent years due to the advent of on-chip interconnection networks that require low la...
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...