综合论文：JobSchedulingforMultiUserMapReduceClusters（英文）.pdfVIP

Job Scheduling for Multi-User MapReduce Clusters Matei Zaharia Dhruba Borthakur Joydeep Sen Sarma Khaled Elmeleegy Scott Shenker Ion Stoica Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2009-55 /Pubs/TechRpts/2009/EECS-2009-55.html April 30, 2009 Copyright 2009, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Acknowledgement We would like to thank the Hadoop teams at Yahoo! and Facebook for the discussions based on practical experience that guided this work. We are also grateful to Joe Hellerstein and Hans Zeller for their pointers to related work in database systems. This research was supported by California MICRO, California Discovery, the Natural Sciences and Engineering Research Council of Canada, as well as the following Berkeley Reliable Adaptive Distributed systems lab sponsors: Sun Microsystems, Google, Microsoft, HP, Cisco, Facebook and Amazon. Job Scheduling for Multi-User MapReduce Clusters Matei Zaharia† Dhruba Borthakur‡ Joydeep Sen Sarma‡ Khaled Elmeleegy∗ Scott Shenker† Ion Stoica† †University of California, Berkeley ‡Facebook I