Name
Abstract | ||
|---|---|---|
Parallel jobs are characterized for having processes that communicate and synchronize with each other frequently. A processor allocation strategy widely used in parallel supercomputers is Space-Sharing, that is assigning a processors partition to each job for its exclusive use. In this article we present a global solution to offer virtual Malleability on message-passing parallel jobs, by applying a processor allocation strategy, the Folding by JobType (FJT). This technique is based on Folding and Moldability concepts and tries to decide the optimal initial number of processes, when to fold jobs and the number of folding times by analyzing the current and past system information. At processor level, we apply Co-Scheduling. We implement and evaluate the FJT under several workloads with different job sizes, classes and machine utilization. Results show that the FJT adapts easily to load changes, and can obtain better performance than the rest evaluated, on workloads with high coefficient variation and especially with burst arrivals. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/PACT.2004.18 | IEEE PACT |
Keywords | Field | DocType |
optimal initial number,processor level,parallel supercomputers,implementing malleability,mpi jobs,processor allocation strategy,burst arrival,better performance,different job size,exclusive use,moldability concept,parallel job,resource allocation,message passing,job shop scheduling | Synchronization,Job shop scheduling,Computer science,Parallel computing,System information,Real-time computing,Machine utilization,Resource allocation,Processor scheduling,Malleability,Message passing,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2229-7 | 25 | 1.13 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gladys Utrera | 1 | 50 | 6.51 |
| Julita Corbalan | 2 | 174 | 12.00 |
| Jesus Labarta | 3 | 1389 | 92.33 |