Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs
Authors:
- Savina BansalSBSavina Bansal
- Padam KumarPKPadam Kumar
- Kuldip SinghKSKuldip Singh
- 1 April 2005
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 65 (4) , 479-491
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems, 2003
- Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines2002
- Benchmarking and Comparison of the Task Graph Scheduling AlgorithmsJournal of Parallel and Distributed Computing, 1999
- On exploiting task duplication in parallel program schedulingIEEE Transactions on Parallel and Distributed Systems, 1998
- Optimal scheduling algorithm for distributed-memory machinesIEEE Transactions on Parallel and Distributed Systems, 1998
- Static and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel ArchitecturesJournal of Parallel and Distributed Computing, 1995
- Heterogeneous computing: challenges and opportunitiesComputer, 1993
- Measuring parallelism in computation-intensive scientific/engineering applicationsIEEE Transactions on Computers, 1988
- Economies of scale in computing: Grosch's law revisitedCommunications of the ACM, 1987
- Solving Linear Algebraic Equations on an MIMD ComputerJournal of the ACM, 1983