Presentation is loading. Please wait.

Presentation is loading. Please wait.

June 6, 2002D.H.J. Epema/PDS/TUD1 Processor Co-Allocation in Multicluster Systems DAS-2 Workshop Amsterdam June 6, 2002 Anca Bucur and Dick Epema Parallel.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "June 6, 2002D.H.J. Epema/PDS/TUD1 Processor Co-Allocation in Multicluster Systems DAS-2 Workshop Amsterdam June 6, 2002 Anca Bucur and Dick Epema Parallel."— Presentation transcript:

1 june 6, 2002D.H.J. Epema/PDS/TUD1 Processor Co-Allocation in Multicluster Systems DAS-2 Workshop Amsterdam June 6, 2002 Anca Bucur and Dick Epema Parallel and Distributed Systems Group Delft University of Technology

2 june 6, 2002D.H.J. Epema/PDS/TUD2 Introduction (1) In multicluster systems (like the DAS, in GRIDs), jobs may use co-allocation (i.e., span multiple clusters): –to use available capacity –to process geographically spread data Single-application performance issues: –application restructuring –wide-area runtime systems (e.g., optimize collective communication operations) Multiple-application performance issues: –design/analyze scheduling policies –minimize response time, maximize maximal utilization

3 june 6, 2002D.H.J. Epema/PDS/TUD3 Introduction (2): Example In april 2001, the Cactus Computational Toolkit was used for four-hour astrophysics simulations involving Einstein’s General Relativity equations Equipment: –At NCSA: 480 CPUs of three SGI Origin2000 systems –At SDSC: 1020 CPUs of Blue Horizon –OC-12 622-Mbit/s network

4 june 6, 2002D.H.J. Epema/PDS/TUD4 Introduction (3): Problems time processors (pattern: idle) fits with if flexible fits with if unordered cluster 1 cluster 2 cluster 3 job: 1 23

5 june 6, 2002D.H.J. Epema/PDS/TUD5 System Model Multicluster system consisting of clusters of processors of equal speed Communication speed ratio : the ratio of the wide-area and local message transfer times ….

6 june 6, 2002D.H.J. Epema/PDS/TUD6 Job Components A job consists of job components that each go to a single cluster, one task per processor Distributions of job-component sizes: –Uniform: U[a,b] –Truncated and adapted geometric (favors small sizes and powers of 2): D(q) on [1,b] …. job system

7 june 6, 2002D.H.J. Epema/PDS/TUD7 Job Request Types (1) Ordered and unordered requests specify their job-component sizes: Ordered: Unordered: …. ?

8 june 6, 2002D.H.J. Epema/PDS/TUD8 Job Request Types (2) Flexible and total requests only specify the total number of processors needed: flexible: total: …. ?

9 june 6, 2002D.H.J. Epema/PDS/TUD9 Fitting a Job (1) It is clear when an ordered or a total request fits For an unordered request: –order components according to decreasing sizes –use First-Fit (FF) or Worst-Fit (WF) …. job system WF.… in use idle

10 june 6, 2002D.H.J. Epema/PDS/TUD10 Fitting a Job (2) For a flexible request: –determine minimal number of clusters needed –fill least-loaded clusters (CF) completely, or balance load (LB) (variation: LB-A) CFLB in use idle job

11 june 6, 2002D.H.J. Epema/PDS/TUD11 Scheduling Policies First Come First Served Fit Processors First Served: search queue for jobs that fit job queue …. system

12 june 6, 2002D.H.J. Epema/PDS/TUD12 Interarrival/Service Times Poisson arrival process in simulations All tasks in a job have the same service time Service-time distributions used: –Deterministic (mean 1) –Exponential (mean 1) –Hyperexponential (mean 1, coeff. of var. 3) –Derived from the DAS

13 june 6, 2002D.H.J. Epema/PDS/TUD13 Communication We model jobs without and with communication With communication: –tasks alternate between compute and communication phases –communication phase: all-to-all personalized communication –time for a single local synchronous message send operation: 0.001 –communication speed ratios considered: 1-100

14 june 6, 2002D.H.J. Epema/PDS/TUD14 Single-cluster DAS Statistics service timenodes requested number of jobs mean: 23.34 coeff. of var.: 1.11 mean: 356.45 (62.66) coeff. of var.: 5.37

15 june 6, 2002D.H.J. Epema/PDS/TUD15 Performance Evaluation Parameters we vary: –job request structure –job-component-size distribution –service-time distribution –number and sizes of clusters (base case: 4x32) –placement of unordered and flexible jobs –scheduling policy –communication speed ratio –co-allocation versus no co-allocation –queueing structure (global/local) Performance metrics: –mean response time (only simulation) –maximal utilization (analysis and simulation)

16 june 6, 2002D.H.J. Epema/PDS/TUD16 Influence of Structure and Size response time total ordered unordered utilization distributionmeancoeff.of var. U[1,7]4.0000.500 D(0.9) on [1,8]3.9960.569 D(0.768)on[1,32]3.9960.829 U[1,14]7.5000.537 D(0.894)on[1,32]7.4760.884

17 june 6, 2002D.H.J. Epema/PDS/TUD17 Influence of Communication Speed Ratio utilization response time 10100 response time Right to left: total, flexible, unordered, ordered

18 june 6, 2002D.H.J. Epema/PDS/TUD18 Co-Allocation versus no Co-Alloc. (1) utilization response time flexible 2 components 4 components 1 component no communication unordered jobs job size: 4xD(0.9) on [1,8] (fits on a single cluster)

