(Enter summary)
Abstract: Although theoretical results have been established regarding
the utility of pre-emptive scheduling in reducing
average job turn-around time, job suspension/restart is
not much used in practice at supercomputer centers for
parallel job scheduling. A number of questions remain
unanswered regarding the practical utility of pre-emptive
scheduling. We explore this issue through a simulationbased
study, using job logs from a supercomputer center.
We develop a tunable selective-suspension strategy,... (Update)
Context of citations to this paper: More
...turn around time. There has been considerable prior research into each of the two topics of i) scheduling of parallel jobs [1,2,6,10,14,19,20,23,24,26], and ii) contiguous node allocation strategies [3,4,5,11,13,27] There have also been a few studies that have considered...
Cited by: More
Selective Buddy Allocation for Scheduling Parallel.. - Subramani.. (2002)
(Correct)
Active bibliography (related documents): More All
0.3: The Impact of More Accurate Requested Runtimes on.. - Chiang.. (2002)
(Correct)
0.2: Selective Reservation Strategies for Backfill Job.. - Srinivasan.. (2002)
(Correct)
0.2: Loosely Coordinated Coscheduling In The Context Of . . . - Sodan (2005)
(Correct)
Similar documents based on text: More All
0.5: Distributed Job Scheduling on Computational Grids.. - Subramani.. (2002)
(Correct)
0.2: Communication Modeling of Heterogeneous Networks.. - Banikazemi.. (1999)
(Correct)
0.2: QoPS: A QoS based scheme for Parallel Job Scheduling - Mohammad Islam Pavan (2003)
(Correct)
BibTeX entry: (Update)
R. Kettimuthu, V. Subramani, S. Srinivasan, T. B. Gopalsamy, D K Panda and P Sadayappan, "Selective Preemption Strategies for Parallel Job Scheduling", to appear in the Proc. Int'l Conf. Parallel Processing, 2002. http://citeseer.ist.psu.edu/kettimuthu02selective.html More
@misc{ kettimuthu02selective,
author = "R. Kettimuthu and V. Subramani and S. Srinivasan and T. Gopalsamy and D.
Panda and P. Sadayappan",
title = "Selective Preemption Strategies for Parallel Job Scheduling",
text = "R. Kettimuthu, V. Subramani, S. Srinivasan, T. B. Gopalsamy, D K Panda
and P Sadayappan, Selective Preemption Strategies for Parallel Job Scheduling,
to appear in the Proc. Int'l Conf. Parallel Processing, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/kettimuthu02selective.html" }
Citations (may not include all citations):
137
The performance of multiprogrammed multiprocessor scheduling.. (context) - Leutenneger, Vernon - 1990
98
Processor scheduling in shared memory multiprocessors (context) - Zahorjan, McCann - 1990
81
Theory and practice in parallel job scheduling
- Feitelson, Rudolph et al. - 1997
80
Application scheduling and processor allocation in multiprog..
- Sevcik - 1994
69
Use of application characteristics and limited preemption fo..
- Chiang, Mansharamani et al. - 1994
54
ANLIBM SP scheduling system (context) - ANL, scheduling et al. - 1995
46
The EASY - LoadLeveler API project (context) - Skovira, Chan et al. - 1996
20
Core algorithms of the Maui scheduler
- Jackson, Snell et al. - 2001
19
Preemptive scheduling of parallel jobs on multiprocessors
- Deng, Gu et al. - 1996
18
Implementing multiprocessor scheduling disciplines
- Parsons, Sevcik - 1997
17
and user runtime estimates in scheduling the ibm sp2 with ba.. (context) - Mu'alem, Feitelson et al. - 2001
8
and adaptation in batch schedulers (context) - Perkovic, Keleher et al. - 2000
7
Production job scheduling for parallel shared memory systems
- Chiang, Vernon - 2002
http://www.cs.huji
Documents on the same site (http://www.cis.ohio-state.edu/~saday/): More
Loop Optimizations for a Class of Memory-Constrained.. - Cociorva Wilkins Dept (2001)
(Correct)
Towards Automatic Synthesis of High-Performance.. - Cociorva.. (2001)
(Correct)
Optimization of Memory Usage Requirement for a.. - Lam, Cociorva.. (1999)
(Correct)
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