Rajesh K. Mansharamani and Mark K. Vernon. Comparison of processor allocation policies for parallel systems. Technical report, University of Wisconsin, December 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Using Queue Time Predictions for Processor Allocation - Downey (1997) (30 citations) (Correct)
....Many simulation and analytic studies have examined the performance of system centric allocation strategies; i.e. strategies designed to maximize an aggregate 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 to mean response time. In [6] we used a parallel extension of slowdown, which is the ratio of the actual response time of a job to the time it would have taken ....
Rajesh K. Mansharamani and Mark K. Vernon. Comparison of processor allocation policies for parallel systems. Technical report, University of Wisconsin, December 1993.
Approximate Analysis of Parallel Processor Allocation Policies - Mansharamani, Vernon Self-citation (Mansharamani Vernon) (Correct)
....policy insights and comparisons discussed in the next section. In concluding this section we note that another possible way to improve on the interpolation approximations 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 in this paper. 0 35 to to 26 25 16 15 to 6 5 to 5 e o f D a t a P o i n t s Interpolation on N ## Interpolation on p # Relative Errors 100 75 ....
....C 2 D . For workloads with sublinear execution rates and or correlation between D and N , one might expect the same functional dependencies on parameters of the demand distribution for each policy. This intuition is born out by extensions to the interpolation approximations for these workloads [22]. 7.1.2 Functional Dependence on Parallelism Measures of workload parallelism include N and E[1=N ] While N captures the average available parallelism of jobs, E[1=N ] captures the mean execution time of jobs (since E[1=N ] S=D) Below we discuss the insights into the impact of these ....
R. Mansharamani, and M. Vernon. Comparison of Processor Allocation Policies for Parallel Systems. In preparation.
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