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

	SparkTrails: A MapReduce Implementation of HypTrails for Comparing Hypotheses About Human Trails Martin Becker Hauke Mewes DocID: 1xUtT - View Document
	Scaling Up with MapReduce, Hadoop, and Amazon Term Frequency Kenneth Lay DocID: 1vprX - View Document
	MapReduce による大規模分散システムのシミュレーション杉野好宏† 華井 DocID: 1uWY0 - View Document
	Densest Subgraph in Streaming and MapReduce Bahman Bahmani Ravi Kumar Sergei Vassilvitskii DocID: 1uBLZ - View Document
	1/7/16 More Go, Lab 1 Hints, and MapReduce Tom Anderson DocID: 1utqA - View Document