The Case for Tiny Tasks in Compute Clusters Kay Ousterhout∗ , Aurojit Panda∗ , Joshua Rosen∗ , Shivaram Venkataraman∗ , Reynold Xin∗ , Sylvia Ratnasamy∗ , Scott Shenker∗† , Ion Stoica∗ ∗ UC Berkeley,

First Page		Document Content
Date: 2013-04-11 15:04:47 Concurrent computing System software Parallel computing Computing Job scheduling Scheduling Cloud infrastructure Apache Hadoop Apache Software Foundation Data-intensive computing MapReduce Task		The Case for Tiny Tasks in Compute Clusters Kay Ousterhout∗ , Aurojit Panda∗ , Joshua Rosen∗ , Shivaram Venkataraman∗ , Reynold Xin∗ , Sylvia Ratnasamy∗ , Scott Shenker∗† , Ion Stoica∗ ∗ UC Berkeley, Add to Reading List Source URL: people.eecs.berkeley.edu Download Document from Source Website File Size: 249,25 KB Share Document on Facebook

	Under consideration for publication in Formal Aspects of Computing Maximally Concurrent Programs 1 DocID: 1xUtw - View Document
	Automated Verification of Concurrent Stochastic Games Marta Kwiatkowska1 , Gethin Norman2 , David Parker3 , and Gabriel Santos1 1 Department of Computing Science, University of Oxford, UK DocID: 1xTlL - View Document
	Fully Concurrent Garbage Collection of Actors on Many-Core Machines Sylvan Clebsch and Sophia Drossopoulou Department of Computing, Imperial College, London {sc5511, scd}@doc.ic.ac.uk DocID: 1tNeJ - View Document
	BritishLanthorn: Ubiquitous Homogeneous Cooperative Symmetries Ike Antkare International Institute of Technology United Slates of Earth DocID: 1ru6U - View Document
	Practical Optional Types for Clojure Ambrose Bonnaire-Sergeant† , Rowan Davies, Sam Tobin-Hochstadt† Indiana University†; Omnia Team, Commonwealth Bank of Australia {abonnair,samth}@indiana.edu, Rowan.Davies@cba. DocID: 1ru0R - View Document