✦ LIBER ✦

Problems with a node of computer networks

✍ Scribed by Vukašin P. Masnikosa

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 684 KB
Volume: 10
Category: Article
ISSN: 0166-3615
DOI: 10.1016/0166-3615(88)90049-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bitonic sort on a network computer with

Bitonic sort on a network computer with a node failure

✍ Hiromi Kobayashi; Hidetake Funaki; Hiroaki Yamamaoto; Hiroo Yamaura 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

## Abstract Massively parallel computers are being realized for aiming at high performance. Bitonic sort is an efficient algorithm for network computers. But generally, it is impossible to use a bitonic sort algorithm on a network computer with a node failure. This paper presents a fault‐tolerant

A synchronization algorithm for processe

A synchronization algorithm for processes with dynamic priorities in computer networks with node failures

✍ A. Goscinski 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Solution of the routing problem through

Solution of the routing problem through a network by a matrix method with auxiliary nodes

✍ M. Môri; T. Nishimura 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 968 KB

Solution of the routing problem through

Solution of the routing problem through a network by matrix method with auxiliary nodes

📂 Article 📅 1967 🏛 Elsevier Science ⚖ 95 KB

Location of central nodes in time varyin

Location of central nodes in time varying computer networks

✍ Ariel Orda; Raphael Rom 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 766 KB

Polyhedral structure of the 4-node netwo

Polyhedral structure of the 4-node network design problem

✍ Yogesh K. Agarwal 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB