Sciweavers

1024 search results - page 15 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
PADL
2010
Springer
14 years 5 months ago
Skeleton Composition Using Remote Data
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
Mischa Dieterle, Thomas Horstmeyer, Rita Loogen
IPPS
2009
IEEE
14 years 3 months ago
Scalable RDMA performance in PGAS languages
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
Montse Farreras, George Almási, Calin Casca...
IPPS
2000
IEEE
14 years 1 months ago
Controlling Distributed Shared Memory Consistency from High Level Programming Languages
One of the keys for the success of parallel processing is the availability of high-level programming languages for on-the-shelf parallel architectures. Using explicit message passi...
Yvon Jégou
ICPP
1996
IEEE
14 years 23 days ago
Mechanisms for Mapping High-Level Parallel Performance Data
A primary problem in the performance measurement of high-level parallel programming languages is to map lowlevel events to high-level programming constructs. We discuss several as...
R. Bruce Irvin, Barton P. Miller
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
14 years 3 months ago
Demystifying magic: high-level low-level programming
r of high-level languages lies in their abstraction over hardware and software complexity, leading to greater security, better reliability, and lower development costs. However, o...
Daniel Frampton, Stephen M. Blackburn, Perry Cheng...