Sciweavers

1063 search results - page 198 / 213
» Order and Negation as Failure
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 1 days ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
OSDI
2008
ACM
16 years 1 days ago
Network Imprecision: A New Consistency Metric for Scalable Monitoring
This paper introduces a new consistency metric, Network Imprecision (NI), to address a central challenge in largescale monitoring systems: safeguarding correctness despite node an...
Navendu Jain, Prince Mahajan, Dmitry Kit, Praveen ...
OSDI
2006
ACM
16 years 1 days ago
HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
James A. Cowling, Daniel S. Myers, Barbara Liskov,...
VLDB
2008
ACM
127views Database» more  VLDB 2008»
15 years 12 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
15 years 12 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo