Coarse-Grain Parallel Programming in Jade

Coarse-Grain Parallel Programming in Jade (1991)

by Monica S. Lam , Martin C. Rinard

Citations:

46 - 4 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Coarse-Grain Parallel Programming in Jade	user correction - Legacy Corrections
AUTHOR NAME	Monica S. Lam	user correction - Legacy Corrections
AUTHOR NAME	Martin C. Rinard	user correction - Legacy Corrections
ABSTRACT	This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time system use this information to concurrently execute the program while respecting the program's data dependence constraints. Using Jade can significantly reduce the time and effort required to develop and maintain a parallel version of an imperative application with serial semantics. The paper introduces the basic principles of the language, compares Jade with other existing languages, and presents the performance of a sparse matrix Cholesky factorization algorithm implemented in Jade.	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	6 found	ParsCit 1.0