Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 3947))
Included in the following conference series:
542Accesses
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.
This is a preview of subscription content,log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
(Napster),http://www.napster.com/
(Gnutella),http://rfc-gnutella.sourceforge.net/
Verma, D.C.: Content Distribution Networks, An Engineering Approach. Wiley, Chichester (2002)
Knutsson, B., Lu, H., Xu, W., Hopkins, B.: Peer-to-Peer Support for Massively Multiplayer Games. In: Proceedings of IEEE INFOCOM (2004)
(SETI@home),http://setiathome.ssl.berkeley.edu/
Kreaseck, B., Carter, L., Casanova, H., Ferrante, J.: Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-task Applications. In: Proceedings of the International Parallel and Distributed Processing Symposium, pp. 26–35. IEEE Computer Society, Los Alamitos (2003)
Shao, G., Berman, F., Wolski, R.: Master/Slave Computing on the Grid. In: Proceedings of the Heterogeneous Computing Workshop, pp. 3–16. IEEE Computer Society, Los Alamitos (2000)
Hsiao, H.C., Liao, H.: The Peering Problem in Tree-basedMaster/Worker Overlays. Technical report, National Cheng-Kung University, Taiwan (2005)
Banino, C., Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Robert, Y.: Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms. IEEE Transactions on Parallel and Distributed Systems 15, 319–330 (2004)
Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks. ACM/IEEE Transactions on Networking 12, 219–232 (2004)
Ng, T., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: Proceedings of IEEE INFOCOM, pp. 170–179 (2002)
(SPEC),http://www.spec.org/
Author information
Authors and Affiliations
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, 701, Taiwan
Hung-Chang Hsiao & Hao Liao
- Hung-Chang Hsiao
You can also search for this author inPubMed Google Scholar
- Hao Liao
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
Department of Computer Science, National Tsing Hua University, 30013, Hsinchu, Taiwan
Yeh-Ching Chung
IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA
José E. Moreira
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsiao, HC., Liao, H. (2006). The Peering Problem in Tree-Based Master/Worker Overlays. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_9
Download citation
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-540-33809-3
Online ISBN:978-3-540-33810-9
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative