2005
DOI: 10.1002/cpe.965
|View full text |Cite
|
Sign up to set email alerts
|

An EasyGrid portal for scheduling system‐aware applications on computational Grids

Abstract: SUMMARYOne 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 very distributed, shared and heterogeneous nature of the resources involved. A crucial step towards solving this problem is the need to identify both an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 25 publications
0
11
0
Order By: Relevance
“…Since the cost of scheduling an application at compile time is generally neglected, more sophisticated heuristics can be employed [3]. By taking advantage of the static scheduler's ability to analyze the whole application and the dynamic scheduler's access to accurate runtime system information, more informed scheduling decisions can be made quickly.…”
Section: Hybrid Schedulingmentioning
confidence: 99%
See 3 more Smart Citations
“…Since the cost of scheduling an application at compile time is generally neglected, more sophisticated heuristics can be employed [3]. By taking advantage of the static scheduler's ability to analyze the whole application and the dynamic scheduler's access to accurate runtime system information, more informed scheduling decisions can be made quickly.…”
Section: Hybrid Schedulingmentioning
confidence: 99%
“…computing power, communication costs) be captured by an architectural model. In a DAG G = (V , E, ε, ω): the set of vertices, V , represent tasks; E is the precedence relation among the tasks; ε(v) is the amount of work associated to task v ∈ V ; and ω(u, v) is the weight associated to the edge (u, v) ∈ E, representing the amount of data transmitted from task u to v. Given the set of Grid machines the user has access to and their availability, the EasyGrid scheduling portal executes an MPI modelling program with the user's Grid credentials (the Grid community has adopted a public key infrastructure for authentication on Grid resources) to estimate the likely performance available to the user's application [3]. This information forms the architectural model upon which, together with a DAG representation of the application, the portal employs a selection of scheduling heuristics to find a good initial schedule [3].…”
Section: Static Schedulingmentioning
confidence: 99%
See 2 more Smart Citations
“…The AMS is embedded automatically into a user's parallel MPI application without modifications to the original code by a scheduling Portal which also acts as a simple RMS [3]. The implementation of an AMS and the viability of transforming legacy cluster based MPI applications into system-aware ones capable of executing in grid environments was discussed in [11].…”
Section: Introductionmentioning
confidence: 99%