Sciweavers

157 search results - page 10 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 7 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
INFOCOM
2000
IEEE
14 years 1 days ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...
INFOCOM
2006
IEEE
14 years 1 months ago
Effective Packet Scheduling with Fairness Adaptation in Ultra Wideband Wireless Networks
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
Hai Jiang, Weihua Zhuang
INFOCOM
2006
IEEE
14 years 1 months ago
TCP as an Implementation of Age-Based Scheduling: Fairness and Performance
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
Arzad Alam Kherani, Rudesindo Núñez-...
RTSS
1998
IEEE
13 years 12 months ago
Efficient Object Sharing in Quantum-Based Real-Time Systems
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
James H. Anderson, Rohit Jain, Kevin Jeffay