General Information
    • ISSN: 1793-8201 (Print), 2972-4511 (Online)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta, Assoc. Prof. Engin Maşazade
    • Managing Editor: Ms. Mia Hu
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • Average Days from Submission to Acceptance: 192 days
    • E-mail: ijcte@iacsitp.com
    • Journal Metrics:

Editor-in-chief
Prof. Mehmet Sahinoglu
Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2009 Vol.1(5): 556-561 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2009.V1.89

A Linda-based Hierarchical Master-Worker Model

Mohammad GhasemiGol, Mostafa Sabzekar, Hossein Deldari, and Amir-Hassan Bahmani

Abstract—In this paper we will implement a new version of master-worker architecture that improves the previous ones. The common Master-Worker paradigm consists of two entities: a master and multiple workers. The master is responsible for decomposing the problem into small tasks and managing them until all tasks are completed. Therefore, the master should endures heavy load either communication or computation. This bottleneck in the master process typically occurs when the number of workers increases because the master process will not be able to keep all workers equally busy. The paper presents a novel technique for hierarchically nesting the basic master-worker scheme. This technique resolves the said problem by presenting a hierarchical scheme and reduces the communicational messages due to the usage of the Linda model. The obtained results for large matrix multiplication case study on a real cluster show the effectiveness of our model.

Index Terms—In this paper we will implement a new version of master-worker architecture that improves the previous ones. The common Master-Worker paradigm consists of two entities: a master and multiple workers. The master is responsible for decomposing the problem into small tasks and managing them until all tasks are completed. Therefore, the master should endures heavy load either communication or computation. This bottleneck in the master process typically occurs when the number of workers increases because the master process will not be able to keep all workers equally busy. The paper presents a novel technique for hierarchically nesting the basic master-worker scheme. This technique resolves the said problem by presenting a hierarchical scheme and reduces the communicational messages due to the usage of the Linda model. The obtained results for large matrix multiplication case study on a real cluster show the effectiveness of our model.

Mohammad GhasemiGol is with the Department of Computer Engineering, Ferdowsi University of Mashhad (FUM), Mashhad, Iran (phone: +98-915-9620831; fax: +98-561-4434070).
Mostafa Sabzekar is with the Department of Computer Engineering, Ferdowsi University of Mashhad (FUM), Mashhad, Iran (phone: +98-160; fax: +98-561-4447178).
Hossein Deldari is with the Department of Computer Engineering, Ferdowsi University of Mashhad (FUM), Mashhad, Iran (phone: +98-915-3101510).
Amir-Hassan Bahmani was with the Department of Computer Engineering, Islamic Azad University of Mashhad (IAUM), Mashhad, Iran (phone: +98-915-1225532).

[PDF]

Cite: Mohammad GhasemiGol, Mostafa Sabzekar, Hossein Deldari and Amir-Hassan Bahmani, "A Linda-based Hierarchical Master-Worker Model," International Journal of Computer Theory and Engineering vol. 1, no. 5, pp. 556-561, 2009.


Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.