| | |
Summary: Type Systems for Distributed Data Structures
Ben Liblit
liblit@cs.berkeley.edu
Alexander Aiken
aiken@cs.berkeley.edu
Department of Electrical Engineering and Computer Science
University of California, Berkeley
Berkeley, CA 94720-1776
Abstract
Distributed-memory programs are often written using a
global address space: any process can name any memory
location on any processor. Some languages completely hide
the distinction between local and remote memory, simpli-
fying the programming model at some performance cost.
Other languages give the programmer more explicit control,
o ering better potential performance but sacri cing both
soundness and ease of use.
Through a series of progressively richer type systems,
we formalize the complex issues surrounding sound compu-
tation with explicitly distributed data structures. We then
|
