In the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as caches and virtual memory. In the context of multiprocessors, we believe that it is equally important to exploit spatial locality of reference. We are developing a system which, given a sequential program and its domain decomposition, performs process decomposition so as to enhance spatial locality of reference. We describe an application of this method - generating code from shared-memory programs for the (distributed memory) Intel iPSC/2
It is often assumed that computational load balance cannot be achieved in parallel and distributed s...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1993. Simultaneously published...
We articulate the need for managing (data) locality automatically rather than leaving it to the prog...
In machines like the Intel iPSC/2 and the BBN Butterfly, local memory operations are much faster tha...
The gap between processor speed and memory latency has led to the use of caches in the memory system...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
The exploitation of locality of reference in shared memory multiprocessors is one of the most import...
The exploitation of locality of reference in shared memory multiprocessors is one of the most import...
Development of scalable application codes requires an understanding and exploitation of the locality...
Data locality is one of the most important characteristics of programs. Its study has significant in...
The design of algorithms exhibiting a high degree of temporal and spatial locality of reference is c...
The design of algorithms exhibiting a high degree of tem-poral and spatial locality of reference is ...
This work explores the tradeoffs of the memory system of a new massively parallel multiprocessor in ...
grantor: University of TorontoThis dissertation proposes and evaluates compiler techniques...
This work presents four partitioning strategies, or design patterns, useful for decomposing a serial...
It is often assumed that computational load balance cannot be achieved in parallel and distributed s...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1993. Simultaneously published...
We articulate the need for managing (data) locality automatically rather than leaving it to the prog...
In machines like the Intel iPSC/2 and the BBN Butterfly, local memory operations are much faster tha...
The gap between processor speed and memory latency has led to the use of caches in the memory system...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
The exploitation of locality of reference in shared memory multiprocessors is one of the most import...
The exploitation of locality of reference in shared memory multiprocessors is one of the most import...
Development of scalable application codes requires an understanding and exploitation of the locality...
Data locality is one of the most important characteristics of programs. Its study has significant in...
The design of algorithms exhibiting a high degree of temporal and spatial locality of reference is c...
The design of algorithms exhibiting a high degree of tem-poral and spatial locality of reference is ...
This work explores the tradeoffs of the memory system of a new massively parallel multiprocessor in ...
grantor: University of TorontoThis dissertation proposes and evaluates compiler techniques...
This work presents four partitioning strategies, or design patterns, useful for decomposing a serial...
It is often assumed that computational load balance cannot be achieved in parallel and distributed s...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1993. Simultaneously published...
We articulate the need for managing (data) locality automatically rather than leaving it to the prog...