parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most
problems for which efficient sequential solutions are known. Although some ofthese …

We present a type-based approach to eliminating array bound checking and list tag
checking by conservatively extending Standard ML with a restricted form of dependent …

The behavior of a multithreaded program does not depend only on its inputs. Scheduling,
memory reordering, timing, and low-level hardware effects all introduce nondeterminism in …

Chip multiprocessors (CMPs) are now commonplace, and the number of cores on a CMP is
likely to grow steadily. However, in order to harness the additional compute resources of a …

We are investigating a new approach to compiling Standard ML (SML) based on four key
technologies: interwional polymorphism [23], nearlg tag-free garbage collection[12, 46, 34] …

We present a novel programming language design that attempts to combine the clarity and
safety of high-level functional languages with the efficiency and parallelism of low-level …

Many high-level parallel programming languages allow for fine-grained parallelism. As in
the popular work-time framework for parallel algorithm design, programs written in such …

Designing efficient, application-specialized hardware accelerators requires assessing trade-
offs between a hardware module's performance and resource requirements. To facilitate …

Current multiprocessor systems execute parallel and concurrent software
nondeterministically: even when given precisely the same input, two executions of the same …

This paper gives an overview of the implementation of NESL, a portable nested data-parallel
language. This language and its implementation are the first to fully support nested data …