1192 search results - page 65 / 239 » Computing Weakest Readings |
ISCC
2005
IEEE
15 years 5 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
ICDCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
EDCC
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
SCCC
1997
IEEE
15 years 4 months ago
1997
IEEE
In a database system, read operations are much more common than write operations, and consequently, database systems have been read optimized. As the size of main memory increases...
108
click to vote
NAS
2010
IEEE
14 years 10 months ago
2010
IEEE
—Disk scrubbing periodically scans the contents of a disk array to detect the presence of irrecoverable read errors and reconstitute the contents of the lost blocks using the bui...