Results 1 
8 of
8
Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors
, 1999
"... Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported ..."
Abstract

Cited by 326 (5 self)
 Add to MetaCart
Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported by the Hong Kong Research Grants Council under contract numbers HKUST 734/96E, HKUST 6076/97E, and HKU 7124/99E. Authors' addresses: Y.K. Kwok, Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong; email: ykwok@eee.hku.hk; I. Ahmad, Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong. Permission to make digital / hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and / or a fee. 2000 ACM 03600300/99/12000406 $5.00 ACM Computing Surveys, Vol. 31, No. 4, December 1999 1.
Benchmarking and Comparison of the Task Graph Scheduling Algorithms
, 1999
"... The problem of scheduling a parallel program represented by a weighted directed acyclic graph (DAG) to a set of homogeneous processors for minimizing the completion time of the program has been extensively studied. The NPcompleteness of the problem has stimulated researchers to propose a myriad of ..."
Abstract

Cited by 106 (2 self)
 Add to MetaCart
The problem of scheduling a parallel program represented by a weighted directed acyclic graph (DAG) to a set of homogeneous processors for minimizing the completion time of the program has been extensively studied. The NPcompleteness of the problem has stimulated researchers to propose a myriad of heuristic algorithms. While most of these algorithms are reported to be efficient, it is not clear how they compare against each other. A meaningful performance evaluation and comparison of these algorithms is a complex task and it must take into account a number of issues. First, most scheduling algorithms are based upon diverse assumptions, making the performance comparison rather purposeless. Second, there does not exist a standard set of benchmarks to examine these algorithms. Third, most algorithms are evaluated using small problem sizes, and, therefore, their scalability is unknown. In this paper, we first provide a taxonomy for classifying various algorithms into distinct categories a...
Mapping Heavy Communication GridBased Workflows onto Grid Resources Within An SLA Context Using Metaheuristics
 International Journal of High Performance Computing and Application (IJHPCA
, 2007
"... Service Level Agreements (SLAs) is currently one of the major research topics in grid computing. Among many system components for the SLArelated grid jobs, the SLA mapping mechanism has received wide spread attention. It is responsible for assigning subjobs of a workflow to a variety of grid resou ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Service Level Agreements (SLAs) is currently one of the major research topics in grid computing. Among many system components for the SLArelated grid jobs, the SLA mapping mechanism has received wide spread attention. It is responsible for assigning subjobs of a workflow to a variety of grid resources in a way that meets the user's deadline and costs as little as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within an SLA context gives rise to a complicated combinatorial optimization problem. This paper presents the application of various metaheuristics and suggests a possible approach to solve this problem. Performance measurements deliver evaluation results on the quality and efficiency of each method.
Compaction of schedules and a twostage approach for duplicationbased dag scheduling
 IEEE TRANS. PARALLEL DISTRIB. SYST
, 2008
"... Many DAG scheduling algorithms generate schedules that require prohibitively large number of processors. To address this problem, we propose a generic algorithm, SC, to minimize the processor requirement of any given valid schedule. SC preserves the schedule length of the original schedule and redu ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Many DAG scheduling algorithms generate schedules that require prohibitively large number of processors. To address this problem, we propose a generic algorithm, SC, to minimize the processor requirement of any given valid schedule. SC preserves the schedule length of the original schedule and reduces processor count by merging processor schedules and removing redundant duplicate tasks. To the best of our knowledge, this is the first algorithm to address this highly unexplored aspect of DAG scheduling. On the average, SC reduced the processor requirement 91%, 82 % and 72 % for schedules generated by PLW, TCSD and CPFD algorithms, respectively. SC algorithm has a low complexity (O(N  3)) compared to most duplication based algorithms. Moreover, it decouples processor economization from schedule length minimization problem. To take advantage of these features of SC, we also propose a scheduling algorithm SDS, having the same time complexity as SC. Our experiments demonstrate that, schedules generated by SDS are only 3 % longer than CPFD (O(N  4)), one of the best algorithms in that respect. SDS and SC together form a twostage scheduling algorithm that produces schedules with high quality and low processor requirement, and has lower complexity than the comparable algorithms that produce similar high quality results.
Center for REsearch And Telecommunication Experimentation for NETworked Communities
"... In the Grid Computing environment, many users need the results of their calculations within a specific period of time. Examples of those users are weather forecasters running weather forecasting workflows, and automobile producers running dynamic fluid simulation workflow Lovas et al. (2004). Those ..."
Abstract
 Add to MetaCart
In the Grid Computing environment, many users need the results of their calculations within a specific period of time. Examples of those users are weather forecasters running weather forecasting workflows, and automobile producers running dynamic fluid simulation workflow Lovas et al. (2004). Those users are willing to pay for getting their work completed
Chairperson
, 2006
"... I dedicate this thesis to my family, for their love and support iii NP Non polynomial GA Genetic algorithms TG Task graph V Finite set of vertices LIST OF ABBREVIATIONS AND SYMBOLS E Finite set of directed edges T i th computational task eij Directed edge from Ti to Tj Pi Static priority of i th com ..."
Abstract
 Add to MetaCart
(Show Context)
I dedicate this thesis to my family, for their love and support iii NP Non polynomial GA Genetic algorithms TG Task graph V Finite set of vertices LIST OF ABBREVIATIONS AND SYMBOLS E Finite set of directed edges T i th computational task eij Directed edge from Ti to Tj Pi Static priority of i th computational task DAG Directed acyclic graph MCP Multiple constrained path EDF Earliest deadline first HLF Highest level first HGA Hardware genetic algorithm Fi Fitness value of i th chromosome F Average fitness of the population PMX Partially matched crossover PSG Peer selected graph msec Milliseconds PGA Parallel genetic algorithm MPI Message passing interface iv FPGA Field programmable gate array
An Efficient ClusteringBased Task Scheduling Algorithm for Parallel Programs with Task Duplication *
"... This paper presents an efficient task scheduling algorithm for multiprocessor systems based on clustering with task duplication. This algorithm has a relatively small time complexity of O(E  log V) for a task graph of V  nodes and E  edges. Results from an extensive simulation run on randoml ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents an efficient task scheduling algorithm for multiprocessor systems based on clustering with task duplication. This algorithm has a relatively small time complexity of O(E  log V) for a task graph of V  nodes and E  edges. Results from an extensive simulation run on randomly generated graphs as well as several application graphs demonstrate a significant improvement in using the proposed technique over several wellknown fast techniques. Schedule lengths produced by the proposed algorithm are in general comparable to the ones generated by techniques with a much larger computation time requirement. Actual processing time required by this technique is among the smallest in all advanced techniques, while the number of processors needed is also among the least in all techniques.
Rights Creative Commons: Attribution 3.0 Hong Kong License Benchmarking the Task Graph Scheduling Algorithms
"... The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompleteness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are ind ..."
Abstract
 Add to MetaCart
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompleteness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compare against each other. A comprehensive performance evaluation and comparison of these algorithms entails addressing a number of difficult issues. One of the issues is that a large number of scheduling algorithms are based upon radically different assumptions, making their comparison on a unified basis a rather intricate task. Another issue is that there is no standard set of benchmarks that can be used to evaluate and compare these algorithms. Furthermore, most algorithms are evaluated using small problem sizes, and it is not clear how their performance scales with the problem size. In this paper, we first provide a taxonomy for classifying various algorithms into different categories according to their assumptions and functionalities. We then propose a set of benchmarks which are of diverse structures without being biased towards a particular scheduling technique and still allow variations in important parameters. We have evaluated 15 scheduling algorithms, and compared them using the proposed benchmarks. Based upon the design philosophies and principles behind these algorithms, we interpret the results and discuss why some algorithms perform better than the others.