Sciweavers

769 search results - page 68 / 154
» Analysis of recursively parallel programs
Sort
View
IFIP
2004
Springer
14 years 2 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
ICASSP
2009
IEEE
14 years 20 days ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
ICS
1993
Tsinghua U.
14 years 27 days ago
The EM-4 Under Implicit Parallelism
: The EM-4 is a supercomputer that offers very fast inter processor communication and support for multi threading. In this paper we demonstrate that the EM-4, Together with an auto...
Lubomir Bic, Mayez A. Al-Mouhamed
VECPAR
2004
Springer
14 years 2 months ago
PerWiz: A What-If Prediction Tool for Tuning Message Passing Programs
Abstract. This paper presents PerWiz, a performance prediction tool for improving the performance of message passing programs. PerWiz focuses on locating where a significant impro...
Fumihiko Ino, Yuki Kanbe, Masao Okita, Kenichi Hag...
IISWC
2009
IEEE
14 years 3 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss