Sciweavers

66 search results - page 13 / 14
» Distributed Scheduling in Input Queued Switches
Sort
View
INFOCOM
2002
IEEE
13 years 10 months ago
Fair Scheduling and Buffer Management in Internet Routers
Abstract—Input buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality ...
Nan Ni, Laxmi N. Bhuyan
ICDCS
2010
IEEE
13 years 9 months ago
Publisher Placement Algorithms in Content-Based Publish/Subscribe
—Many publish/subscribe systems implement a policy for clients to join to their physically closest broker to minimize transmission delays incurred on the clients’ messages. How...
Alex King Yeung Cheung, Hans-Arno Jacobsen
IPPS
2009
IEEE
14 years 12 days ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
ICDCS
2008
IEEE
14 years 5 days ago
Availability and Fairness Support for Storage QoS Guarantee
Multi-dimensional storage virtualization (MDSV) allows multiple virtual disks, each with a distinct combination of capacity, latency and bandwidth requirements, to be multiplexed ...
Gang Peng, Tzi-cker Chiueh
JSSPP
2004
Springer
13 years 11 months ago
Enhancements to the Decision Process of the Self-Tuning dynP Scheduler
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...
Achim Streit