Sciweavers

573 search results - page 61 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
PPOPP
2010
ACM
15 years 7 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
IPPS
2006
IEEE
15 years 4 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...
FCCM
2007
IEEE
124views VLSI» more  FCCM 2007»
15 years 4 months ago
A Hybrid Memory Sub-system for Video Coding Applications
This paper introduces a parameterisable, application and platform-independent, hybrid memory sub-system for custom hardware. This memory sub-system consists of a scratchpad memory...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...
OPODIS
2010
14 years 8 months ago
On the Automated Implementation of Time-Based Paxos Using the IOA Compiler
Paxos is a well known algorithm for achieving consensus in distributed environments with uncertain processing and communication timing. Implementations of its variants have been s...
Chryssis Georgiou, Procopis Hadjiprocopiou, Peter ...
IPPS
2007
IEEE
15 years 4 months ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...