Sciweavers

790 search results - page 20 / 158
» Limits of Work-Stealing Scheduling
Sort
View
72
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
On Providing Non-uniform Scheduling Guarantees in a Wireless Network
Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are o...
Vartika Bhandari, Nitin H. Vaidya
FMICS
2007
Springer
15 years 6 months ago
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
Leonard Lensink, Sjaak Smetsers, Marko C. J. D. va...
105
Voted
DATE
1999
IEEE
80views Hardware» more  DATE 1999»
15 years 4 months ago
Time Constrained Modulo Scheduling with Global Resource Sharing
Commonly used scheduling algorithms in high-level synthesis only accept one process at a time and are not capable of sharing resources across process boundaries. This results in t...
Christoph Jäschke, Rainer Laur, Friedrich Bec...
ECRTS
2003
IEEE
15 years 5 months ago
A Synthetic Utilization Bound for Aperiodic Tasks with Resource Requirements
Utilization bounds for schedulability of aperiodic tasks are new in real-time scheduling literature. All aperiodic bounds known to date apply only to independent tasks. They eithe...
Tarek F. Abdelzaher, Vivek Sharma
TPDS
2008
64views more  TPDS 2008»
15 years 11 days ago
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...
Issam Al-Azzoni, Douglas G. Down