Sciweavers

1156 search results - page 4 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 7 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
ICPADS
2005
IEEE
14 years 1 months ago
Efficient Barrier Synchronization on Wireless Computing Systems
This work deals with efficient barrier synchronization for wireless cluster computing where nodes communicate with each other wirelessly in one or multiple hops. Such a computing ...
Nian-Feng Tzeng, Bhanurekha Kasula, Hongyi Wu
SOSP
1997
ACM
13 years 8 months ago
Towards Transparent and Efficient Software Distributed Shared Memory
Despite a large research effort, software distributed shared memory systems have not been widely used to run parallel applications across clusters of computers. The higher perform...
Daniel J. Scales, Kourosh Gharachorloo
ICPP
1999
IEEE
13 years 11 months ago
Efficient Techniques for Distributed Implementation of Search-Based AI Systems
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
Gopal Gupta, Enrico Pontelli
ICDCS
1996
IEEE
13 years 11 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro