跳到主要导航 跳到搜索 跳到主要内容

Scheduling performance of real-time tasks on MapReduce cluster

  • Fei Teng*
  • , Lei Yu
  • , Frédéric Magoulès
  • *此作品的通讯作者
  • Ecole Centrale Paris-Supelec

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

This paper addresses the scheduling problem of real-time tasks on MapReduce cluster. Since MapReduce consists of two sequential stages, segmentation execution enables cluster scheduling to be more flexible. In this paper, we analyze how the segmentation between Map and Reduce influences cluster utilization. We find out the worst pattern for schedulable task set, based on which the upper bound of cluster utilization is deduced. This bound function, as a general expression of the classic Liu's result, can be used for on-line schedulability test in time complexity O(1). Theoretical results show proper segmentation between Map and Reduce is beneficial to MapReduce cluster with a higher utilization bound.

源语言英语
主期刊名Proceedings of the International Conference on Human-Centric Computing 2011 and Embedded and Multimedia Computing 2011, HumanCom and EMC 2011
页365-374
页数10
DOI
出版状态已出版 - 2011
活动4th International Conference on Human-Centric Computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia Computing, EMC'11 - Enshi, 中国
期限: 11 8月 2011 → 13 8月 2011

出版系列

姓名Lecture Notes in Electrical Engineering
卷102 LNEE
ISSN(印刷版)1876-1100
ISSN(电子版)1876-1119

会议

会议4th International Conference on Human-Centric Computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia Computing, EMC'11
国家/地区中国
市Enshi
时期11/08/11 → 13/08/11

学术指纹

探究 'Scheduling performance of real-time tasks on MapReduce cluster' 的科研主题。它们共同构成独一无二的学术指纹。

引用此