The Peering Problem in Tree-Based Master/Worker Overlays

  • Hung-Chang Hsiao
  • Hao Liao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3947)


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.


Schedule Algorithm Child Node Work Process System Throughput Overlay Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
    Verma, D.C.: Content Distribution Networks, An Engineering Approach. Wiley, Chichester (2002)CrossRefGoogle Scholar
  4. 4.
    Knutsson, B., Lu, H., Xu, W., Hopkins, B.: Peer-to-Peer Support for Massively Multiplayer Games. In: Proceedings of IEEE INFOCOM (2004)Google Scholar
  5. 5.
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Hsiao, H.C., Liao, H.: The Peering Problem in Tree-basedMaster/Worker Overlays. Technical report, National Cheng-Kung University, Taiwan (2005)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks. ACM/IEEE Transactions on Networking 12, 219–232 (2004)CrossRefGoogle Scholar
  11. 11.
    Ng, T., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: Proceedings of IEEE INFOCOM, pp. 170–179 (2002)Google Scholar
  12. 12.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hung-Chang Hsiao
    • 1
  • Hao Liao
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Cheng Kung UniversityTainanTaiwan

Personalised recommendations