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

This report describes Nesl, a strongly-typed, applicative, data-parallel language. Nesl is
intended to be used as a portable interface for programming a variety of parallel and vector …

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 …

Concurrent programming is conceptually harder to undertake and to understand than
sequential programming, because a programmer has to manage the coexistence and …

The running time and memory requirement of a parallel program with dynamic, lightweight
threads depends heavily on the underlying thread scheduler. In this paper, we present a …

Many of today's high-level parallel languages support dynamic, fine-grained parallelism.
These languages allow the user to expose all the parallelism in the program, which is …

Recent work on scheduling algorithms has resulted in provable bounds on the space taken
by parallel computations in relation to the space taken by sequential computations. The …

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 …

Efficient parallel execution of a high-level data-parallel language based on nested
sequences, higher order functions and generalized iterators can be realized in the vector …

Parallel machines have become more widely used. Unfortunately parallel programming
technologies have advanced at a much slower pace except for regular programs. For …