Sciweavers

505 search results - page 39 / 101
» Dual Priority Scheduling
Sort
View
OPODIS
2007
13 years 9 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
INFOCOM
2002
IEEE
14 years 28 days ago
BSFQ: Bin Sort Fair Queueing
—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...
Shun Yan Cheung, Corneliu S. Pencea
ICCD
2008
IEEE
160views Hardware» more  ICCD 2008»
14 years 5 months ago
Fast arbiters for on-chip network switches
— 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...
Giorgos Dimitrakopoulos, Nikos Chrysos, Costas Gal...
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
12 years 11 months ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– 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...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
RTSS
2007
IEEE
14 years 2 months ago
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao