Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
A threshold scheduling strategy for Sisal on distributed memory machines
Journal of Parallel and Distributed Computing
A Scalable Scheduling Scheme for Functional Parallelism on Distributed Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
A comparison of list schedules for parallel processing systems
Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On Mapping Systolic Algorithms onto the Hypercube
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Building Synthetic Parallel Programs: the Project ALPES
Proceedings of the IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing
Static task scheduling and grain packing in parallel processing systems
Static task scheduling and grain packing in parallel processing systems
Exploiting heterogeneous parallelism in the presence of communication delays
ICS '98 Proceedings of the 12th international conference on Supercomputing
A duplication based compile time scheduling method for task parallelism
Compiler optimizations for scalable parallel systems
A framework for performance-based program partitioning
Progress in computer research
A framework for performance-based program partitioning
Progress in computer research
A Robust Compile Time Method for SchedulingTask Parallelism on Distributed Memory Machines
The Journal of Supercomputing
An Optimal Scheduling Algorithm Based on Task Duplication
IEEE Transactions on Computers
Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Non-approximability of the Bulk Synchronous Task Scheduling Problem
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A Platform Independent Parallelising Tool Based on Graph Theoretic Models
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
Joint Application Mapping/Interconnect Synthesis Techniques for Embedded Chip-Scale Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Iterative list scheduling for heterogeneous computing
Journal of Parallel and Distributed Computing
Energy efficient scheduling for parallel applications on mobile clusters
Cluster Computing
Task scheduling in multiprocessing systems using duplication
Journal of Systems Architecture: the EUROMICRO Journal
Minimizing Energy Consumption for Precedence-Constrained Applications Using Dynamic Voltage Scaling
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Posterior task scheduling algorithms for heterogeneous computing systems
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Adaptive service scheduling for workflow applications in Service-Oriented Grid
The Journal of Supercomputing
Robust task scheduling for volunteer computing systems
The Journal of Supercomputing
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
Journal of Parallel and Distributed Computing
Contention-aware scheduling with task duplication
Journal of Parallel and Distributed Computing
Parallel programming with data driven model
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
A New Power-Aware Scheduling Algorithm for Distributed System
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems
Journal of Parallel and Distributed Computing
Task scheduling algorithm for interconnection constrained network of heterogeneous processors
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
An RFID-Based distributed control system for mass customization manufacturing
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature. This paper presents a Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|2), where |V| is the number of tasks in the DAG. This algorithm generates an optimal schedule for a class of DAGs which satisfy a simple cost relationship. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling schemes in terms of the schedule length and algorithm complexity.