Unbalanced allocations
Name
681968171-MIT.pdf
Description
Full printable version
Size
2.51 MB
Format
Adobe PDF
Checksum (MD5)
082e64b15e5980d63c3e6d297c86a4e3
Author(s)
Redlich, Amanda E. (Amanda Epping)
Advisor(s)
Peter Shor.
Date Issued
2010
Publisher
Massachusetts Institute of Technology
Abstract
Recently, there has been much research on processes that are mostly random, but also have a small amount of deterministic choice; e.g., Achlioptas processes on graphs. This thesis builds on the balanced allocation algorithm first described by Azar, Broder, Karlin and Upfal. Their algorithm (and its relatives) uses randomness and some choice to distribute balls into bins in a balanced way. Here is a description of the opposite family of algorithms, with an analysis of exactly how unbalanced the distribution can become.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 65).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
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.
Persistent DSpace Link
