Sciweavers

1192 search results - page 85 / 239
» Computing Weakest Readings
Sort
View
ICDCS
2000
IEEE
15 years 7 months ago
Highly Concurrent Shared Storage
1 Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and filesystems highly scalable, reliable ...
Khalil Amiri, Garth A. Gibson, Richard A. Golding
113
Voted
HT
1998
ACM
15 years 7 months ago
Linking by Inking: Trailblazing in a Paper-Like Hypertext
“Linking by inking” is a new interface for reader-directed link construction that bridges reading and browsing activities. We are developing linking by inking in XLibris, a hy...
Morgan N. Price, Gene Golovchinsky, Bill N. Schili...
117
Voted
PODC
1998
ACM
15 years 7 months ago
Probabilistic Byzantine Quorum Systems
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Re...
110
Voted
IPPS
1996
IEEE
15 years 7 months ago
Kiloprocessor Extensions to SCI
To expand the Scalable Coherent Interface's (SCI) capabilities so it can be used to efficiently handle sharing in systems of hundreds or even thousands of processors, the SCI...
Stefanos Kaxiras
123
Voted
PODC
1990
ACM
15 years 7 months ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson