Mor Harchol-Balter. "Task Assignment with Unknown Duration," Journal of the ACM, Vol. 49, No. 2, 260-288, March 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Characteristics of a Large Shared Memory Production Workload - Chiang, Vernon (2001) (9 citations) (Correct)
....1 2G 2 4G 4 8G 8 16G actual runtime requested requested memory 80 percentile 50 percentile 20 percentile (c) Ranges of Requested Memory (R = 50, 200, or 400 hrs) Figure 13. Actual Runtime Requested Runtime For Various Resource Request Classes (October December 2000) runtimes in [Harc00] The two stage hyperexponential distribution has been used to model the observed runtime distribution in a previous parallel workload [Feit96] As shown in Figure 12(c) the Weibull distribution provides a significantly better fit for actual runtimes on the O2K. 7 The gamma distribution (not ....
M. Harchol-Balter. "Task Assignment with Unknown Duration". Proc. Int'l. Conf. on Distributed Computing Systems, Taipei, Taiwan, April 2000.
Implementation of SRPT Scheduling in Web Servers - Mor Harchol-Balter Nikhil (2001) (3 citations) Self-citation (Harchol-balter) (Correct)
....idea of size based scheduling for heavy tailed workloads has also been explored in arenas other than Web servers. Shaikh, Rexford, and Shin [28] discuss routing of IP flows (which have heavy tailed size distributions) and propose routing long flows differently from short flows. Harchol Balter [19] considers scheduling in distributed server systems where requests are not preemptible, request sizes are unknown, and where the workload is heavy tailed. She proposes size based scheduling using an algorithm for gradually learning sizes. 3 Implementation of prioritized socket draining: ....
Mor Harchol-Balter. Task assignment with unknown duration. In Proceedings of ICDCS '00, April 2000.
Implementation of SRPT Scheduling in Web Servers - Mor Harchol-Balter Nikhil (2000) (3 citations) Self-citation (Harchol-balter) (Correct)
....idea of size based scheduling for heavy tailed workloads has also been explored in arenas other than Web servers. Shaikh, Rexford, and Shin [28] discuss routing of IP flows (which have heavy tailed size distributions) and propose routing long flows differently from short flows. Harchol Balter [17] considers scheduling in distributed server systems where requests are not preemptible, request sizes are unknown, and where the workload is heavy tailed. She proposes size based scheduling using an algorithm for gradually learning sizes. 3 Implementation of prioritized socket draining In ....
Mor Harchol-Balter. Task assignment with unknown duration. In Proceedings of ICDCS '00, April 2000.
Implementation of SRPT Scheduling in Web Servers - Harchol-Balter, Bansal.. (2000) (3 citations) Self-citation (Harchol-balter) (Correct)
....idea of size based scheduling for heavy tailed workloads has also been explored in arenas other than Web servers. Shaikh, Rexford, and Shin [28] discuss routing of IP flows (which have heavy tailed size distributions) and propose routing long flows differently from short flows. Harchol Balter [19] considers scheduling in distributed server systems where requests are not preemptible, request sizes are unknown, and where the workload is heavy tailed. She proposes size based scheduling using an algorithm for gradually learning sizes. 3 Implementation of prioritized socket draining: ....
Mor Harchol-Balter. Task assignment with unknown duration. In Proceedings of ICDCS '00, April 2000.
Evaluation of Task Assignment Policies for.. - Schroeder.. (2000) Self-citation (Harchol-balter) (Correct)
.... has a huge impact on the relative performance of scheduling policies [12, 8, 10] No paper we know of has compared the above task assignment policies on supercomputing trace data (real job service requirements) The idea of purposely unbalancing load has been suggested previously in [7] 4] and [11] under very different contexts from our paper. In [7] a distributed system with preemptible tasks is considered. It is shown that in the preemptible model, mean response time is minimized by balancing load, however mean slowdown is minimized by unbalancing load. In [4] real time scheduling is ....
....load. In [4] real time scheduling is considered where jobs have firm deadlines. In this context, the authors propose load profiling, which distributes load in such a way that the probability of satisfying the utilization requirements of incoming jobs is maximized. Our paper also differs from [11] which concentrates on the problem of task assignment with unknown service times. 11] is limited to analysis only, and restricted to the Pareto distribution only. 1.4 Paper contributions In this paper we propose to do two things: First, we will compare all of the task assignment policies listed ....
[Article contains additional citation context not shown here]
Mor Harchol-Balter. Task assignment with unknown duration. In To appear in Proceedings of ICDCS 2000.
Deferred Assignment Scheduling in Clustered Web Servers - Ungureanu (2002) (Correct)
No context found.
Mor Harchol-Balter. "Task Assignment with Unknown Duration," Journal of the ACM, Vol. 49, No. 2, 260-288, March 2002.
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