The peering problem in tree-based master/worker overlays

研究成果: Conference contribution

摘要

Master-worker applications often demand high throughput. A master-worker application consists of master and worker processes. The master processes generate tasks, while the worker processes compute the tasks. A peer can solely implement the master process, the worker process, or both. A scalable implementation of master-worker applications is to form an overlay network in which masters deliver their tasks to workers through their interconnect links, and workers either compute received tasks or forward some of the tasks to other workers. Different overlay construction could result in various system throughputs. In this work, we study the fundamental issue. That is, how the overlay is structured to maximize the system throughput. We first propose a basic, simple overlay formation algorithm to form an overlay. Then, we develop a number of peering strategies. The simple overlay formation algorithm is flexible to integrate these peering strategies, generating types of the overlay. Our performance studies show that the overlays based on the exploitation of network locality can perform better.

原文English
主出版物標題Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings
發行者Springer Verlag
頁面83-92
頁數10
ISBN(列印)3540338098, 9783540338093
DOIs
出版狀態Published - 2006 一月 1
事件1st International Conference on Grid and Pervasive Computing,GPC 2006 - Taichung, Taiwan
持續時間: 2006 五月 32006 五月 5

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3947 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Other

Other1st International Conference on Grid and Pervasive Computing,GPC 2006
國家Taiwan
城市Taichung
期間06-05-0306-05-05

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

指紋 深入研究「The peering problem in tree-based master/worker overlays」主題。共同形成了獨特的指紋。

  • 引用此

    Hsiao, H-C., & Liao, H. (2006). The peering problem in tree-based master/worker overlays. 於 Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings (頁 83-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 3947 LNCS). Springer Verlag. https://doi.org/10.1007/11745693_9