19 june 6, 2002D.H.J. Epema/PDS/TUD19 Co-allocation versus no Co-alloc. (2) utilization response time LB-A, ratio 5 LB-A, ratio 50 no co-allocation, FF communication flexible jobs job size: 4xD(0.9) on [1,8]

20 june 6, 2002D.H.J. Epema/PDS/TUD20 An Application on the DAS (1) Solves the Poisson equation with a red-black Gauss-Seidel scheme Measurements on the DAS (times in ms): Time for diffusing local errors and computing the global error: 14 ms Configuration on unit square number of iterations updateexchange borders, single cluster exchange borders, multicluster 4x224360.9620.4296.6 4x421320.4980.3877.0

21 june 6, 2002D.H.J. Epema/PDS/TUD21 An Application on the DAS (2) utilization response time Equal mix of jobs of sizes (2,2,2,2) and (4,4,4,4) total ordered

22 june 6, 2002D.H.J. Epema/PDS/TUD22 Maximal Utilization (1) Assume: constant backlog, ordered jobs, exponential service (no communication) Consider: the joint probability distribution of the sizes of jobs in the system Result: this distribution is the same –when the system runs for a long time –when the system is filled from the empty state Use the convolution of the job-size distribution to determine the distribution of the numbers of jobs in the system Compute the maximal utilization

23 june 6, 2002D.H.J. Epema/PDS/TUD23 Maximal Utilization (2) We have an approximation for the maximal utilization for unordered jobs with WF We use simulations to validate this approximation Capacity loss (1-max. util.) for 4 clusters of size 32, uniform job-component sizes: abordered (exact) unordered (approx.) unordered (simul.) total (exact) 140.1490.0500.0530.038 150.1760.0650.0670.047 1130.3450.1870.1920.120 1160.3800.2330.2390.148

Download ppt "June 6, 2002D.H.J. Epema/PDS/TUD1 Processor Co-Allocation in Multicluster Systems DAS-2 Workshop Amsterdam June 6, 2002 Anca Bucur and Dick Epema Parallel."

Similar presentations

Operations Scheduling

Operations Scheduling
7 april 2006 1 SP3.1: High-Performance Distributed Computing The KOALA grid scheduler and the Ibis Java-centric grid middleware Dick Epema Catalin Dumitrescu,

7 april SP3.1: High-Performance Distributed Computing The KOALA grid scheduler and the Ibis Java-centric grid middleware Dick Epema Catalin Dumitrescu,
Hadi Goudarzi and Massoud Pedram

Hadi Goudarzi and Massoud Pedram
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.

A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila 23.01.2013.

Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
WS-VLAM: Towards a Scalable Workflow System on the Grid V. Korkhov, D. Vasyunin, A. Wibisono, V. Guevara-Masis, A. Belloum Institute.

WS-VLAM: Towards a Scalable Workflow System on the Grid V. Korkhov, D. Vasyunin, A. Wibisono, V. Guevara-Masis, A. Belloum Institute.
June 3, 2015 Synthetic Grid Workloads with Ibis, K OALA, and GrenchMark CoreGRID Integration Workshop, Pisa A. Iosup, D.H.J. Epema Jason Maassen, Rob van.

June 3, 2015 Synthetic Grid Workloads with Ibis, K OALA, and GrenchMark CoreGRID Integration Workshop, Pisa A. Iosup, D.H.J. Epema Jason Maassen, Rob van.
Reference: Message Passing Fundamentals.

Reference: Message Passing Fundamentals.
1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.

1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.

AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
DAS-3/Grid’5000 meeting: 4th December 20061 The KOALA Grid Scheduler over DAS-3 and Grid’5000 Processor and data co-allocation in grids Dick Epema, Alexandru.

DAS-3/Grid’5000 meeting: 4th December The KOALA Grid Scheduler over DAS-3 and Grid’5000 Processor and data co-allocation in grids Dick Epema, Alexandru.
Dynamic Load Balancing Experiments in a Grid Vrije Universiteit Amsterdam, The Netherlands CWI Amsterdam, The

Dynamic Load Balancing Experiments in a Grid Vrije Universiteit Amsterdam, The Netherlands CWI Amsterdam, The
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.

OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
An Introduction to Parallel Computing Dr. David Cronk Innovative Computing Lab University of Tennessee Distribution A: Approved for public release; distribution.

An Introduction to Parallel Computing Dr. David Cronk Innovative Computing Lab University of Tennessee Distribution A: Approved for public release; distribution.
Fault-tolerant Adaptive Divisible Load Scheduling Xuan Lin, Sumanth J. V. Acknowledge: a few slides of DLT are from Thomas Robertazzi ’ s presentation.

Fault-tolerant Adaptive Divisible Load Scheduling Xuan Lin, Sumanth J. V. Acknowledge: a few slides of DLT are from Thomas Robertazzi ’ s presentation.
I think your suggestion is, Can we do two things at once? Well, we’re of the view that we can walk and chew gum at the same time. —Richard Armitage, deputy.

I think your suggestion is, Can we do two things at once? Well, we’re of the view that we can walk and chew gum at the same time. —Richard Armitage, deputy.
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.

1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Performance Evaluation

Performance Evaluation
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.

1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Gerhard Maierbacher Scalable Coding Solutions for Wireless Sensor Networks IT.

© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Gerhard Maierbacher Scalable Coding Solutions for Wireless Sensor Networks IT.

Similar presentations

Ads by Google