Sciweavers

6584 search results - page 267 / 1317
» Distributed Shared Contexts
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 7 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
PODS
2008
ACM
221views Database» more  PODS 2008»
16 years 7 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
16 years 6 months ago
Reliable Storage and Querying for Collaborative Data Sharing Systems
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
Nicholas E. Taylor, Zachary G. Ives
MOBIHOC
2003
ACM
16 years 6 months ago
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...
Tara Small, Zygmunt J. Haas
IEEEPACT
2009
IEEE
16 years 1 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung