Sciweavers

2932 search results - page 105 / 587
» Optimizing Memory System Performance for Communication in Pa...
Sort
View
CLUSTER
2008
IEEE
14 years 3 months ago
Message progression in parallel computing - to thread or not to thread?
Abstract—Message progression schemes that enable communication and computation to be overlapped have the potential to improve the performance of parallel applications. With curre...
Torsten Hoefler, Andrew Lumsdaine
ICPP
1997
IEEE
14 years 1 months ago
How Much Does Network Contention Affect Distributed Shared Memory Performance?
Most of recent research on distributed shared memory (DSM)systems have focused on either careful design of node controllersor cache coherenceprotocols. Whileevaluating these desig...
Donglai Dai, Dhabaleswar K. Panda
FCCM
2002
IEEE
171views VLSI» more  FCCM 2002»
14 years 2 months ago
Coarse-Grain Pipelining on Multiple FPGA Architectures
Reconfigurable systems, and in particular, FPGA-based custom computing machines, offer a unique opportunity to define application-specific architectures. These architectures offer...
Heidi E. Ziegler, Byoungro So, Mary W. Hall, Pedro...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 11 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
SPAA
1993
ACM
14 years 1 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski