Sciweavers

6568 search results - page 1186 / 1314
» Reducing the Complexity of Reductions
Sort
View
CLUSTER
2006
IEEE
15 years 6 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
IJNSEC
2008
96views more  IJNSEC 2008»
15 years 6 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
JCM
2008
63views more  JCM 2008»
15 years 6 months ago
A Node Encoding of Torus Topology and Its Improved Routing Algorithm
With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the perf...
Xiaoqiang Yang, Junmin Li, Huimin Du, Jungang Han
JRTIP
2008
118views more  JRTIP 2008»
15 years 6 months ago
Custom parallel caching schemes for hardware-accelerated image compression
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...
JSAC
2008
128views more  JSAC 2008»
15 years 6 months ago
Iterative frequency domain channel estimation for dft-precoded ofdm systems using in-band pilots
We consider two techniques of in-band frequency domain multiplexed (FDM) pilots using interleaved frequency domain multiple access (IFDMA) signal with a Chu sequence for DFT-precod...
Chan-Tong Lam, David D. Falconer, Florence Danilo-...
« Prev « First page 1186 / 1314 Last » Next »