This paper describes Shasta, a system that supports a shared address space in software on
clusters of computers with physically distributed memory. A unique aspect of Shasta …

This work provides a systematic study of the impact of communication performance on
parallel applications in a high performance network of workstations. We develop an …

The dataflow program graph execution model, or dataflow for short, is an alternative to the
stored-program (von Neumann) execution model. Because it relies on a graph …

The paper presents an overview of the parallel computing models, architectures, and
research projects that are based on asynchronous instruction scheduling. It starts with pure …

The importance of irregular applications such as graph analytics is rapidly growing with the
rise of Big Data. However, parallel graph workloads tend to perform poorly on general …

Parallel algorithm designers need computational models that take first order system costs
into account, but are also simple enough to use in practice. This paper introduces the LoPC …

Historically, processor accesses to memory-mapped device registers have been marked
uncachable to insure their visibility to the device. The ubiquity of snooping cache coherence …

This paper investigates hardware support for fine-grain distributed shared memory (DSM) in
networks of workstations. To reduce design time and implementation cost relative to …

Parallel systems supporting multithreading, or message passing in general, have typically
used either polling or interrupts to handle incoming messages. Neither approach is ideal; …

Multithreaded architectures provide an opportunity for efficiently executing programs with
irregular parallelism and/or irregular locality. This paper presents a strategy that makes use …