Sciweavers

702 search results - page 82 / 141
» Algorithms for Minimizing Response Time in Broadcast Schedul...
Sort
View
INFOCOM
2006
IEEE
15 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
PDPTA
2007
14 years 11 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li
EOR
2008
86views more  EOR 2008»
14 years 10 months ago
Batch scheduling of deteriorating reworkables
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. E...
M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kova...
PDP
2005
IEEE
15 years 3 months ago
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
Olivier Beaumont, Arnaud Legrand, Loris Marchal, Y...
FSTTCS
2004
Springer
15 years 3 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi