Sciweavers

139 search results - page 21 / 28
» Constructive and Adaptable Distributed Shared Memory
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
BDIM
2007
IEEE
95views Business» more  BDIM 2007»
14 years 1 months ago
A Mechanism of Specifying and Determining Pricing in Utility Computing Environments
Utility services providers offer on-demand services for multiple users and applications from a shared resource pool. The utility computing environment provider manages resources th...
Jinsong Ouyang, Akhil Sahai, Jim Pruyne
IWOMP
2009
Springer
14 years 2 months ago
Scalability Evaluation of Barrier Algorithms for OpenMP
OpenMP relies heavily on barrier synchronization to coordinate the work of threads that are performing the computations in a parallel region. A good implementation of barriers is ...
Ramachandra C. Nanjegowda, Oscar Hernandez, Barbar...
IPPS
2007
IEEE
14 years 1 months ago
Invited Paper: A Compile-time Cost Model for OpenMP
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. It is also a promising candidate to exploit the emer...
Chunhua Liao, Barbara M. Chapman