Hierarchical Concurrency in Jade

Jade is a data-oriented language for exploiting coarse-grain parallelism. A Jade programmer simply augments a serial program with assertions specifying how the program accesses data. The Jade implementation dynamically interprets these assertions, using them to execute the program concurrently while enforcing the program's data dependence constraints. Jade has been implemented as extensions to C, FORTRAN, and C++, and currently runs on the Encore Multimax, Silicon Graphics IRIS 4D/240S, and the Stanford DASH multiprocessors. In this paper, we show how Jade programmers can naturally express hierarchical concurrency patterns by specifying how a program uses hierarchically structured data. 1 Introduction Jade is a data-oriented language for expressing coarse-grain concurrency. Instead of using explicit control constructs to express the concurrency available in a program, a Jade programmer augments a serial program with Jade constructs that declare how the various sections of the program ..