Summary
Parallel programming aims not only to compute as fast as possible, but also to discover new areas of algorithms different from sequential ones. We introduce a “part,” which performs the computation of a relatively independent task. A part is able to be treated as a unit of asynchronous and nondeterministic computation. Five programs are given, in order of increasing independence. They are written in extended C language and simulated on a single processor computer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carriero N, Gelernter D (1989) How to write parallel programs: a guide to the perplexed. Comput Surv 21: 323–357
Watanabe K, Tsuji T (1986) Some types of parallel algorithms. Mem Fac Eng, Fukui Univ 34: 121–138
Watanabe K, Tsuji T (1988) Part-Oriented Parallel Algorithms (in Japanese). Mem Fac Eng, Fukui Univ 36: 9–24
Almasi GS, Gottlieb A (1989) Highly parallel computing. Benjamin/Cumming, pp 236–241
Chandy KM, Misra J (1988) Parallel program design—a foundation. Addison-Wesley, pp 98–115
Yamamoto T, Furukane U, Nogura K (1977) The Durand-Kerner and the Aberth Methods for Solving Algebraic Equations (in Japanese). J Inf Process 18: 566–57
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Tokyo
About this chapter
Cite this chapter
Watanabe, K., Tsuji, T. (1991). Design and Evaluation of Part-Oriented Parallel Algorithms. In: Ohno, Y., Matsuda, T. (eds) Distributed Environments. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68144-1_9
Download citation
DOI: https://doi.org/10.1007/978-4-431-68144-1_9
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-68146-5
Online ISBN: 978-4-431-68144-1
eBook Packages: Springer Book Archive