Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Size-independent vs. size-dependent policies in scheduling heavy-tailed distributions

Size-independent vs. size-dependent policies in scheduling heavy-tailed distributions

Thumbnail Image
Download
Name

355813783-MIT.pdf

Description
Full printable version
Size

201.76 KB

Format

Adobe PDF

Checksum (MD5)

c0dadecae3d429d593d0e821c9f86573

Author(s)
Nham, John (John T.)
Advisor(s)
John N. Tsitsiklis and Sudhendu Rai.
Alternative Title
Size-independent versus size-dependent policies in scheduling heavy-tailed distributions
Date Issued
2008
Publisher
Massachusetts Institute of Technology
Abstract
We study the problem of scheduling jobs on a two-machine distributed server, where the job size distribution is heavy-tailed. We focus on two distributions, for which we prove that the performance of the optimal size-independent policy is asymptotically worse than that of a simple size-dependent policy. First, we consider a simple distribution where incoming jobs can only be of two possible sizes. The motivation is that with two largely different sizes, the simple distribution captures the important aspects of a heavy tail. Second, we extend to a bounded Pareto distribution, which has an actual heavy tail. For both cases, we analyze the performance with regards to slowdown (waiting time divided by job size) for several size-independent and size-dependent policies. We see that the size-dependent policies perform better, and then go on to prove that even the best size-independent policy cannot achieve the same performance. We conclude that as we increase the variance of our job size distribution, the gap between size-independent and size-dependent policies grows.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 47-48).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/45633
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.