Proceedings of the 3rd International Workshop on Middleware for Grid Computing - MGC '05 2005
DOI: 10.1145/1101499.1101512
|View full text |Cite
|
Sign up to set email alerts
|

Efficient hierarchical self-scheduling for MPI applications executing in computational Grids

Abstract: The execution of distributed applications on the grid is already a reality. As both the number of applications grow and grids scale, efficient utilization of the available but shared heterogeneous resources will be essential. The EasyGrid middleware is a hierarchically distributed Application Management System embedded into MPI applications to facilitate their efficient execution in computational grids. The overhead of employing a distinct AMS to make each application system aware does however bring at least t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2008
2008
2010
2010

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…The EasyGrid middleware is a hierarchically distributed Application Management System (AMS) which is embedded automatically into a user's parallel MPI application without modifications to the original code by a scheduling portal [2]. Each EasyGrid AMS is a three-level hierarchical management system for application-specific self-scheduling and distinct scheduling policies can be used at each level, even within the same level.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The EasyGrid middleware is a hierarchically distributed Application Management System (AMS) which is embedded automatically into a user's parallel MPI application without modifications to the original code by a scheduling portal [2]. Each EasyGrid AMS is a three-level hierarchical management system for application-specific self-scheduling and distinct scheduling policies can be used at each level, even within the same level.…”
Section: Related Workmentioning
confidence: 99%
“…Chronopoulos et al proposed a distributed self-scheduling algorithm which takes CPU computation powers as weights that scale the size of iterations each computer is assigned to compute [2,3]. Their method can be used to improve the performance of various self-scheduling algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…It is based on multiple-queue management with respect to both a super scheduling scheme for distributing jobs to overall nodes and a local scheduling scheme for assigning jobs within a node. Cristina Boeres et al (2005) present EasyGrid middleware which is a hierarchically distributed application management system embedded into MPI applications to facilitate their efficient execution in computational grids. Abawajy and Dandamudi (2003) propose an on-line dynamic scheduling policy that manages multiple job streams across both single and multiple cluster computing systems with the objectives of improving the mean response time and system utilization.…”
Section: Related Workmentioning
confidence: 99%