A tool for the design and evaluation of hybrid scheduling algorithms for computational grids

Authors:
B. A. Vianna;A. A. Fonseca;N. T. Moura;L. T. Menezes;H. A. Mendes;J. A. Silva;C. Boeres;V. E. F. Rebello
Affiliations:
Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil;Universidade Federal Fluminense (UFF), Rua Passo da Pãtria, Niterói, RJ, Brazil
Venue:
MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
Year:
2004

Citing 13
Cited 0

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

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)
List scheduling of general task graphs under LogP

Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Simgrid: A Toolkit for the Simulation of Application Scheduling

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics

SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
EasyGrid: towards a framework for the automatic Grid enabling of legacy MPI applications: Research Articles

Concurrency and Computation: Practice & Experience - Middleware for Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the objectives of computational grids is to offer applications the collective computational power of distributed but typically shared heterogeneous resources. Unfortunately, efficiently harnessing the performance potential of such systems (i.e. how and where applications should execute on the grid) is a challenging endeavor due principally to the distributed, shared and heterogeneous nature of the resources involved. This paper presents a tool to aid the design and evaluation of scheduling policies suitable for efficient execution of parallel applications on computational grids.