Sciweavers

2477 search results - page 150 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
104
Voted
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 2 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
118
Voted
PPAM
2005
Springer
15 years 8 months ago
SILC: A Flexible and Environment-Independent Interface for Matrix Computation Libraries
We propose a new framework, named Simple Interface for Library Collections (SILC), that gives users access to matrix computation libraries in a flexible and environment-independen...
Tamito Kajiyama, Akira Nukada, Hidehiko Hasegawa, ...
158
Voted
PPOPP
2009
ACM
16 years 3 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
135
Voted
LCTRTS
2009
Springer
15 years 9 months ago
Synergistic execution of stream programs on multicores with accelerators
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
147
Voted
DAC
2007
ACM
16 years 3 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...