Sciweavers

511 search results - page 52 / 103
» Analysis of Multi-Organization Scheduling Algorithms
Sort
View
CLEIEJ
2004
119views more  CLEIEJ 2004»
14 years 9 months ago
Pump Scheduling Optimization Using Asynchronous Parallel
Optimizing the pump-scheduling is an interesting proposal to achieve cost reductions in water distribution pumping stations. As systems grow, pump-scheduling becomes a very diffic...
Christian von Lücken, Benjamín Bar&aac...
CISS
2008
IEEE
15 years 4 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
15 years 10 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
14 years 11 months ago
A maiden analysis of Longest Wait First
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
Jeff Edmonds, Kirk Pruhs
RTSS
2008
IEEE
15 years 4 months ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns