Sciweavers

2814 search results - page 374 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
PODC
1994
ACM
14 years 2 months ago
A Performance Evaluation of Lock-Free Synchronization Protocols
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...
Anthony LaMarca
CONCUR
2006
Springer
14 years 2 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
IRREGULAR
1995
Springer
14 years 1 months ago
Run-Time Parallelization of Irregular DOACROSS Loops
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mar...
AI
2008
Springer
13 years 10 months ago
Managing parallel inquiries in agents' two-sided search
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
David Sarne, Sarit Kraus
IJON
2010
138views more  IJON 2010»
13 years 8 months ago
A dynamic Bayesian network to represent discrete duration models
Originally devoted to specific applications such as biology, medicine and demography, duration models are now widely used in economy, finance or reliability. Recent works in var...
Roland Donat, Philippe Leray, Laurent Bouillaut, P...