Sciweavers

2494 search results - page 23 / 499
» Dependable Distributed Computing Using Free Databases
Sort
View
EUROPAR
2006
Springer
13 years 11 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
LFP
1994
129views more  LFP 1994»
13 years 8 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
SAC
2010
ACM
13 years 7 months ago
TransPeer: adaptive distributed transaction monitoring for Web2.0 applications
In emerging Web2.0 applications such as virtual worlds or social networking websites, the number of users is very important (tens of thousands), hence the amount of data to manage...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...
PPOPP
2009
ACM
14 years 8 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
IPPS
1998
IEEE
13 years 11 months ago
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...