skip to main content
article
Free access

Applications experience with Linda

Published: 01 January 1988 Publication History

Abstract

We describe three experiments using C-Linda to write parallel codes. The first involves assessing the similarity of DNA sequences. The results demonstrate Linda's flexibility—Linda solutions are presented that work well at two quite different levels of granularity. The second uses a prime finder to illustrate a class of algorithms that do not (easily) submit to automatic parallelizers, but can be parallelized in straight-forward fashion using C-Linda. The final experiment describes the process lattice model, an “inherently” parallel application that is naturally conceived as multiple interacting processes. Taken together, the experience described here bolsters our claim that Linda can bridge the gap between the growing collection of parallel hardware and users eager to exploit parallelism.
This work is supported by the NSF under grants DCR-8601920 and DCR-8657615 and by the ONR under grant N00014-86-K-0310. We are grateful to Argonne National Labs for providing access to a Sequent Symmetry.

References

[1]
S. Ahuja, N. Carriero and D. Gelernter, "Linda and Friends," IEEE Computer, August 1986.
[2]
S. Ahuja, N. Carriero, D. Gelernter, and V. Krishnaswamy, "Matching Language and Hardware for Parallel Computation in the Linda Machine," IEEE Trans. on Computers, August 1988.
[3]
R. Bjornson, N. Carriero, D. Gelernter, and J. Leichter, "Linda, the Portable Parallel," Research Report YALE/DCS/RR-520, Yale University, January 1988.
[4]
N. Carriero, Implementing tuple space machines. Doctoral Diss., Yale University, 1987.
[5]
N. Carriero and D. Gelernter, "The S/Net's Linda Kernel," in Proc. A CM. Syrup. Operating System Principles, December 1985 and (ACM Trans. Comp. Sys. May 1986.
[6]
N. Carriero and D. Gelernter, "How to Write Parallel Programs: A Guide to The Perplexed," Research Report, Yale University, May 1988.
[7]
N. Carriero, D. Gelernter and J. Leichter, "Distributed data structures in Linda," in Proc. A CM Syrup. Principles of Prog. Languages, January 1986.
[8]
J. Dongarra, "Performance of Various Computers Using Standard Linear Equations in a FORTRAN Environment," Technical Memorandum, Argonne National Laboratory, 1987.
[9]
D. Gelernter, "Generative communication in Linda," A CM Trans. Prog. Lang. Sys. 1(1985):80-112.
[10]
D. Gelernter and A. Bernstein, "Distributed communication via global buffer," in Proc. A CM Syrup. Principles of Distributed Computing, (Aug. 1982):10-18.
[11]
O. Gotoh, "An improved algorithm for matching biological sequences," ft. Mol. Biol. 162(1982) :705- 708.
[12]
D. ttillis, The Connection Machine. MIT Press (1985).
[13]
H.F. Jordan, "Structuring parallel algorithms in an MIMD, shared memory environment," Parallel Computing 3(1986):93-110.
[14]
M.D. May, "Occam." ACM SIG- PLAN Notices, 18-4( 1983):69-79.
[15]
R. Nikhil, K. Pingali and Arvind, "ID Nouveau," Technical Report 265 (MIT) 1986.
[16]
IEEE Software: Special issue on parallel programming, S.S. Thakkar, ed., January 1988.
[17]
R. Whiteside and J. Leichter, "Using Linda for Supercomputing On a Local Area Network." Supecomputing '88, (to appear).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 23, Issue 9
Proceedings of the ACM/SIGPLAN PPEALS 1988
Sept. 1988
246 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/62116
Issue’s Table of Contents
  • cover image ACM Conferences
    PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
    January 1988
    246 pages
    ISBN:0897912764
    DOI:10.1145/62115
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988
Published in SIGPLAN Volume 23, Issue 9

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)66
  • Downloads (Last 6 weeks)12
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media