Sciweavers

131 search results - page 9 / 27
» Implementation of Atomic Primitives on Distributed Shared Me...
Sort
View
PSC
1992
14 years 23 days ago
A Message Passing Implementation of Lazy Task Creation
Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
Marc Feeley
ICCSA
2003
Springer
14 years 1 months ago
Parallel CLUSTAL W for PC Clusters
This paper presents a parallel version of CLUSTAL W, called pCLUSTAL. In contrast to the commercial SGI parallel Clustal, which requires an expensive shared memory SGI multiprocess...
James Cheetham, Frank K. H. A. Dehne, Sylvain Pitr...
JCPHY
2011
192views more  JCPHY 2011»
12 years 11 months ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
TLDI
2010
ACM
225views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Race-free and memory-safe multithreading: design and implementation in cyclone
We present the design of a formal low-level multi-threaded language with advanced region-based memory management and synchronization primitives, where well-typed programs are memo...
Prodromos Gerakios, Nikolaos Papaspyrou, Konstanti...
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
14 years 28 days ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill