A Quasi-Real-Time MapReduce Schedule Algorithm

Article Preview

Abstract:

In this paper, we extend and rewrite MapReduce dispatcher and its quasi-real-time schedule algorithm to support operation scheduling in time-limited. MapReduce dispatcher has an evaluation of completion time of tasks in dependence of rate of progress of tasks at hand, and allocated resource dynamically to every task when they are running. Experimental investigation shows that, the algorithm increase the resource utilization of the MapReduce system, and the goals of quasi-real-time MapReduce schedule has been achieved.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 694-697)

Pages:

2458-2461

Citation:

Online since:

May 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Fu Cunyan, Zeng Hui, Wang Haojie, Liu Jingshun. Analysis And Processing Method Of A Data stream Based On Wavelet. ICCDA 2010,2010:1193-1196.

DOI: 10.1109/iccda.2010.5541283

Google Scholar

[2] AbadiDJ. Integrating ComPression and Exeeutionin Colunin-Oriented Database Systems[C]. SIGMODChieagoUSA,2006:671- 682.

Google Scholar

[3] YongqiangZou,JiaLiu,Shieai Wang,LiZha,ZhiweiXu.CChidex:AComPlemental Clustering Index on Distributed Ordered Tables for Multi-dimensional Range Queries.NPC2010,LNCS 6289,2010:247-261.

Google Scholar

[4] APaeheMapRedueeArehiteeture[EB/OL].

Google Scholar

[5] Jason Baker,Chris Bond,JamesC.Corbett,JJ Furman,Andrey Kllorlin,James Larson,Jean-Miehel Leon,Yawei Li,Alexander Lloyd,and Vadim YushPrah.Megastore:Providing sealable,highly available storage for interaetive services.InProc.CIDR,2011.

Google Scholar