Semantic foundations of Jade

ABSTRACT

Jade is a language designed to support coarse-grain parallelism on both shared and distributed address-space machines. Jade is data-oriented: a Jade programmer simply augments a sequential imperative program with declarations specifying how the program accesses data. A Jade implementation dynamically interprets the access specification to execute the program concurrently while enforcing the program's data dependence constraints, thus preserving the sequential semantics. This paper describes the Jade constructs and defines both a serial and a parallel formal operational semantics for Jade. The paper proves that the two semantics are equivalent.

REFERENCES

• 1: M. Berry et al. The perfect club benchmarks: Effecfive performance evaluation of supercomputers. International Journal of Supercomputer Applications, 3(3):5-40, 1989.
• 2: Nicholas Carriero , David Gelernter, How to write parallel programs: a guide to the perplexed, ACM Computing Surveys (CSUR), v.21 n.3, p.323-357, Sep. 1989 [doi>10.1145/72551.72553]
• 3: R. T. Hammel , D. K. Gifford, FX-87 PERFORMANCE MEASUREMENTS: DATAFLOW IMPLEMENTATION, Massachusetts Institute of Technology, Cambridge, MA, 1988
• 4: C. A. R. Hoare, Communicating sequential processes, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
• 5: Inmos Corp, Occam Programming Manual, Prentice Hall Trade, 1984
• 6: Monica S. Lam , Martin C. Rinard, Coarse-grain parallel programming in Jade, Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, p.94-105, April 21-24, 1991, Williamsburg, Virginia, United States
• 7: Daniel Lenoski , James Laudon , Kourosh Gharachorloo , Anoop Gupta , John Hennessy, The directory-based cache coherence protocol for the DASH multiprocessor, Proceedings of the 17th annual international symposium on Computer Architecture, p.148-159, May 28-31, 1990, Seattle, Washington, United States
• 8: J. M. Lucassen. Types and Effects: Towards the ~integrafion of Functional and Imperative Programming. Technical Report MIT/LCSflR-408, MIT, August 1987.
• 9: United States Department of Defense. Reference Manual for the Ada programming language. DoD, Washington, D.C., January 1983. ANSI/~IL-STD- 1815A,
• 10: Jonathan Rose, LocusRoute: a parallel global router for standard cells, Proceedings of the 25th ACM/IEEE conference on Design automation, p.189-195, June 12-15, 1988, Atlantic City, New Jersey, United States
• 11: Edward Rothberg , Anoop Gupta, Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy, ACM Transactions on Mathematical Software (TOMS), v.17 n.3, p.313-334, Sept. 1991 [doi>10.1145/114697.116809]
• 12: Yasuhiko Yokote , Mario Tokoro, Concurrent programming in concurrent Smalltalk, Object-oriented concurrent programming, MIT Press, Cambridge, MA, 1987

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications
          Subjects: Concurrent, distributed, and parallel languages

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
      D.1.3 Concurrent Programming
          Subjects: Parallel programming
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.2 Semantics of Programming Languages
          Subjects: Operational semantics

General Terms:
Languages