Programming parallel algorithms
GE Blelloch - Communications of the ACM, 1996 - dl.acm.org
parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most
problems for which efficient sequential solutions are known. Although some ofthese …
problems for which efficient sequential solutions are known. Although some ofthese …
[图书][B] NESL: A nested data-parallel language (version 3.1)
GE Blelloch - 1995 - Citeseer
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 …
intended to be used as a portable interface for programming a variety of parallel and vector …
Provably efficient scheduling for languages with fine-grained parallelism
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 …
the popular work-time framework for parallel algorithm design, programs written in such …
Programming languages and systems for prototyping concurrent applications
W Hasselbring - ACM Computing Surveys (CSUR), 2000 - dl.acm.org
Concurrent programming is conceptually harder to undertake and to understand than
sequential programming, because a programmer has to manage the coexistence and …
sequential programming, because a programmer has to manage the coexistence and …
Scheduling threads for low space requirement and good locality
GJ Narlikar - Proceedings of the eleventh annual ACM symposium …, 1999 - dl.acm.org
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 …
threads depends heavily on the underlying thread scheduler. In this paper, we present a …
Space-efficient scheduling of nested parallelism
GJ Narlikar, GE Blelloch - ACM Transactions on Programming …, 1999 - dl.acm.org
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 …
These languages allow the user to expose all the parallelism in the program, which is …
Space-efficient scheduling of parallelism with synchronization variables
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 …
by parallel computations in relation to the space taken by sequential computations. The …
Provably efficient scheduling for languages with fine-grained parallelism
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 …
the popular work-time framework for parallel algorithm design, programs written in such …
Transforming high-level data-parallel programs into vector operations
JF Prins, DW Palmer - ACM SIGPLAN Notices, 1993 - dl.acm.org
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 …
sequences, higher order functions and generalized iterators can be realized in the vector …
Easy PRAM-based high-performance parallel programming with ICE
Parallel machines have become more widely used. Unfortunately parallel programming
technologies have advanced at a much slower pace except for regular programs. For …
technologies have advanced at a much slower pace except for regular programs. For …