Towards polytypic parallel programming

Towards polytypic parallel programming (1998)

Cached

Download Links

by Zhenjiang Hu , Masato Takeichi , Hideya Iwasaki

Citations:

2 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	Towards polytypic parallel programming	INFERENCE
AUTHOR NAME	Zhenjiang Hu	user correction
AUTHOR NAME	Masato Takeichi Hideyaiwasaki	user correction
AUTHOR NAME	Hideya Iwasaki	user correction
ABSTRACT	Data parallelism is currently one of the most successful models for programming massively parallel computers. The central idea is to evaluate a uniform collection of data in parallel by simultaneously manipulating each data element in the collection. Despite many of its promising features, the current approach suffers from two problems. First, the main parallel data structures that most data parallel languages currently support are restricted to simple collection data types like lists, arrays or similar structures. But other useful data structures like trees have not been well addressed. Second, parallel programming relies on a set of parallel primitives that capture parallel skeletons of interest. However, these primitives are not well structured, and efficient parallel programming with these primitives is difficult. In this paper, we propose a polytypic framework for developing efficient parallel programs on most data structures. We showhow a set of polytypic parallel primitives can be formally defined for manipulating most data structures, how these primitives can be successfully structured into a uniform recursive definition, and how an efficient combination of primitives can be derived from a naive specification program. Our framework should be significant not only in development of new parallel algorithms, but also in construction of parallelizing compilers.	SVM HeaderParse 0.1
YEAR	1998	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report METR 98-09	INFERENCE
CITATIONS	57 found	ParsCit 1.0