Sciweavers

1019 search results - page 1 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
JDA
2008
85views more  JDA 2008»
13 years 4 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
13 years 10 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
IPPS
2003
IEEE
13 years 9 months ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
CEC
2010
IEEE
12 years 11 months ago
Multi-objective robust static mapping of independent tasks on grids
We study the problem of efficiently allocating incoming independent tasks onto the resources of a Grid system. Typically, it is assumed that the estimated time to compute each task...
Bernabé Dorronsoro Díaz, Pascal Bouv...
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
13 years 10 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...