Sciweavers

5005 search results - page 167 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
121
Voted
PPOPP
2009
ACM
16 years 1 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
IPPS
2006
IEEE
15 years 6 months ago
A study of MPI performance analysis tools on Blue Gene/L
Applications on todays massively parallel supercomputers rely on performance analysis tools to guide them toward scalable performance on thousands of processors. However, conventi...
I-Hsin Chung, Robert Walkup, Hui-Fang Wen, Hao Yu
92
Voted
CAIP
2001
Springer
15 years 5 months ago
A Simple Algorithm for Ordering and Compression of Vector Codebooks
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies ...
Maciej Bartkowiak, Adam Luczak
87
Voted
ICCS
2004
Springer
15 years 6 months ago
Parallel Importance Separation for Multiple Integrals and Integral Equations
In this paper we present error and performance analysis of a Monte Carlo variance reduction method for solving multidimensional integrals and integral equations. This method, calle...
Sofiya Ivanovska, Aneta Karaivanova
103
Voted
LCPC
1995
Springer
15 years 4 months ago
Demand-Driven, Symbolic Range Propagation
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...
William Blume, Rudolf Eigenmann