Computing in the RAIN: A reliable array of independent nodes

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 2, 2001, Pages 99-113

  Bohossian, Vasken ^b   Fan, Chenggong C ^a,c   LeMahieu, Paul S ^c   Riedel, Marc D ^c   Xu, Lihao ^a,d   Bruck, Jehoshua ^a,c  

^a IEEE

^b Rainfinity   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^d WASHINGTON UNIVERSITY   (United States)

Author keywords

Cluster computing; Data storage; Distributed computing; Fault tolerance; Interconnection networks; Scalable architectures

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER OPERATING SYSTEMS; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; INTERFACES (COMPUTER); INTERNET; NETWORK PROTOCOLS; SERVERS; SPACE FLIGHT;

CLUSTER COMPUTING; OFF THE SHELF COMPONENTS; RELIABLE ARRAY OF INDEPENDENT NODES; SCALABLE ARCHITECTURES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035248587     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.910866     Document Type: Article

References (57)

1. The Totem single-ring ordering and membership protocol
2. A case for NOW (Networks of Workstations)
3. BEOWULF: A parallel workstation for scientific computation
4. Application level fault tolerance in heterogeneous networks of workstations
5. Another advantage of free choice: Completely asynchronous agreement protocols
6. Reliability through consistency
7. EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures
8. Chapter on array codes
9. Myrinet: A gigabit per second local area network
10. A general class of invulnerable graphs
11. Circulants and their connectivities
12. Reliable circulant networks with minimum transmission delay
13. Fault-tolerant meshes and hypercubes with minimal numbers of spares
14. On the impossibility of group membership
15. Unreliable failure detectors for reliable distributed systems
16. Raid-high-performance, reliable secondary storage
17. Dome: Parallel programming in a distributed computing environment
18. The transis approach to high availability cluster communication
19. The design of the transis system
20. On designing and reconfiguring K-fault-tolerant tree architectures
21. Designing fault-tolerant systems using auto-morphisms
22. Some practical issues in the design of fault-tolerant multiprocessors
23. Storage strategies for fault-tolerant video servers
24. Manetho-transparent rollback-recovery with low overhead, limited rollback, and fast output commit
25. The scotch parallel storage systems
26. A survey of array error control codes
27. Impossibility of distributed consensus with one faulty process
28. A leader election protocol for fault recovery in asynchronous fully-connected networks
29. On the possibility of group membership protocols
30. A high-performance, portable implementation of the MPI message passing interface standard
31. The zebra striped network file system
32. A graph model for fault-tolerant computing systems
33. (N,K) concept fault tolerance
34. Connective fault tolerance in multiple-bus systems
35. Fault-tolerant switched local area networks
36. Consistent history link connectivity protocol
37. Totem: A fault-tolerant multicast group communication system
38. NASA-funded software aids reliability
39. A new look at membership services
40. Faster checkpointing with N+1 parity
41. Tolerating faults in counting networks
42. Automatic reconfiguration in autonet
43. A case study: Automatic reconfiguration in autonet
44. CODA-A highly available file system for a distributed workstation environment
45. The SunSCALR framework for internet servers
46. MPI: The complete reference
47. Optimal information dispersal for increasing the reliability of a distributed service
48. PVM: A framework for parallel distributed computing
49. The PVM concurrent computing system: Evolution, experiences, and trends
50. Streaming RAID: A disk array management system for video files
51. Horus: A flexible group communication system
52. Low density MDS codes and factors of complete graphs
53. X-code: MDS array codes with optimal encoding
54. Low density MDS codes and factors of complete graphs