Sciweavers

157 search results - page 17 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
PPOPP
2010
ACM
14 years 2 months ago
Load balancing on speed
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
Steven Hofmeyr, Costin Iancu, Filip Blagojevic
INFOCOM
2002
IEEE
14 years 18 days ago
Scheduling Processing Resources in Programmable Routers
—To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typi...
Prashanth Pappu, Tilman Wolf
IAJIT
2010
124views more  IAJIT 2010»
13 years 6 months ago
Uplink Downlink Limited Round Robin Scheduling Algorithms
: Several polling algorithms have been proposed to overcome the slot wastage problem due to the exchange of POLL or NULL packets in the case of no data to transmit. However, most o...
Rawya Rizk
CSFW
2002
IEEE
14 years 19 days ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
MOBIHOC
2003
ACM
14 years 28 days ago
Improving fairness among TCP flows crossing wireless ad hoc and wired networks
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
Luqing Yang, Winston Khoon Guan Seah, Qinghe Yin