Towards a theory of parallel algorithms on concrete data structures

Towards a theory of parallel algorithms on concrete data structures (1990)

Cached

Download Links

[www.cs.cmu.edu]
[reports.adm.cs.cmu.edu]

Other Repositories/Bibliography

DBLP

by Stephen Brookes , Shai Geva

Venue:	In Semantics for Concurrency, Leicester
Citations:	11 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Towards a theory of parallel algorithms on concrete data structures	INFERENCE
AUTHOR NAME	Stephen Brookes	SVM HeaderParse 0.2
AUTHOR AFFIL	Carnegie Mellon University; School of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, PA 15213	SVM HeaderParse 0.2
AUTHOR NAME	Shai Geva	SVM HeaderParse 0.2
AUTHOR AFFIL	Carnegie Mellon University; School of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, PA 15213	SVM HeaderParse 0.2
ABSTRACT	The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of DARPA or the U.S. government. Building on Kahn and Plotkin’s theory of concrete data structures and sequential functions, Berry and Curien defined an intensional model of sequential algorithms between concrete data structures. In this paper we report on an attempt to develop a similar intensional model of concurrent computation. We present a notion of parallel algorithm between concrete data structures, together with suitable application and currying operations. We define an intensional strictness ordering on parallel algorithms, with respect to which application is well behaved (at first order types). We define the input-output function computed by a parallel algorithm, and we show that every parallel algorithm computes a continuous function. Thus, a parallel algorithm may be viewed as a continuous function together with a parallel computation strategy. In contrast, a Berry-	SVM HeaderParse 0.2
YEAR	1990	INFERENCE
VENUE	In Semantics for Concurrency, Leicester	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	116--136	INFERENCE
TECH	Technical report CS-91-157	INFERENCE
CITATIONS	15 found	ParsCit 1.0