Sciweavers

1156 search results - page 57 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
148
Voted
SPAA
2009
ACM
16 years 26 days ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
138
Voted
IPPS
2006
IEEE
15 years 9 months ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang
122
Voted
IPPS
1999
IEEE
15 years 8 months ago
COWL: Copy-On-Write for Logic Programs
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
Vítor Santos Costa
134
Voted
PDCAT
2005
Springer
15 years 9 months ago
Performance Comparison between VOPP and MPI
View-Oriented Parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into v...
Zhiyi Huang, Martin K. Purvis, Paul Werstein
157
Voted
VEE
2009
ACM
240views Virtualization» more  VEE 2009»
15 years 10 months ago
Memory buddies: exploiting page sharing for smart colocation in virtualized data centers
Many data center virtualization solutions, such as VMware ESX, employ content-based page sharing to consolidate the resources of multiple servers. Page sharing identifies virtual...
Timothy Wood, Gabriel Tarasuk-Levin, Prashant J. S...