Sciweavers

779 search results - page 30 / 156
» A Simple Program Transformation for Parallelism
Sort
View
JAR
2008
101views more  JAR 2008»
13 years 7 months ago
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
Laurence Rideau, Bernard P. Serpette, Xavier Leroy
MICS
2008
108views more  MICS 2008»
13 years 7 months ago
Efficient Intensional Implementation for Lazy Functional Languages
The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional program by introducing appropriate context manipulatio...
Angelos Charalambidis, Athanasios Grivas, Nikolaos...
MICRO
2007
IEEE
164views Hardware» more  MICRO 2007»
14 years 2 months ago
A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
The emergence of multicore processors has heightened the need for effective parallel programming practices. In addition to writing new parallel programs, the next generation of pr...
William Thies, Vikram Chandrasekhar, Saman P. Amar...
ISCAPDCS
2003
13 years 9 months ago
Loop Transformation Techniques To Aid In Loop Unrolling and Multithreading
In modern computer systems loops present a great deal of opportunities for increasing Instruction Level and Thread Level Parallelism. Loop unrolling is a technique used to obtain ...
Litong Song, Yuhua Zhang, Krishna M. Kavi
ASPLOS
2009
ACM
14 years 8 months ago
Architectural support for SWAR text processing with parallel bit streams: the inductive doubling principle
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
Robert D. Cameron, Dan Lin