✦ LIBER ✦

Real-time fault-tolerant hypercube multicomputer

✍ Scribed by Izadi, B.A.; Ozguner, F.

Book ID: 114448521
Publisher: The Institution of Electrical Engineers
Year: 2002
Tongue: English
Weight: 167 KB
Volume: 149
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:20020720

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly fault-tolerant hypercube multicom

Highly fault-tolerant hypercube multicomputer

✍ Izadi, B.A.; Ozguner, F.; Acan, A. 📂 Article 📅 1999 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 664 KB

Fault tolerant wormhole routing in hyper

Fault tolerant wormhole routing in hypercube multicomputers

✍ C.S. Yang; Y.M. Tsai; R.L. Wu 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 348 KB

Fault-tolerant hypercube multiprocessors

✍ Latifi, S. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 574 KB

Towards Real-Time Fault-Tolerant CORBA M

Towards Real-Time Fault-Tolerant CORBA Middleware

✍ Aniruddha S. Gokhale; Balachandran Natarajan; Douglas C. Schmidt; Joseph K. Cros 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 702 KB

Fault-tolerant wormhole routing for hype

Fault-tolerant wormhole routing for hypercube networks

✍ Jau-Der Shih 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 145 KB

We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same

Fault-tolerant cycle embedding in the hy

Fault-tolerant cycle embedding in the hypercube

✍ Jung-Sheng Fu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Almost all the previous fault-tolerant cycle embedding research could not tolerate the faulty nodes more than the degree of the network. In this paper, we have broken this limitation: a recursive method of embedding a longest cycle into an n-dimensional hypercube (n-cube), which can tolerate atmost