Jitendra Padhye  Home/Search
Context Related
| umass.edu/~jitu/publications/ms.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: umass.edu/~jitu/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: When a parallel job arrives at a space-sharing multiprocessor system, a decision has to be made regarding the number and the specific identities of the allocated processors. A preemptive partitioning policy may preempt one or more of the currently running jobs to accommodate the new arrival. A non-preemptive policy may consider the state of the system at arrival time, however, it does not allow preemption of a job once the execution begins. In this paper preemptive and non-preemptive... (Update)
Similar documents based on text: More All
0.2: Identical Parallel Machines Vs. Unit-Time Shops, Preemptions Vs. .. - Timkovsky (1998) (Correct)
0.2: Slotted-Ring Local Area Networks With Multiple Priority.. - Sarin, Deliç, Kim (Correct)
0.2: Optimal Scheduling on Parallel Processors under Precedence.. - Liu, Righter (1996) (Correct)
BibTeX entry: (Update)
J. D. Padhye and L. W. Dowdy. Preemptive versus non-preemptive processor allocation policies for message passing parallel computers: An empirical comparison. In Proceedings of the 2nd Workshop on Job Scheduling Strategies for Parallel Processing, April 1996. http://citeseer.ist.psu.edu/padhye95preemptive.html More
@misc{ padhye96preemptive,
author = "J. Padhye and L. Dowdy",
title = "Preemptive versus non-preemptive processor allocation policies for message
passing parallel computers: An empirical comparison",
text = "J. D. Padhye and L. W. Dowdy. Preemptive versus non-preemptive processor
allocation policies for message passing parallel computers: An empirical
comparison. In Proceedings of the 2nd Workshop on Job Scheduling Strategies
for Parallel Processing, April 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/padhye95preemptive.html" }
Citations (may not include all citations):198 Scheduling techniques for concurrent systems (context) - Ousterhout - 1982
190 Process control and scheduling issues for multiprogrammed sh.. (context) - Tucker, Gupta - 1989
137 A dynamic processor allocation policy for multiprogrammed sh.. (context) - McCann, Vaswani et al. - 1993
137 The performance of multiprogrammed multiprocessor scheduling.. (context) - Leutenegger, Vernon - 1990
126 The impact of operating system scheduling policies and synch.. (context) - Gupta, Tucker et al. - 1991
120 Speedup versus efficiency in parallel systems (context) - Eager, Zahorjan et al. - 1989
112 Characterization of parallelism in applications and their us.. (context) - Sevcik - 1989
98 Processor scheduling in shared memory multiprocessors (context) - Zahorjan, McCann - 1990
80 Application scheduling and processor allocation in multiprog.. - Sevcik - 1994
80 Scheduling in multiprogrammed parallel systems (context) - Majumdar, Eager et al. - 1988
77 Processor working set and its use in scheduling multiprocess.. (context) - Ghosal, Serazzi et al. - 1991
73 PICL, A PORTABLE INSTRUMENTED COMMUNICATION LIBRARY, C REFER.. (context) - Geist, Heath et al.
69 Use of application characteristics and limited preemption fo.. - Chiang, Mansharamani et al. - 1994
53 Wiley Interscience (context) - Kleinrock, Systems - 1975
52 Robust partitioning policies for multiprocessor systems - Rosti, Smirni et al. - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://gaia.cs.umass.edu/~jitu/publications.html): More
A Simple Lan File Placement Strategy - Padhye Rahatekar Dowdy (Correct)
Can Intelligent Prefetching Make Web Browsing Faster? - Padhye (1996) (Correct)
MANIC: Multimedia Asynchronous Networked Individualized Courseware - Jesse (1997) (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