Filters








331,491 Hits in 2.3 sec

A simple constructive computability theorem for wait-free computation

Maurice Herlihy, Nir Shavit
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
A Simple (constructive Computability Theorem for wait-free~omputation STOC 94-5/94 Montreal, Quebec, Canada  ...  or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association of Computing  ... 
doi:10.1145/195058.195144 dblp:conf/stoc/HerlihyS94 fatcat:t453qf2pevfixecfkqw4kwxqxm

Locality and Checkability in Wait-Free Computing [chapter]

Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2011 Lecture Notes in Computer Science  
This paper thus investigates other notions of locality which, in the framework of wait-free computing, open up to new, rich classes of tasks.  ...  Unfortunately, monotony is not sufficient to ensure efficient computation in the network setting, neither it is sufficient to ensure solvability in the wait-free setting.  ...  Section 2 presents the wait-free distributed computing model computing, and recalls the notion of tasks.  ... 
doi:10.1007/978-3-642-24100-0_34 fatcat:jkcgmmiefzfbfdw5rxd27yj6zm

Locality and checkability in wait-free computing

Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2013 Distributed computing  
This paper thus investigates other notions of locality which, in the framework of wait-free computing, open up to new, rich classes of tasks.  ...  Unfortunately, monotony is not sufficient to insure efficient computation in the network setting, neither it is sufficient to insure solvability in the wait-free setting.  ...  Section 2 presents the wait-free distributed computing model computing, and recalls the notion of tasks.  ... 
doi:10.1007/s00446-013-0188-x fatcat:46pzdfdxarc6bj2t25roznr7pa

Wait-Free Synchronization [chapter]

2005 Concurrent and Distributed Computing in Java  
Does the implements relation have a different structure for bounded wait-free, wait-free, or nonblocking synchronization?  ...  This protocol is clearly wait-free, since it contains no loops.  ... 
doi:10.1002/0471721271.ch5 fatcat:gika5yggazfyraezjblhrnpoi4

Wait-free linearization with a mechanical proof

Wim H. Hesselink
1995 Distributed computing  
After ten years of research in Lie algebras he turned to computer science. In 1986/1987 he was on leave with the Department of Computer Sciences of the University of Texas at Austin.  ...  Currently, he is chairman of the Department of Computing Science at the University of Groningen.  ...  Moreover, applyO is not wait-free. In a later refinement, the choice of Q will be implemented in such a way that the algorithm becomes wait-free.  ... 
doi:10.1007/s004460050007 fatcat:2rdcp5eg3fhpri554zfi353ema

Wait-Free Programming for General Purpose Computations on Graphics Processors

Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus
2017 IEEE transactions on computers  
Accesses to the wait-free objects have time complexity O(N ), where N is the number of processes. The wait-free objects have the optimal space complexity O(N 2 ).  ...  Our result demonstrates that it is possible to construct wait-free synchronization mechanisms for GPUs without strong synchronization primitives in hardware and that wait-free programming is possible for  ...  The main contribution of this paper is a new formal model for GPU computing and novel wait-free synchronization mechanisms for the GPU computing model, empowering the programmer with the necessary and  ... 
doi:10.1109/tc.2012.274 fatcat:kx3onf4wrraanbliulbrhdojum

Lower bounds for wait-free computation in message-passing systems

M. Herlihy, Mark R. Tuttle
1990 Proceedings of the ninth annual ACM symposium on Principles of distributed computing - PODC '90  
Our results suggest the existence of a nontrivial complexity hierarchy for wait-free implementations of concurrent objects.  ...  Our technique is to reduce the (difficult) problem of analyzing all possible wait-free implementations for a particular object to the (more tractable) problem of analyzing a related decision problem.  ...  •I 7 A Wait-free Increment Register In this section, we show how a particular strong renaming algorithm can be transformed into a wait-free implementation of an increment register.  ... 
doi:10.1145/93385.93439 dblp:conf/podc/HerlihyT90 fatcat:kjhr6zvlovhlthoxlajy536mkm

Wait-free Programming for General Purpose Computations on Graphics Processors

Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
Accesses to the wait-free objects have time complexity O(N ), where N is the number of processes. The wait-free objects have the optimal space complexity O(N 2 ).  ...  Our result demonstrates that it is possible to construct wait-free synchronization mechanisms for GPUs without strong synchronization primitives in hardware and that wait-free programming is possible for  ...  The main contribution of this paper is a new formal model for GPU computing and novel wait-free synchronization mechanisms for the GPU computing model, empowering the programmer with the necessary and  ... 
doi:10.1109/ipdps.2008.4536291 dblp:conf/ipps/HaTA08 fatcat:2lquqokiabet5ic7f7erst73ue

Wait-free programming for general purpose computations on graphics processors

Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
Accesses to the wait-free objects have time complexity O(N ), where N is the number of processes. The wait-free objects have the optimal space complexity O(N 2 ).  ...  Our result demonstrates that it is possible to construct wait-free synchronization mechanisms for GPUs without strong synchronization primitives in hardware and that wait-free programming is possible for  ...  The main contribution of this paper is a new formal model for GPU computing and novel wait-free synchronization mechanisms for the GPU computing model, empowering the programmer with the necessary and  ... 
doi:10.1145/1400751.1400849 dblp:conf/podc/HaTA08 fatcat:kmlezcd2bjfavdkqypjdlp6hiy

Obstruction-Free Algorithms Can Be Practically Wait-Free [chapter]

Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
2005 Lecture Notes in Computer Science  
We present a transformation that converts any obstruction-free algorithm into one that is wait-free when analyzed in the unknown-bound semisynchronous model.  ...  to wait-freedom.  ...  This weaker progress condition usually makes lock-free implementations easier to design than wait-free ones.  ... 
doi:10.1007/11561927_8 fatcat:fdzoxthmwfcqvlzppvy3kzneka

Wait-free linearization with a mechanical proof

Wim H. Hesselink
1995 Distributed computing  
After ten years of research in Lie algebras he turned to computer science. In 1986/1987 he was on leave with the Department of Computer Sciences of the University of Texas at Austin.  ...  Currently, he is chairman of the Department of Computing Science at the University of Groningen.  ...  Moreover, applyO is not wait-free. In a later refinement, the choice of Q will be implemented in such a way that the algorithm becomes wait-free.  ... 
doi:10.1007/bf01784240 fatcat:quzgd4oz6jayfgetbisdw626la

Wait-free linearization with an assertional proof

Wim H. Hesselink
1994 Distributed computing  
Summary Given a sequential implementation of an arbitrary data object, a wait-free, linearizable concurrent implementation is constructed with space complexity quadratic in the number of processes.  ...  After ten years of research in algebraic groups he turned to computer science. Since 1985 he has been an associate professor with the Department of Computing Science at the University of Groningen.  ...  Therefore, recently, the concept of wait-free implementations has been proposed.  ... 
doi:10.1007/bf02280829 fatcat:h4tcc2b6dnfg3fy5ar5e6c6qpa

A Wait-Free Stack [chapter]

Seep Goel, Pooja Aggarwal, Smruti R. Sarangi
2015 Lecture Notes in Computer Science  
All our operations are wait-free and linearizable.  ...  In the past, researchers have proposed restricted wait-free implementations of stacks, lock-free implementations, and efficient universal constructions that can support wait-free stacks.  ...  [7, 8] suggest an approach where a wait-free shared counter can be adapted to create wait-free stacks.  ... 
doi:10.1007/978-3-319-28034-9_6 fatcat:mdox46clkfaipgh4hc5hqdcxqy

Randomized wait-free naming [chapter]

Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi
1994 Lecture Notes in Computer Science  
doi:10.1007/3-540-58325-4_169 fatcat:zlig24kdujfyrpwt4ojbjz5kai

Optimal implementation of wait-free binary relations [chapter]

Eric Goubault
1997 Lecture Notes in Computer Science  
In this article we derive an algorithm for computing the "optimal" wait-free program on two processors that implements a given relation from the semantics of a small atomic read/write shared-memory parallel  ...  any wait-free relation.  ...  Geometric Properties Specification graphs represent the relation computed by programs written in our wait-free language.  ... 
doi:10.1007/bfb0030599 fatcat:dqolui5oeffothqa7eawz7acau
« Previous Showing results 1 — 15 out of 331,491 results