Sciweavers

2771 search results - page 307 / 555
» Using Computational Reflection in Optimistic Distributed Sim...
Sort
View
IPPS
1999
IEEE
15 years 10 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito
ICDCS
1998
IEEE
15 years 10 months ago
A Suite of Database Replication Protocols based on Group Communication Primitives
This paper proposes a family of replication protocols based on group communication in order to address some of the concerns expressed by database designers regarding existing repl...
Bettina Kemme, Gustavo Alonso
HPCA
1997
IEEE
15 years 10 months ago
Design Issues and Tradeoffs for Write Buffers
Processors with write-through caches typically require a write buffer to hide the write latency to the next level of memory hierarchy and to reduce write traffic. A write buffer ...
Kevin Skadron, Douglas W. Clark
ICDCS
1993
IEEE
15 years 10 months ago
Providing Performance Guarantees in an FDDI Network
A network subsystem supporting a continuous media file system must guarantee a minimum throughput, a maximum delay, and a maximum jitter. We present a transport protocol that pro...
Darrell D. E. Long, Carol Osterbrock, Luis-Felipe ...
ICPP
1993
IEEE
15 years 10 months ago
Fault Tolerant Subcube Allocation in Hypercubes
- The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subc...
Yeimkuan Chang, Laxmi N. Bhuyan