See this document in CiteSeerX!

Comparison of Processor Allocation Policies for Parallel Systems  (Make Corrections)  (2 citations)
Rajesh K. Mansharamani, Mary K. Vernon



  Home/Search   Context   Related

 
View or download:
wisc.edu/techreports/rep...tr1194.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisc.edu/~arch/uwa...tech_reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The increasing use of parallel systems has led to the development of a number of multiprogrammed processor allocation policies. This paper analyzes the following four policies that have previously been shown to have high performance under specific workloads: adaptive static partitioning (ASP), dynamic first-comefirst -serve (FCFS), preemptive smallest available parallelism first (PSAPF), and spatial equipartitioning (EQS). The results in this paper are derived for a general workload model that... (Update)

Context of citations to this paper:   More

.... for PSAPF is to consider modifying the interpolation on p to account for the priority given to jobs with smaller parallelism [22]. Due to space constraints, and because it is not needed for the comparisons in the next section, we do not pursue this approach further...

...performance metric, without regard for individual jobs. In most cases, this metric is average turnaround time [12] 21] 19] 20] 11] [13] [4] 18] although some studies also consider throughput [16] Rosti, Smirni et al. 17] 22] use power, which is the ratio of throughput...

Cited by:   More
Using Queue Time Predictions for Processor Allocation - Downey (1997)   (Correct)
Approximate Analysis of Parallel Processor Allocation Policies - Mansharamani, Vernon   (Correct)

Similar documents (at the sentence level):
7.7%:   Qualitative Behavior of the EQS Parallel Processor.. - Rajesh Mansharamani (1993)   (Correct)

Active bibliography (related documents):   More   All
1.0:   Use of Application Characteristics and Limited.. - Chiang, Mansharamani, .. (1994)   (Correct)
0.4:   Dynamic vs. Static Quantum-Based Parallel Processor Allocation - Chiang, Vernon (1996)   (Correct)
0.4:   Response Time Bounds for Parallel Processor Allocation.. - Agrawal, Mansharamani.. (1993)   (Correct)

Similar documents based on text:   More   All
0.1:   Evaluating the Mean Completion Time of a Fork-Join Barrier.. - John Strikwerda (1993)   (Correct)
0.1:   Group-Guaranteed Channel Capacity in Multimedia Storage Servers - Tsiolis, Vernon (1997)   (Correct)
0.1:   Multiprocessor Scheduling for High-Variability Service Time.. - Parsons, Sevcik (1995)   (Correct)

Related documents from co-citation:   More   All
2:   Scheduling in Multiprogrammed Parallel Systems (context) - Majumdar, Eager et al. - 1988
2:   The processor working set and its use in scheduling multiprocessor systems (context) - Ghosal, Serazzi et al. - 1991
2:   An analysis of several processor partitioning policies for parallel computers (context) - Setia, Tripathi - 1991

BibTeX entry:   (Update)

R. Mansharamani, and M. Vernon. Comparison of Processor Allocation Policies for Parallel Systems. In preparation. http://citeseer.ist.psu.edu/246554.html   More

@techreport{ mansharamani93comparison,
    author = "Rajesh K. Mansharamani and Mary K. Vernon",
    title = "Comparison of Processor Allocation Policies for Parallel Systems",
    number = "CS-TR-1993-1194",
    year = "1993",
    url = "citeseer.ist.psu.edu/246554.html" }
