Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Scheduling and code generation for parallel architectures
Scheduling and code generation for parallel architectures
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Using duplication for scheduling unitary tasks on m processors with unit communication delays
Theoretical Computer Science
Optimal Scheduling Algorithm for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
A task duplication based scalable scheduling algorithm for distributed memory systems
Journal of Parallel and Distributed Computing
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
A comparison of list schedules for parallel processing systems
Communications of the ACM
Efficient Local Search for DAG Scheduling
IEEE Transactions on Parallel and Distributed Systems
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Grain Size Determination for Parallel Processing
IEEE Software
An Optimal Scheduling Algorithm Based on Task Duplication
IEEE Transactions on Computers
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
High-performance algorithms of compile-time scheduling of parallel processors
High-performance algorithms of compile-time scheduling of parallel processors
Journal of Parallel and Distributed Computing
Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling
IEEE Transactions on Computers
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A decentralized resource allocation policy in minigrid
Future Generation Computer Systems
Journal of Parallel and Distributed Computing
Energy efficient scheduling for parallel applications on mobile clusters
Cluster Computing
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
The Journal of Supercomputing
Task scheduling in multiprocessing systems using duplication
Journal of Systems Architecture: the EUROMICRO Journal
Task scheduling algorithm using minimized duplications in homogeneous systems
Journal of Parallel and Distributed Computing
Process scheduling in heterogeneous multiprocessor systems
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
Journal of Parallel and Distributed Computing
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks
Journal of Parallel and Distributed Computing
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous multi-core system
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Energy-Aware Scheduling Algorithm with Duplication on Heterogeneous Computing Systems
GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication
International Journal of Business Data Communications and Networking
Adaptive online scheduling in storm
Proceedings of the 7th ACM international conference on Distributed event-based systems
Hi-index | 0.01 |
Scheduling precedence constrained task graphs, with or without duplication, is one of the most challenging NP-complete problems in parallel and distributed computing systems. Duplication heuristics are more effective, in general, for fine grain tasks graphs and for networks with high communication latencies. However, most of the available duplication algorithms are designed under the assumption of unbounded availability of fully connected processors, and lie in high complexity range. Low complexity optimal duplication algorithms work under restricted cost and/or shape parameters for the task graphs. Further, the required number of processors grows in proportion to the task-graph size significantly. An improved duplication strategy is proposed that works for arbitrary task graphs, with a limited number of interconnection-constrained processors. Unlike most other algorithms that replicate all possible parents/ancestors of a given task, the proposed algorithm tends to avoid redundant duplications and duplicates the nodes selectively, only if it helps in improving the performance. This results in lower duplications and also lower time and space complexity. Simulation results are presented for clique and an interconnection-constrained network topology with random and regular benchmark task graph suites, representing a variety of parallel numerical applications. Performance, in terms of normalized schedule length and efficiency, is compared with some of the well-known and recently proposed algorithms. The suggested algorithm turns out to be most efficient, as it generates better or comparable schedules with remarkably less processor consumption.