128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The use of automatic program restructuring and memory access combining for "general-purpose" large scale shared memory machine is investigated.The effects of unpredictable control flows and data accesses on the effectiveness of automatic program restructuring are considered through the experiments of several basic nonnumerical programs. Various loop structures found are classified, and their effects are investigated. Also, the importance of algorithm change is considered. In addition, a way of parallelizing loops with conditional branching is studied.Several schemes of memory access combining are investigated. Inherent limit in the idea of memory access combini...
TreadMarks supports parallel computing on networks of workstations by providing the application with...
INTRODUCTION The SPMD (Single-Program Multiple-Data Stream) model has been widely adopted as the ba...
For three years, members of the Computer Science Department at the University of Rochester have used...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The use of automatic program ...
Memory access time is a key factor limiting the performance of large-scale, shared-memory multiproce...
202 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The first part of this thesis...
One common cause of poor performance in large-scale shared-memory multiprocessors is limited memory ...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...
Abstract- The partitioning of shared memory into a number of memory modules is an approach to achiev...
125 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.This dissertation explores th...
In this paper we identify the factors that affect the derivation of computation and data partitions ...
The last decade has produced enormous improvements in processor speeds without a corresponding impro...
grantor: University of TorontoThis dissertation proposes and evaluates compiler techniques...
Parallel graph reduction is a conceptually simple model for the concurrent evaluation of lazy functi...
A major challenge for computer science in the 1990s is to determine the extent to which general purp...
TreadMarks supports parallel computing on networks of workstations by providing the application with...
INTRODUCTION The SPMD (Single-Program Multiple-Data Stream) model has been widely adopted as the ba...
For three years, members of the Computer Science Department at the University of Rochester have used...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The use of automatic program ...
Memory access time is a key factor limiting the performance of large-scale, shared-memory multiproce...
202 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The first part of this thesis...
One common cause of poor performance in large-scale shared-memory multiprocessors is limited memory ...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...
Abstract- The partitioning of shared memory into a number of memory modules is an approach to achiev...
125 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.This dissertation explores th...
In this paper we identify the factors that affect the derivation of computation and data partitions ...
The last decade has produced enormous improvements in processor speeds without a corresponding impro...
grantor: University of TorontoThis dissertation proposes and evaluates compiler techniques...
Parallel graph reduction is a conceptually simple model for the concurrent evaluation of lazy functi...
A major challenge for computer science in the 1990s is to determine the extent to which general purp...
TreadMarks supports parallel computing on networks of workstations by providing the application with...
INTRODUCTION The SPMD (Single-Program Multiple-Data Stream) model has been widely adopted as the ba...
For three years, members of the Computer Science Department at the University of Rochester have used...