Sciweavers

3616 search results - page 221 / 724
» Conditional Memory Ordering
Sort
View
SSS
2010
Springer
103views Control Systems» more  SSS 2010»
15 years 4 months ago
A Provably Starvation-Free Distributed Directory Protocol
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
Hagit Attiya, Vincent Gramoli, Alessia Milani
CORR
2006
Springer
135views Education» more  CORR 2006»
15 years 6 months ago
An equilibrium model for matching impatient demand and patient supply over time
We present a simple dynamic equilibrium model for an online exchange where both buyers and sellers arrive according to a exogenously defined stochastic process. The structure of t...
Garud Iyengar, Anuj Kumar
PVLDB
2008
74views more  PVLDB 2008»
15 years 5 months ago
Out-of-order processing: a new architecture for high-performance stream systems
Many stream-processing systems enforce an order on data streams during query evaluation to help unblock blocking operators and purge state from stateful operators. Such in-order p...
Jin Li, Kristin Tufte, Vladislav Shkapenyuk, Vassi...
NGITS
1997
Springer
15 years 10 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
16 years 27 days ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt