Bounds on contention management algorithms

J Schneider, R Wattenhofer - International Symposium on Algorithms and …, 2009 - Springer
We present two new algorithms for contention management in transactional memory, the
deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds …

Coping with Selfishness in Distributed Systems: Mechanism Design in Multi-Core and Peer-to-Peer Systems

R Eidenbenz - 2012 - research-collection.ethz.ch
Distributed systems with autonomous and self-interested participants often exhibit
deficiencies due to selfishness of its participants. Mechanism design is the discipline that …

Local Distributed Algorithms for Selfish Agents

S Collet, P Fraigniaud, P Penna - arXiv preprint arXiv:1607.03677, 2016 - arxiv.org
In the classical framework of local distributed network computing, it is generally assumed
that the entities executing distributed algorithms are altruistic. However, in various scenarios …

Physical algorithms

R Wattenhofer - International Colloquium on Automata, Languages …, 2010 - Springer
This is the accompanying paper to an ICALP 2010 invited talk, intending to encourage
research in physical algorithms. The area of physical algorithms deals with networked …

[PDF][PDF] Overview of Achievements

TL Keller, J Schneider, J Seidel, J Smula, J Uitto… - Citeseer
Objective My research interests are the fundamental problems in computer science and
information technology that impact the real world, especially in the areas distributed …

[PDF][PDF] Decentralized coordination: methods and applications

J Schneider - 2011 - research-collection.ethz.ch
VERTEILTE ALGORITHMEN+ PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN)
; PARALLELVERARBEITUNG+ NEBENLÄUFIGKEIT (BETRIEBSSYSTEME); …

[引用][C] Mechanism Design for Software Transactional Memory

S Ganzfried, A Othman - 2009

[引用][C] 15-740 Project Proposal Sam Ganzfried and Abe Othman October 21, 2009• Group Info

S Ganzfried - Group, 2009