8 citations · 22 across the 13 of their papers we have counts for
3 papers · 1 filter
Locally Solvable Tasks and the Limitations of Valency Arguments
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
An elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature…
Fully Read/Write Fence-Free Work-Stealing with Multiplicity
Armando Castañeda, Miguel Piña
Work-stealing is a popular technique to implement dynamic load balancing in a distributed manner. In this approach, each process owns a set of tasks that have to be executed. The o…
Relaxed Queues and Stacks from Read/Write Operations
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Considering asynchronous shared memory systems in which any number of processes may crash, this work identifies and formally defines relaxations of queues and stacks that can be no…