Abstract
Is the owner-computes style of parallelism, captured in a variety of data parallel languages, attractive as a paradigm for designing explicit control parallel codes? This question gives rise to a number of others. Will such use be unwieldy? Will the resulting code run well? What can such an approach offer beyond merely replicating, in a more labor intensive way, the services and coverage of data parallel languages? We investigate these questions via a simple example and “real world” case studies developed using C-Linda, a language for explicit parallel programming formed by the merger of C with the Linda coordination language. The results demonstrate owner-computes is an effective design strategy in Linda.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Bjornson, N. Carriero, D. Gelernter, T. Mattson, and A. Sherman, Experience with Linda: Notes from the bandwagon, Research Report, Yale University Department of Computer Science (August 1991).
Nicholas Carriero and David Gelernter, How to write parallel programs: a guide to the perplexed,ACM Computing Surveys, 21(3), 00–00 (September 1989). Extended version published by MIT Press (Fall 1990).
John R. Rose and Guy L. Steele, Jr. C*: An extended C language for data parallel programming, Technical Report Series PL87-5, Thinking Machines Corporation, Cambridge, Massachusetts (March 1987).
S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C. Tseng, An overview of the Fortran D programming system. Technical Report TR91-154, Rice University Department of Computer Science (March 1991).
Philip J. Hatcher, Anthony J. Lapadula, Robert R. Jones, Michael J. Quinn, and Ray J. Anderson, A production quality C* compiler for hypercube multicomputers,Proc. of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 73–82 (1991).
Thinking Machines Corporation, Cambridge, Massachusetts,Programming in C * (1990).
N. Carriero and D. Gelernter, A foundation for advanced compile-time analysis of Linda program, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (eds.),Languages and Compilers for Parallel Computing. MIT Press, Cambridge (1991).
Leigh D. Cagan, Nicholas J. Carriero, and Stavros A. Zenios, Pricing mortgage-backed securities with network Linda. Technical Report 516F, Scientific Computing Associates, Inc., New Haven, Connecticut (January 1992).
J. M. Hutchinson and Stavros A. Zenios, Financial simulations on a massively parallel connection Machine,Inte'l. J. of Supercomputer Applications 5(2):27–45 (1991).
P. L. Miller, P. Nadkarni, J. Gelernter, N. Carriero, A. Pakstis, and K.K. Kidd, Parallelizing genetic linkage analysis: A case study for applying parallel computation in molecular biology,Computers and Biomedical Research, pp. 234–248 (1991).
Shakil Ahmed and David Gelernter, A CASE environment for parallel programming,Proc. Fifth International Workshop on Computer-Aided Software Engineering (July 1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carriero, N., Gelernter, D. Case studies in asynchronous data parallelism. Int J Parallel Prog 22, 129–149 (1994). https://doi.org/10.1007/BF02577872
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02577872