Sciweavers

1746 search results - page 81 / 350
» A linear implementation of PACMAN
Sort
View
PPL
2002
83views more  PPL 2002»
13 years 8 months ago
Trading Replication for Communication in Parallel Distributed-Memory Dense Solvers
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...
Dror Irony, Sivan Toledo
ICDCS
2003
IEEE
14 years 2 months ago
Obstruction-Free Synchronization: Double-Ended Queues as an Example
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks,...
Maurice Herlihy, Victor Luchangco, Mark Moir
CDC
2008
IEEE
170views Control Systems» more  CDC 2008»
14 years 3 months ago
Modeling and control of the protein synthesis process in eukaryotic cells
— Protein synthesis is an essential process of cell cycle and growth in eukaryotic cells. The initiation stage of the translation process is known to be the most crucial in regul...
Nadav S. Bar, Rahmi Lale
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
14 years 2 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
FM
2009
Springer
169views Formal Methods» more  FM 2009»
14 years 1 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...