你好,游客 登录 注册 发布搜索
背景:
阅读新闻

[期刊]Lessons from the Congested Clique Applied to MapReduce

[日期:2014-05-25] 来源:arxiv.org  作者: [字体: ]

Lessons from the Congested Clique Applied to MapReduce

James W. Hegeman Sriram V. Pemmaraju

The main results of this paper are (I) a simulation algorithm which, under quite general constraints, transforms algorithms running on the Congested Clique into algorithms running in the MapReduce model, and (II) a distributed O(Δ)-coloring algorithm running on the Congested Clique which has an expected running time of (i) O(1) rounds, if Δ≥Θ(log4n); and (ii) O(loglogn) rounds otherwise. Applying the simulation theorem to the Congested-Clique O(Δ)-coloring algorithm yields an O(1)-round O(Δ)-coloring algorithm in the MapReduce model.


Lessons from the Congested Clique Applied to MapReduce

收藏 推荐 打印 | 录入:574107552 | 阅读:
相关新闻       MapReduce 
本文评论   查看全部评论 (0)
表情: 表情 姓名: 字数
点评:
       
评论声明
  • 尊重网上道德,遵守中华人民共和国的各项有关法律法规
  • 承担一切因您的行为而直接或间接导致的民事或刑事法律责任
  • 本站管理人员有权保留或删除其管辖留言中的任意内容
  • 本站有权在网站内转载或引用您的评论
  • 参与本评论即表明您已经阅读并接受上述条款