Sciweavers

1156 search results - page 52 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
ICDCS
2000
IEEE
14 years 2 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
APNOMS
2006
Springer
14 years 2 months ago
Mixing Heterogeneous Address Spaces in a Single Edge Network
The growth of IPv4 Internet has been facing the infamous IP address depletion barrier. In practice, typical IPv4 Internet edge networks can be expanded by incorporating private add...
Ilhwan Kim, Heon Young Yeom
ALMOB
2008
95views more  ALMOB 2008»
13 years 11 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
HPDC
2007
IEEE
14 years 5 months ago
Feedback-directed thread scheduling with memory considerations
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
Fengguang Song, Shirley Moore, Jack Dongarra
HPCC
2005
Springer
14 years 4 months ago
Performance Analysis of Shared-Memory Parallel Applications Using Performance Properties
Tuning parallel code can be a time-consuming and difficult task. We present our approach to automate the performance analysis of OpenMP applications that is based on the notion of ...
Karl Fürlinger, Michael Gerndt