Citations (may not include all citations):
524   Queueing Systems (context) - Kleinrock - 1975
251   Reversibility and Stochastic Networks (context) - Kelly - 1979
201   Nonlinear Programming: Theory and Algorithms (context) - Bazaraa, Shetty - 1979
190   Process Control and Scheduling Issues for Multiprogrammed Sh.. (context) - Tucker, Gupta - 1989
159   Matrix-Geometric Solutions in Stochastic Models: An Algorith.. (context) - Neuts - 1981
137   A Dynamic Processor Allocation Policy for Multiprogrammed (context) - McCann, Vaswani et al. - 1993
137   The Performance of Multiprogrammed Multiprocessor Scheduling.. (context) - Leutenegger, Vernon - 1990
98   Processor Scheduling in Shared Memory Multiprocessors (context) - Zahorjan, McCann - 1990
80   Scheduling in Multiprogrammed Parallel Systems (context) - Majumdar, Eager et al. - 1988
80   Application scheduling and processor allocation in multiprog.. - Sevcik
77   The Processor Working Set and Its Use in Scheduling Multipro.. (context) - Ghosal, Serazzi et al. - 1991
74   The Implications of Cache Affinity on Processor Scheduling f.. (context) - Vaswani, Zahorjan - 1991
52   Performance Analysis of Job Scheduling Policies in Parallel .. (context) - Naik, Setia et al. - 1993
52   Robust Partitioning Policies of Multiprocessor Systems - Rosti, Smirni et al. - 1992
35   Processor-pool-based Scheduling for Large-Scale NUMA Multipr.. - Zhou, Brecht - 1991
34   the Partitioning of Multiprocessor Systems (context) - Dowdy - 1988
31   Queueing and Computer Science Applications (context) - Trivedi, Statistics et al. - 1982
28   Computer System Performance Modeling (context) - Sauer, Chandy - 1981
28   Performance Analysis of Parallel Processing Systems (context) - Nelson, Towsley et al. - 1988
20   Convex Functions (context) - Roberts, Varberg - 1973
19   A Comparative Analysis of Static Processor Partitioning Poli.. (context) - Setia, Tripathi - 1993
18   Analysis of Spatial and Temporal Scheduling Policies for Sem.. (context) - Leutenegger, Nelson - 1991
18   Making Effective Use of Shared Memory Multiprocessors: The P.. (context) - Gupta, Tucker et al. - 1991
18   Matrix Geometric Solutions in Markov Models - A Mathematical.. (context) - Nelson - 1991
15   Characterisation of Programs for Scheduling in Multiprogramm.. (context) - Majumdar, Eager et al. - 1991
14   Scheduling of Large Scientific Applications on Distributed M.. (context) - Naik, Setia et al. - 1993
14   Analysis of Fork-Join Program Response Times on Multiprocess.. (context) - Towsley, Rommel et al. - 1990
13   An Analysis of Several Processor Partitioning Policies for P.. (context) - Setia - 1991
10   The Response Time of Priority Classes under Preemptive Resum.. (context) - Buzen, Bondi - 1983
10   The Response Times of Priority Classes under Preemptive Resu.. (context) - Bondi, Buzen - 1984
10   A Performance Evaluation of a General Parallel Processing Mo.. (context) - Nelson - 1990
9   A Performance Evaluation of Several Priority Policies for Pa.. (context) - Nelson, Towsley - 1991
8   Vol II: Computer Applications (context) - Kleinrock - 1976
8   Scientific Press (context) - Brooke, Kendrick et al. - 1988
6   Response time bounds for parallel processor allocation polic.. - Agrawal, Mansharamani et al. - 1993
5   Approximate Analysis of Parallel Processor Allocation Polici.. - Mansharamani, Vernon - 1993
4   Efficient Analysis of Parallel Processor Scheduling Policies (context) - Mansharamani - 1993
4   Issues in Multiprogrammed Multiprocessor Sharing (context) - Leutenegger - 1990
3   Simulating the Scheduling of Parallel Supercomputer Applicat.. (context) - Seager, Stichnoth - 1989
2   Annals of the Institute of Statistical Mathematics (context) - Sakasegawa, formula et al. - 1977
2   Performance Analysis of the EQuipartitioning Parallel Proces.. (context) - Mansharamani, Vernon
1   an Approximation to the Mean Response Times of Priority Clas.. (context) - Tabet-Aouel, Kouvatsos - 1992

Documents on the same site (http://www.cs.wisc.edu/~arch/uwarch/tech_reports/tech_reports.html):   More
Tempest and Typhoon: User-Level Shared Memory - Reinhardt, Larus, Wood (1994)   (Correct)
Accuracy vs. Performance in Parallel Simulation of.. - Burger, Wood (1995)   (Correct)
Parallelizing Appbt for a Shared-Memory Multiprocessor - Burger (1995)   (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