On a scheduling problem where a job can be executed only by a limited number of processors
Computers and Operations Research
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Scheduling unit-time jobs on processors with different capabilities
Computers and Operations Research
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
IEEE Transactions on Parallel and Distributed Systems
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
A comparison of list schedules for parallel processing systems
Communications of the ACM
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
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
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Fast and Effective Task Scheduling in Heterogeneous Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Integrating List Heuristics into Genetic Algorithms for Multiprocessor Scheduling
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Scheduling Algorithms
Iterative list scheduling for heterogeneous computing
Journal of Parallel and Distributed Computing
Task scheduling strategies for workflow-based applications in grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
A New Approach to Scheduling Parallel Programs Using Task Duplication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
A decentralized resource allocation policy in minigrid
Future Generation Computer Systems
Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Adaptive service scheduling for workflow applications in Service-Oriented Grid
The Journal of Supercomputing
An effective compaction strategy for bi-criteria DAG scheduling in grids
International Journal of Communication Networks and Distributed Systems
Sequence automata for researching consensus levels
Transactions on Computational Collective Intelligence VIII
Scheduling parameter sweep workflow in the Grid based on resource competition
Future Generation Computer Systems
Reliable workflow scheduling with less resource redundancy
Parallel Computing
An Adaptive Grid Workflow Scheduling Based on Bottleneck Detection and Execution Context
Proceedings of International Conference on Information Integration and Web-based Applications & Services
Hi-index | 0.00 |
Efficient scheduling of workflow applications represented by weighted directed acyclic graphs (DAG) on a set of heterogeneous processors is essential for achieving high performance. The optimization problem is NP-complete in general. A few heuristics for scheduling on heterogeneous systems have been proposed recently. However, few of them consider the case where processors have different capabilities. In this paper, we present a novel list scheduling based algorithm to deal with this situation. The algorithm (SDC) has two distinctive features. First, the algorithm takes into account the effect of Percentage of Capable Processors (PCP) when assigning the task node weights. For two task nodes with same average computation cost, our weight assignment policy tends to give higher weight to the task with small PCP. Secondly, during the processor selection phase, the algorithm adjusts the effective Earliest Finish Time strategy by incorporating the average communication cost between the current scheduling node and its children. Comparison study shows that our algorithm performs better than related work overall.