problems To understand the class of polynomial-time solvable problems, we must first have a formal notion of what a "problem" is. We define an abstract problem Q to be a binary relation on a set I ofâ€¦ (More)

This thesis explores several issues that arise in the design and implementation of virtual-memory systems for data-parallel computing. Chapter 1 presents an overview of virtual memory forâ€¦ (More)

FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functions and representsâ€¦ (More)

The execution time or estimated execution time of actor. UBS Unbounded buffer synchronization. A synchronization protocol that must be used for feedforward edges of the synchronization graph. Thisâ€¦ (More)

Although several algorithms have been developed for the Parallel Disk Model (PDM), few have been implemented. Consequently, little has been known about the accuracy of the PDM in measuring I/O timeâ€¦ (More)

We give asymptotically equal lower and upper bounds for the number of parallel I/O operations required to perform bit-matrix-multiply/complement (BMMC) permutations on parallel disk systems. In aâ€¦ (More)