Sciweavers

1095 search results - page 37 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
CCGRID
2010
IEEE
15 years 5 months ago
A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids
Desktop Grids have become very popular nowadays, with projects that include hundred of thousands computers. Desktop grid scheduling faces two challenges. First, the platform is vo...
Javier Celaya, Loris Marchal
RTAS
2008
IEEE
15 years 10 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
154
Voted
ICPP
2007
IEEE
15 years 10 months ago
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems
In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing p...
Chih-Hsueh Yang, PeiZong Lee, Yeh-Ching Chung
CSE
2009
IEEE
15 years 7 months ago
Completely Distributed Low Duty Cycle Communication for Long-Living Sensor Networks
A lifetime of several years for wireless sensor nodes can be achieved if their activity period is minimized. This can be done by using low duty cycle protocols. One of the challeng...
Marcin Brzozowski, Hendrik Salomon, Peter Langendo...
114
Voted
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
15 years 7 months ago
Distributed Cooperation During the Absence of Communication
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
Grzegorz Malewicz, Alexander Russell, Alexander A....