2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)
DOI: 10.1109/ccgrid.2002.1017110
|View full text |Cite
|
Sign up to set email alerts
|

On Advantages of Grid Computing for Parallel Job Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
101
0
1

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 126 publications
(102 citation statements)
references
References 12 publications
0
101
0
1
Order By: Relevance
“…However, co-allocation is not without cost; although it is expected to reduce the average job response time [12], it has the potential drawback of increased execution times of applications due to low network bandwidth and high latency over wide-area networks. Hence, the performance of co-allocation may be severely affected by the slow inter-cluster connections.…”
Section: Co-allocationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, co-allocation is not without cost; although it is expected to reduce the average job response time [12], it has the potential drawback of increased execution times of applications due to low network bandwidth and high latency over wide-area networks. Hence, the performance of co-allocation may be severely affected by the slow inter-cluster connections.…”
Section: Co-allocationmentioning
confidence: 99%
“…If the placement succeeds, this means the total processors requested of the job is satisfied; hence the job is placed successfully. Otherwise, if the processor request is more than what is available in the cluster considered, it places a component with a size equal to the number of idle processors of that cluster, and subsequently, updates the number of processors requested for the remaining number of requested processors (line [10][11][12][13][14]. After traversing the complete ordered cluster sequence, if the processor request cannot be satisfied, the job is put into the placement queue of KOALA (lines [16][17][18].…”
Section: The Flexible Cluster Minimization Policymentioning
confidence: 99%
“…There, we considered both synthetics workloads, and workloads derived from the logs of the DAS and from application runtimes on the DAS. In [11,12], co-allocation (called multi-site computing there) is studied with simulations, with as performance metric the average weighted response time. One of the most important findings is that when the slowdown of jobs due to the wide-area communication is less than or equal to 1:25, it pays to use co-allocation.…”
Section: Related Workmentioning
confidence: 99%
“…Many studies propose either a distributed management system (Ernemann and Yahyapour 2003) or centralized scheduling (Ernemann et al 2002). There are also combinations of distributed and centralized management (Vazquez-Poletti et al 2007) that can be characterized as a type of hierarchical multilayer resource management system (Schwiegelshohn et al 2008).…”
Section: Introductionmentioning
confidence: 99%