M-Structures: Extending a Parallel, Non-strict, Functional Language with State

M-Structures: Extending a Parallel, Non-strict, Functional Language with State (1991)

Cached

Download Links

[www.lcs.mit.edu]

Other Repositories/Bibliography

DBLP

by Paul S. Barth , Paul S. Barth , Arvind , Rishiyur S. Nikhil , Rishiyur S. Nikhil

Citations:

85 - 6 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	M-Structures: Extending a Parallel, Non-strict, Functional Language with State	user correction - Legacy Corrections
AUTHOR NAME	Paul S. Barth	user correction - Legacy Corrections
AUTHOR AFFIL	Massachusetts Institute of Technology; Laboratory for Computer Science; 545 Technology Square, Cambridge	user correction - Legacy Corrections
AUTHOR ADDR	MA 02139, USA	user correction - Legacy Corrections
AUTHOR NAME	Paul S. Barth	user correction - Legacy Corrections
AUTHOR AFFIL	Massachusetts Institute of Technology; Laboratory for Computer Science; 545 Technology Square, Cambridge	user correction - Legacy Corrections
AUTHOR ADDR	MA 02139, USA	user correction - Legacy Corrections
AUTHOR NAME	Arvind	user correction - Legacy Corrections
AUTHOR NAME	Rishiyur S. Nikhil	user correction - Legacy Corrections
AUTHOR AFFIL	Massachusetts Institute of Technology; Laboratory for Computer Science; 545 Technology Square, Cambridge	user correction - Legacy Corrections
AUTHOR ADDR	MA 02139, USA	user correction - Legacy Corrections
AUTHOR NAME	Rishiyur S. Nikhil	user correction - Legacy Corrections
AUTHOR AFFIL	Massachusetts Institute of Technology; Laboratory for Computer Science; 545 Technology Square, Cambridge	user correction - Legacy Corrections
AUTHOR ADDR	MA 02139, USA	user correction - Legacy Corrections
ABSTRACT	Functional programs are widely appreciated for being "declarative" (algorithms are not over-specified) and implicitly parallel. However, when modeling state, both properties are compromised because the state variables must be "threaded" through most functions. Further, state "updates " may require much copying. A solution is to introduce assignments, as in ML and Scheme; however, for meaningful semantics, they resort to strict, sequential evaluation. We present an alternative approach called M-structures, which are imperative data structures with implicit synchronization. M-structures are added to Id, a parallel non-strict functional language. We argue that some programs with M-structures improve on their functional counterparts in three ways: they are (1) more declarative; (2) more parallel; and (3) more storage efficient. Points (1) and (2) contradict conventional wisdom. We study two problems: histogramming a tree, and graph traversal, comparing functional and M-structure solutions....	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	23 found	ParsCit 1.0