skip to main content
10.1145/322609.323134acmconferencesArticle/Chapter ViewAbstractPublication PagescscConference Proceedingsconference-collections
Article
Free Access

An inherently parlle large grained data flow environment

Authors Info & Claims
Published:01 February 1988Publication History

ABSTRACT

A parallel programming environment based on data flow is described. Programming in the environment involves use with an interactive graphic editor which facilitates the construction of a program graph consisting of modules, ports, paths and triggers. Parallelism is inherent since data presence allows many modules to execute concurrently. The graph is executed directly without transformation to traditional representations. The environment supports programming at a very high level as opposed to parallelism at the individual instruction level.

References

  1. 1.Babb II, R.G., Ragsdale, W.C. "A Large-Grain Data Flow Scheduler for Parallel processing on CYBERPLUS". Proceedinqs o__f the 1986 International Conference on Parallel Processinq, Aug. 1986, pp. 845-848.Google ScholarGoogle Scholar
  2. 2.Gelernter, D. Guest Editor's Introduction: "Domesticating Parallelism". Computer, Vol. 19, No. 8, Aug. 1986, pp. 12-16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Hillis, D.W., Steele, G.L. Jr. "Data Parallel Algorithms". Communications of the ACM, Vol. 29, No. 12, Dec. 1986, pp. 1170-1183. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Hoare, C.A.R. "Communicating Sequential Processes". Communications of the ACM, Vol. 21, No. 8, Aug. 1978, pp. 666-677. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Mundle, D.A., Eisher, D.A. "Parallel Processing in Ada". Computer, Vol. 19, No. 8, Aug. 1986, pp. 20-25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Rettberg, R., Thomas, R. "Contention Is No Obstacle To Shared Memory Multiprocessing". Communications of the ACM, Vol. 29, No. 12, Dec. 1986, pp. 1202-1212. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Ryder, B.G., Paull, M.C. "Elimination Algorithms for Data Flow Analysis". ACM Computing Surveys, Vol. 18, No. 3, Sept. 1986, pp. 277-316. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Standley, H.M. "A Very High Level Language For Large-Grained Data Flow". Fifteenth Annual Computer Science Conference, Feb. 1987, pp. 191-195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Stanfill, C., Kahle, Brewster. "Parallel Free-Text Search On The Connection System". Communications of the ACM, Vol. 29, No. 12, Dec. 1986, pp. 1229-1239. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Stevens, W.P. "How Data Flow Can Improve Application Development Productivity". IBM Systems Journal, Vol. 21, No. 2, Feb. 1982, pp. 162- 178.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An inherently parlle large grained data flow environment

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              CSC '88: Proceedings of the 1988 ACM sixteenth annual conference on Computer science
              February 1988
              770 pages
              ISBN:0897912608
              DOI:10.1145/322609

              Copyright © 1988 ACM

              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: 1 February 1988

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article
            • Article Metrics

              • Downloads (Last 12 months)4
              • Downloads (Last 6 weeks)1

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader