Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the complexity of list scheduling algorithms for distributed-memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
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
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
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
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Decisive Path Scheduling: A New List Scheduling Method
ICPP '97 Proceedings of the international Conference on Parallel Processing
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
FLB: Fast Load Balancing for Distributed-Memory Machines
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
(R) FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
IEEE Transactions on Parallel and Distributed Systems
Scheduling Communication-Aware Tasks on Distributed Heterogeneous Computing Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Dimension-exchange algorithms for token distribution on tree-connected architectures
Journal of Parallel and Distributed Computing
Compact DAG representation and its symbolic scheduling
Journal of Parallel and Distributed Computing
Iterative list scheduling for heterogeneous computing
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
A low-cost rescheduling policy for efficient mapping of workflows on grid systems
Scientific Programming - AxGrids 2004
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
A job scheduling framework for large computing farms
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Genetic algorithms for task scheduling problem
Journal of Parallel and Distributed Computing
Scheduling task graphs optimally with A*
The Journal of Supercomputing
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Advance reservation policies for workflows
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
Journal of Parallel and Distributed Computing
Proceedings of the Conference on Design, Automation and Test in Europe
Scheduling multiple DAGs onto heterogeneous systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks
Journal of Parallel and Distributed Computing
Advanced resource management and scheduling of workflow applications in javasymphony
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Task scheduling algorithm for interconnection constrained network of heterogeneous processors
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
A novel task scheduling algorithm for distributed heterogeneous computing systems
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Optimal linear programming solutions for multiprocessor scheduling with communication delays
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
A multi-criteria job scheduling framework for large computing farms
Journal of Computer and System Sciences
Hi-index | 0.02 |
In compile-time task scheduling for distributed-memory systems, list scheduling is generally accepted as an attractive approach since it pairs low cost with good results. List scheduling algorithms schedule tasks in order of their priority. This priority can be computed either 1) statically, before the scheduling, or 2) dynamically, during the scheduling. In this paper, we show that list scheduling with statically computed priorities can be performed at a significantly lower cost than existing approaches, without sacrificing performance. Our approach is general, i.e., it can be applied to any list scheduling algorithm with static priorities. The low-complexity is achieved by using low-complexity methods for the most time consuming parts in list scheduling algorithms, i.e., processor selection and task selection, preserving the criteria used in the original algorithms. We exemplify our method by applying it to the MCP algorithm. Using an extension of this method, we can also reduce the time complexity of a particular class of list scheduling with dynamic priorities (including algorithms such as DLS, ETF, or ERT). Our results confirm that the modified versions of the list scheduling algorithms obtain a performance comparable to their original versions, yet at a significantly lower cost. We also show that the modified versions of the list scheduling algorithms consistently outperform multistep algorithms, such as DSC-LLB, which also have higher complexity and clearly outperform algorithms in the same class of complexity, such as CPM.