Sciweavers

213 search results - page 19 / 43
» Parallel Programmability and the Chapel Language
Sort
View
96
Voted
IPPS
2006
IEEE
15 years 8 months ago
Hierarchically tiled arrays for parallelism and locality
Parallel programming is facilitated by constructs which, unlike the widely used SPMD paradigm, provide programmers with a global view of the code and data structures. These constr...
Jia Guo, Ganesh Bikshandi, Daniel Hoeflinger, Gheo...
85
Voted
ICCD
2001
IEEE
98views Hardware» more  ICCD 2001»
15 years 10 months ago
Design Alternatives for Parallel Saturating Multioperand Adders
Parallel saturating multioperand adders significantly improve the performance of GSM speech coders by giving compilers and assembly language programmers the ability to paralleliz...
Pablo I. Balzola, Michael J. Schulte, Jie Ruan, C....
ICLP
2004
Springer
15 years 7 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
143
Voted
PPOPP
1993
ACM
15 years 6 months ago
Computation Migration: Enhancing Locality for Distributed-Memory Parallel Systems
We describe computation migration,a new technique that is based on compile-time program transformations, for accessing remote data in a distributed-memory parallel system. In cont...
Wilson C. Hsieh, Paul Wang, William E. Weihl
147
Voted
APCSAC
2000
IEEE
15 years 5 months ago
Dataflow Java: Implicitly Parallel Java
Dataflow computation models enable simpler and more efficient management of the memory hierarchy - a key barrier to the performance of many parallel programs. This paper describes...
Gareth Lee, John Morris