Algorithms | Sciweavers

33

WDAG
2005
Springer

103views Algorithms» more WDAG 2005»

14 years 5 months ago

Software Transactional Memory (STM) is a generic synchronization construct that enables automatic conversion of correct sequential objects into correct nonblocking concurrent obje...

Virendra J. Marathe, William N. Scherer III, Micha...

claim paper

Read More »

40

click to vote

WDAG
2005
Springer

108views Algorithms» more WDAG 2005»

Non-blocking Hashtables with Open Addressing

14 years 5 months ago

Download research.microsoft.com

Chris Purcell, Tim Harris

claim paper

Read More »

36

click to vote

WDAG
2005
Springer

92views Algorithms» more WDAG 2005»

Timing Games and Shared Memory

14 years 5 months ago

Download www.markrtuttle.com

Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle

claim paper

Read More »

29

click to vote

WDAG
2005
Springer

111views Algorithms» more WDAG 2005»

Byzantine Clients Rendered Harmless

14 years 5 months ago

Download publications.csail.mit.edu

Barbara Liskov, Rodrigo Rodrigues

claim paper

Read More »

34

click to vote

WDAG
2005
Springer

130views Algorithms» more WDAG 2005»

Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs

14 years 5 months ago

Download dcg.ethz.ch

Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...

Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...

claim paper

Read More »

33

click to vote

WDAG
2005
Springer

100views Algorithms» more WDAG 2005»

The Dynamic And-Or Quorum System

14 years 5 months ago

Download www.cs.tau.ac.il

We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We ﬁrst analyze th...

Uri Nadav, Moni Naor

claim paper

Read More »

30

click to vote

WDAG
2005
Springer

92views Algorithms» more WDAG 2005»

Plausible Clocks with Bounded Inaccuracy

14 years 5 months ago

Download www.cse.ohio-state.edu

In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a...

Brad T. Moore, Paolo A. G. Sivilotti

claim paper

Read More »

34

click to vote

WDAG
2005
Springer

92views Algorithms» more WDAG 2005»

Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks

14 years 5 months ago

Download gsyc.es

Michael Mitzenmacher

claim paper

Read More »

30

click to vote

WDAG
2005
Springer

80views Algorithms» more WDAG 2005»

Obstruction-Free Algorithms Can Be Practically Wait-Free

14 years 5 months ago

Download www.cs.tau.ac.il

Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...

Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir...

claim paper

Read More »

22

click to vote

WDAG
2005
Springer

69views Algorithms» more WDAG 2005»

Reliably Executing Tasks in the Presence of Malicious Processors

14 years 5 months ago