Sciweavers

CISIS
2008
IEEE
13 years 11 months ago
Latency Impact on Spin-Lock Algorithms for Modern Shared Memory Multiprocessors
In 2006, John Mellor-Crummey and Michael Scott received the Dijkstra Prize in Distributed Computing. This prize was for their 1991 paper on algorithms for scalable synchronization ...
Jan Christian Meyer, Anne C. Elster
BIBE
2008
IEEE
272views Bioinformatics» more  BIBE 2008»
13 years 11 months ago
Design and implementation of the Smith-Waterman algorithm on the CUDA-compatible GPU
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uni...
Yuma Munekawa, Fumihiko Ino, Kenichi Hagihara
APLAS
2009
ACM
13 years 11 months ago
Proving Copyless Message Passing
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
Jules Villard, Étienne Lozes, Cristiano Cal...
PVM
2009
Springer
13 years 11 months ago
MPC-MPI: An MPI Implementation Reducing the Overall Memory Consumption
Message-Passing Interface (MPI) has become a standard for parallel applications in high-performance computing. Within a single cluster node, MPI implementations benefit from the s...
Marc Pérache, Patrick Carribault, Herv&eacu...
PVM
2009
Springer
13 years 11 months ago
Hierarchical Collectives in MPICH2
Abstract. Most parallel systems on which MPI is used are now hierarchical: some processors are much closer to others in terms of interconnect performance. One of the most common su...
Hao Zhu, David Goodell, William Gropp, Rajeev Thak...
IPPS
2009
IEEE
13 years 11 months ago
Scalable RDMA performance in PGAS languages
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
Montse Farreras, George Almási, Calin Casca...
RTSS
2009
IEEE
13 years 11 months ago
Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
Yan Li, Vivy Suhendra, Yun Liang, Tulika Mitra, Ab...
CLUSTER
2009
IEEE
13 years 11 months ago
Integrating software distributed shared memory and message passing programming
Abstract—Software Distributed Shared Memory (SDSM) systems provide programmers with a shared memory programming environment across distributed memory architectures. In contrast t...
H'sien J. Wong, Alistair P. Rendell
POPL
2009
ACM
13 years 11 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...