Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Eager, Derek L. (VerfasserIn), Zahorjan, John (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Seattle, Wash. 1991
Schriftenreihe:	University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 91,8,5
Schlagworte:	Multiprocessors Parallel programming (Computer science)
Zusammenfassung:	Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the clusters of a large-scale non-uniform memory access machine We argue that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism. These benefits are achieved within a single, simple conceptual model that almost entirely relieves the programmer and compiler from concerns of granularity, scheduling, and enforcement of synchronization constraints. Performance measurements are presented for an implementation of chores on a Sequent Symmetry multiprocessor.
Beschreibung:	27 S.