The peering problem in tree-based master/worker overlays

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings
PublisherSpringer Verlag
Pages83-92
Number of pages10
ISBN (Print)3540338098, 9783540338093
DOIs
Publication statusPublished - 2006 Jan 1
Event1st International Conference on Grid and Pervasive Computing,GPC 2006 - Taichung, Taiwan
Duration: 2006 May 32006 May 5

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3947 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Grid and Pervasive Computing,GPC 2006
CountryTaiwan
CityTaichung
Period06-05-0306-05-05

Fingerprint

Overlay
Throughput
Overlay networks
Overlay Networks
Interconnect
Locality
Exploitation
High Throughput
Maximise
Integrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hsiao, H-C., & Liao, H. (2006). The peering problem in tree-based master/worker overlays. In Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings (pp. 83-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3947 LNCS). Springer Verlag. https://doi.org/10.1007/11745693_9
Hsiao, Hung-Chang ; Liao, Hao. / The peering problem in tree-based master/worker overlays. Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings. Springer Verlag, 2006. pp. 83-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b63fb52a4e034fd584c1536c2cd30c49,
title = "The peering problem in tree-based master/worker overlays",
abstract = "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.",
author = "Hung-Chang Hsiao and Hao Liao",
year = "2006",
month = "1",
day = "1",
doi = "10.1007/11745693_9",
language = "English",
isbn = "3540338098",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "83--92",
booktitle = "Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings",
address = "Germany",

}

Hsiao, H-C & Liao, H 2006, The peering problem in tree-based master/worker overlays. in Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3947 LNCS, Springer Verlag, pp. 83-92, 1st International Conference on Grid and Pervasive Computing,GPC 2006, Taichung, Taiwan, 06-05-03. https://doi.org/10.1007/11745693_9

The peering problem in tree-based master/worker overlays. / Hsiao, Hung-Chang; Liao, Hao.

Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings. Springer Verlag, 2006. p. 83-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3947 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - The peering problem in tree-based master/worker overlays

AU - Hsiao, Hung-Chang

AU - Liao, Hao

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745819920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745819920&partnerID=8YFLogxK

U2 - 10.1007/11745693_9

DO - 10.1007/11745693_9

M3 - Conference contribution

SN - 3540338098

SN - 9783540338093

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 83

EP - 92

BT - Advances in Grid and Pervasive Computing - First International Conference, GPC 2006, Proceedings

PB - Springer Verlag

ER -

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