Sciweavers

3934 search results - page 129 / 787
» Approximate Schedulability Analysis
Sort
View
IJHPCA
2006
96views more  IJHPCA 2006»
15 years 6 months ago
On the User - Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheduling outcome from both parties' perspectives. In a grid or sta...
Cynthia Bailey Lee, Allan Snavely
INFOCOM
2010
IEEE
15 years 4 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
CAV
2009
Springer
116views Hardware» more  CAV 2009»
15 years 11 months ago
Priority Scheduling of Distributed Systems Based on Model Checking
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
Ananda Basu, Saddek Bensalem, Doron Peled, Joseph ...
ICNP
1999
IEEE
15 years 10 months ago
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
Craig Barrack, Kai-Yeung Siu
WICON
2008
15 years 7 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek