Sciweavers

473 search results - page 59 / 95
» Early-release fair scheduling
Sort
View
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 9 months ago
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
Minyu Fang, David Malone, Ken R. Duffy, Douglas J....
ICCCN
2008
IEEE
14 years 3 months ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Shan Gao, Xiaoming Wang, Yingshu Li
GLOBECOM
2007
IEEE
14 years 3 months ago
Cooperative Power Scheduling for Wireless MIMO Networks
—We examine signaling strategies for wireless MIMO networks with interference. Previous approaches have focused on maximizing either individual or total throughput, resulting in ...
Matthew S. Nokleby, A. Lee Swindlehurst, Yue Rong,...
INFOCOM
2006
IEEE
14 years 3 months ago
Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
Sergey Gorinsky, Nageswara S. V. Rao
VEE
2009
ACM
157views Virtualization» more  VEE 2009»
14 years 3 months ago
Task-aware virtual machine scheduling for I/O performance
The use of virtualization is progressively accommodating diverse and unpredictable workloads as being adopted in virtual desktop and cloud computing environments. Since a virtual ...
Hwanju Kim, Hyeontaek Lim, Jinkyu Jeong, Heeseung ...