Sciweavers

292 search results - page 6 / 59
» Objects Shared by Byzantine Processes
Sort
View
ICPADS
2006
IEEE
14 years 2 months ago
Secure and High-Performance Web Server System for Shared Hosting Service
We developed Hi-sap, a web server system that ensures the security in a server and has high performance when processing dynamic content. In existing servers, server embedded progr...
Daisuke Hara, Yasuichi Nakayama
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
14 years 8 days ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
PDPTA
2004
13 years 10 months ago
A Framework for Sharing Voluminous Content in P2P Systems
File-sharing applications remain today the most representative and popular realization of the Peerto-Peer paradigm. Large objects receive an increasing amount of interest in such s...
Dimitrios Tsoumakos, Nick Roussopoulos
FOCS
2005
IEEE
14 years 2 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
PODC
1997
ACM
14 years 27 days ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert