K. Aida, "Effect of job size characteristics on job scheduling performance, " in In Job Scheduling Strategies for Parallel Processing. LNCS 1911.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of a 2D chart with time along one axis and the number of processors along the other axis. Each job can be thought of as a rectangle whose length is the user estimated run time and width is the number of processors required. Parallel job scheduling strategies have been widely studied in the past [13, 14, 15, 7, 1] .The simplest way to schedule jobs is to use the First Come First Served (FCFS) policy. This approach suffers from low system utilization. Backfilling [2, 8, 6] was proposed to improve system utilization and has been implemented in several production schedulers [5] Backfilling works by ....

K. Aida. Effect of Job Size Characteristics on Job Scheduling Performance. In JSSPP, pages 1--17, 2000.

....fit) and thus complete sooner. Therefore s is the request whose first fit in the allocation list produces the shortest completion time. Consequently, r and s are the same request. 3. Workload Models The performance of a scheduling solution is influenced by the workload submitted to the system [2] [44] 67] 90] Realistic workloads are crucial to establish how scheduling solutions perform in practice. Therefore, in order to evaluate how SA is going to perform in practice, we need to determine the mix of moldable jobs that is likely to compose a supercomputer workload in real life. ....

....preemption (i.e. preemption within the threads in a processor) and (iii) preemption over parallel jobs as a whole (a.k.a. gang scheduling) Most supercomputers currently run jobs until completion. This makes nopreemptive policies of great interest for researchers in supercomputing scheduling [1] [2] [24] 32] 43] 66] 67] 69] 82] 90] Local preemption seems to be of little value for supercomputer scheduling due to their negative impact on the performance of tightly coupled parallel jobs [38] Gang scheduling has been shown to improve performance under a variety of scenarios [42] 54] ....

[Article contains additional citation context not shown here]

Kento Aida. Effect of Job Size Characteristics on Job Scheduling Performance. In Job Scheduling Strategies for Parallel Processing, Dror Feitelson and Larry Rudolph (Eds.), Springer-Verlag, Lecture Notes in Computer Science vol. 1911.

....this may create another available slot. Such a slot is backfilled in the same way. The process stops only when no more backfilling can be done. 2.2. Supercomputer Workloads It is well known that the performance of a scheduling solution is influenced by the workload submitted to the system [2] [15] 21] 33] Realistic workloads are thus crucial to establish how scheduling solutions perform in practice. Therefore, in order to evaluate how SA is going to perform in practice, we need to determine the mix of moldable jobs that is likely to compose a supercomputer workload in real life. ....

....high cost of task migration, and (iii) the need to simultaneously make available all processors allocated to a job. In current practice, supercomputer schedulers accept rigid requests [17] 20] 22] 27] and thus much of the research available in the literature assume jobs to be rigid, e.g. 1] [2] [14] 21] 33] Closer to our own work, there has been studies on processor allocation [3] 8] 10] 12] 16] 19] 23] 25] 28] 29] 30] 31] Processor allocation consists of enabling the supercomputer scheduler to select how many processors to allocate to a parallel job based on information ....

K. Aida. "Effect of Job Size Characteristics on Job Scheduling Performance". Job Scheduling Strategies for Parallel Processing, Springer-Verlag LNCS vol. 1911.

....NAS SGI O2K job traces. Zotkin and Keleher [29] evaluate a priority backfill with highest priority for the shortest requested runtime, and show that it improves mean slowdown for two job traces by over 50 compared to FCFS backfill. However, Zhang et al. 28] did not find such improvement. Aida [1] showed that FCFS firstfit has better mean response time than FCFS backfill. Chiang et al. 3] evaluate a non preemptive policy (ASP) with a preemptive small initial quantum, and show that immediate service improves the performance of ASP. Perkovic and Keleher [20] propose augmenting a variety of ....

K. Aida. Effect of job size characteristics on job scheduling performance. Proc. 6th Workshop on Job Scheduling Strategies for Parallel Processing, Cancun, May

....high cost of task migration, and (iii) the need to simultaneously make available all processors allocated to a job. In current practice, supercomputer schedulers accept rigid requests [20] 23] 25] 28] and thus much of the research available in the literature assume jobs to be rigid, e.g. 1] [2] [16] 19] 24] 33] 35] Closer to our own work, there has been studies on processor allocation [3] 5] 12] 14] 18] 29] 30] 31] 32] Processor allocation consists of selecting how many processors to allocate to a parallel job based on information about the characteristics of the job ....

....this may create another available slot. Such a slot is backfilled in the same way. The process stops only when no more backfilling can be done. 4.2. Supercomputer Workloads It is well known that the performance of a scheduling solution is influenced by the workload submitted to the system [2] [17] 24] 35] Realistic workloads are thus crucial to establish how scheduling solutions perform in practice. Therefore, in order to evaluate how SA is going to perform in practice, we need to determine the mix of moldable jobs that is likely to compose a supercomputer workload in real life. ....

[Article contains additional citation context not shown here]

K. Aida. Effect of Job Size Characteristics on Job Scheduling Performance. In Job Scheduling Strategies for Parallel Processing, Feitelson and Rudolph (Eds.), Springer-Verlag Lecture Notes in Computer Science, vol.

No context found.

K. Aida, "Effect of job size characteristics on job scheduling performance, " in In Job Scheduling Strategies for Parallel Processing. LNCS 1911.

No context found.

K. aida. Effect of job size characteristics on job scheduling performance. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 1-- 17. Springer, 2000.

No context found.

K. Aida. Effect of Job Size Characteristics on Job Scheduling Performance. In JSSPP, pages 1--17, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC