Competitive clustering of stochastic communication patterns on a ring-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Competitive clustering of stochastic communication patterns on a ring

Published:2018-09-27 Issue:9 Volume:101 Page:1369-1390
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Avin Chen,Cohen Louis,Parham Mahmoud,Schmid Stefan^ORCID

Funder

German-Israeli Foundation for Scientific Research and Development

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00607-018-0666-x.pdf

Reference23 articles.

1. Adamaszek A, Czumaj A, Englert M, Räcke H (2012) An O(log k)-competitive algorithm for generalized caching. In: Proceedings of 23rd SODA, pp 1681–1689

2. Andreev K, Räcke H (2006) Balanced graph partitioning. Theory Comput Syst 39(6):929–939

3. Avin C, Cohen L, Schmid S (2017) Competitive clustering of stochastic communication patterns on the ring. In: Proceedings of 5th international conference on networked systems (NETYS)

4. Avin C, Loukas A, Pacut M, Schmid S (2016) Online balanced repartitioning. In: Proceedings of 30th international symposium on distributed computing (DISC)

5. Bartal Y, Charikar M, Indyk P (2001) On page migration and other relaxed task systems. Theor Comput Sci 268(1):43–66 Also appeared in Proc. of the 8th SODA, pages 43–52, 1997

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

2. Demand-Aware Network Design With Minimal Congestion and Route Lengths;IEEE/ACM Transactions on Networking;2022-08

3. Approximate Dynamic Balanced Graph Partitioning;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

4. Optimal Online Balanced Graph Partitioning;IEEE INFOCOM 2021 - IEEE Conference on Computer Communications;2021-05-10

5. Dynamic Balanced Graph Partitioning;SIAM Journal on Discrete Mathematics;2020-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3