Sciweavers

790 search results - page 59 / 158
» Limits of Work-Stealing Scheduling
Sort
View
RTCSA
2009
IEEE
16 years 25 days ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
GLOBECOM
2008
IEEE
16 years 17 days ago
Optimized Opportunistic Multicast Scheduling over Cellular Networks
—The design of optimal opportunistic multicast scheduling (OMS) that maximizes the throughput of cellular networks is investigated. In a cellular network, the base station (BS) t...
Tze-Ping Low, Man-On Pun, C. C. Jay Kuo
INFOCOM
2008
IEEE
16 years 16 days ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
ICC
2007
IEEE
133views Communications» more  ICC 2007»
16 years 13 days ago
A Token-Based Scheduling Scheme for WLANs and Its Performance Analysis
— Most of the existing WLAN MAC protocols can only provide limited service differentiation. In this paper, we propose a novel token-based scheduling scheme for precise and quanti...
Ping Wang, Weihua Zhuang
INFOCOM
2007
IEEE
16 years 12 days ago
Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of K non-cooperative schedu...
Arnaud Legrand, Corinne Touati