Sciweavers

573 search results - page 5 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
PPOPP
2012
ACM
12 years 4 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ADT
2005
13 years 8 months ago
On Multiple Slice Turbo Codes
: The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this proble...
David Gnaedig, Emmanuel Boutillon, Michel Jé...
SC
1991
ACM
13 years 12 months ago
Interprocedural transformations for parallel code generation
We present a new approach that enables compiler optimization of procedure calls and loop nests containing procedure calls. We introduce two interprocedural transformationsthat mov...
Mary W. Hall, Ken Kennedy, Kathryn S. McKinley
LCPC
1997
Springer
13 years 12 months ago
Reducing Synchronization Overhead for Compiler-Parallelized Codes
Software distributed-shared-memory (DSM) systems providean appealingtarget for parallelizing compilers due to their flexibility. Previous studies demonstrate such systems can prov...
Hwansoo Han, Chau-Wen Tseng, Peter J. Keleher
ENC
2004
IEEE
14 years 3 days ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...