2026-09-18T19:31:23Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/456332022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
John N. Tsitsiklis and Sudhendu Rai.
Nham, John (John T.)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2009-06-25T20:36:42Z
2009-06-25T20:36:42Z
2008
2008
http://hdl.handle.net/1721.1/45633
355813783
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).
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.
by John Nham.
M.Eng.
48 p.
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
Size-independent vs. size-dependent policies in scheduling heavy-tailed distributions
Size-independent versus size-dependent policies in scheduling heavy-tailed distributions
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="3614206d-0c50-496d-940d-9040e5f5140c">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Size-independent vs. size-dependent policies in scheduling heavy-tailed distributions</Title>
<Subtitle>Size-independent versus size-dependent policies in scheduling heavy-tailed distributions</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2008</PublicationDate>
<Authors>
<Author>
<DisplayName>Nham, John (John T.)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>