Sciweavers

1156 search results - page 71 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
CONCUR
2005
Springer
14 years 3 months ago
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
Eric Goubault, Emmanuel Haucourt
IPPS
2008
IEEE
14 years 4 months ago
Impact of multicores on large-scale molecular dynamics simulations
Processing nodes of the Cray XT and IBM Blue Gene Massively Parallel Processing (MPP) systems are composed of multiple execution units, sharing memory and network subsystems. Thes...
Sadaf R. Alam, Pratul K. Agarwal, Scott S. Hampton...
ICPADS
2006
IEEE
14 years 4 months ago
A Distributed Algorithm for Sharing Web Cache Disk Capacity
A decentralized game theoretic framework applied to Web caching is discussed. The interaction of multiple clients with a caching server is modeled as a non-cooperative game, in wh...
George Alyfantis, Stathes Hadjiefthymiades, Lazaro...
ICDCS
1991
IEEE
14 years 1 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
IPPS
2009
IEEE
14 years 5 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...