Investigation of the DAG eligible jobs maximization algorithm in a grid

Authors:
T. Szepieniec;M. Bubak
Affiliations:
Acad. Comput. Centre CYFRONET, Krakow;Inst. of Comput. Sci. AGH, Krakow
Venue:
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Year:
2008

Citing 8
Cited 2

On the complexity of list scheduling algorithms for distributed-memory systems

ICS '99 Proceedings of the 13th international conference on Supercomputing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing

IEEE Transactions on Computers
Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids

SBAC-PAD '05 Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing
Toward a Theory for Scheduling Dags in Internet-Based Computing

IEEE Transactions on Computers
Scheduling workflow applications on processors with different capabilities

Future Generation Computer Systems - Collaborative and learning applications of grid technology
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality

IEEE Transactions on Parallel and Distributed Systems
A joint data and computation scheduling algorithm for the grid

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Multiple Workflow Scheduling Strategies with User Run Time Estimates on a Grid

Journal of Grid Computing
Stochastic DAG scheduling using a Monte Carlo approach

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A significant influence of heterogeneity and uncertainty of grid environment on quality of DAG schedules results in a search for new approaches. One of them is Internet-based computing scheduling approach and PRIO algorithm for DAG scheduling. In this paper, we present results of a detailed evaluation of the PRIO algorithms in a heterogeneous environment in which schedulers may recognize performance of resources.