Skip to main content
SpringerLink
Log in

Sauge: How to use the parallelism of sequential programs

  • Systematic Design, Development, And Verification Of Parallel Algorithms
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 111))

Included in the following conference series:

  • 119 Accesses

Abstract

Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining.

A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. TESLER L.G. and ENEA H.J.: A LANGUAGE DESIGN FOR CONCURRENT PROCESSES Proceedings SJCC, 1968

    Google Scholar 

  2. DIJKSTRA E.W.: GUARDED COMMANDS, NON-DETERMINACY AND A CALCULUS FOR THE DERIVATION OF PROGRAMS. Comm. of the A.C.M., Vol. 18, Aug. 1975

    Google Scholar 

  3. SYRE J.C. and al.: TECHNIQUES ET EXPLOITATION DE L'ASSIGNATION UNIQUE Contrat Sesori 74–167, Vol. 9, Final report. Oct. 1976

    Google Scholar 

  4. ARVIND, GOSTELOW P. and PLOUFFE W.: AN ASYNCHRONOUS PROGRAMMING LANGUAGE AND COMPUTING MACHINE University of California, Irvine, Dec. 1978

    Google Scholar 

  5. DENNIS J.B., MISUNAS D.P. and LEUNG C.K.: A HIGHLY PARALLEL PROCESSOR USING A DATAFLOW MACHINE LANGUAGE Computation structures group. Memo 134, Jan. 1977

    Google Scholar 

  6. ASCHROFT E.A. and WADGE W.W.: LUCID, A NONPROCEDURAL LANGUAGE WITH ITERATION Comm. of the A.C.M., Vol. 20, July 1977

    Google Scholar 

  7. LECOUFFE P.: SAUGE: SYSTEME A ASSIGNATION UNIQUE GARDEE EXTENSIF Proceedings A.F.C.E.T. Congress, Nancy, Nov. 1980

    Google Scholar 

  8. LECOUFFE P.: SAUGE: SYSTEME A ASSIGNATION UNIQUE GARDEE EXTENSIF Publication du Laboratoire de Recherche en Architecture des Systèmes et Machines Informatiques. Université de LILLE, no 6, Sept. 1979

    Google Scholar 

  9. PLEMENOS D.: QUELQUES PROBLEMES DE COMPILATION D'UN LANGAGE CLASSIQUE VERS UN LANGAGE MACHINE PARALLELLE Publication du Laboratoire de Recherche en Architecture des Systèmes et Machines Informatiques. Université de LILLE, No 10, Janv. 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département Informatique I.U.T. "A" de Lille-I, B.P. 179, 59653, Villeneuve D’ascq Cédex, France

    P. Lecouffe

Authors
  1. P. Lecouffe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lecouffe, P. (1981). Sauge: How to use the parallelism of sequential programs. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105121

Download citation

  • DOI: https://doi.org/10.1007/BFb0105121

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation