Sciweavers

2300 search results - page 439 / 460
» Maximally Concurrent Programs
Sort
View
EUROCRYPT
2008
Springer
13 years 9 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
USENIX
1994
13 years 8 months ago
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
TreadMarks is a distributed shared memory DSM system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultr...
Peter J. Keleher, Alan L. Cox, Sandhya Dwarkadas, ...
ICECCS
2010
IEEE
196views Hardware» more  ICECCS 2010»
13 years 7 months ago
Implementing and Evaluating a Model Checker for Transactional Memory Systems
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
Woongki Baek, Nathan Grasso Bronson, Christos Kozy...
NETWORK
2008
139views more  NETWORK 2008»
13 years 7 months ago
Composing semantic services in open sensor-rich environments
Consider a scenario where Jane is at an airport. She wants to find a restaurant with healthy food and short waiting time on the way to her terminal. The airport can provide such s...
Jie Liu, Feng Zhao
SIGPLAN
2008
13 years 7 months ago
Single global lock semantics in a weakly atomic STM
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
Vijay Menon, Steven Balensiefer, Tatiana Shpeisman...