Sciweavers

1156 search results - page 15 / 232
» Optimal scheduling of task graphs on parallel systems
Sort
View
117
Voted
HPCC
2009
Springer
14 years 9 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
174
Voted
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 11 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
95
Voted
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
15 years 6 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
86
Voted
CLEIEJ
2004
119views more  CLEIEJ 2004»
14 years 11 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...
IPPS
2005
IEEE
15 years 5 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch