Abstract
We develop a multilevel master-slave (MMS) model that is useful for large-scale master-slave problems. The MMS model implements the MS model at multiple levels and allows parallel creation of slave processes. We describe an MMS structure called the minimum-generation-time (MGT) tree. The results of our experiments show that the MMS model improves the performance of parallel computation.
This work was supported in part by the Army Research Laboratory under Grant No. DAAL-03-G-92-0377 and in part by the National Science Foundation under Grant CCR-9502345.
This is a preview of subscription content, log in via an institution to check access.
References
H.-C. Chen and V. Byreddy: Solving plate bending problems using finite strips on network workstations, Computers & Structures, to appear.
Y.K. Cheung: The finite strip method in the analysis of elastic plates with two opposite simply supported ends, Proc. Inst. Civ. Eng., 40 (1968), pp. 1–7.
F.T. Leighton: Introduction to Parallel Algorithms and Architectures: Arrays. Trees.Hypercubes, Morgan Kaufmann, CA, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, HC., Lim, A., Warsi, N.A. (1996). Multilevel master-slave parallel programming models. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027807
Download citation
DOI: https://doi.org/10.1007/BFb0027807
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62031-0
Online ISBN: 978-3-540-49626-7
eBook Packages: Springer Book Archive