✦ LIBER ✦

A combinatorial analysis of subcube reliability in hypercubes

✍ Scribed by Chang, Y.; Bhuyan, L.N.

Book ID: 119772340
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 425 KB
Volume: 44
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.392856

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning Subgraphs of a Hypercube V: Spa

Spanning Subgraphs of a Hypercube V: Spanned Subcubes

✍ FRANK HARARV; MARTIN LEWINTER 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Efficient determination of maximum incom

Efficient determination of maximum incomplete subcubes in hypercubes with faults

✍ Nian-Feng Tzeng; Guanghua Lin 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 799 KB

Job preemption, fast subcube compaction,

Job preemption, fast subcube compaction, or waiting in hypercube systems? A selection methodology

✍ Salma A. Ghoneim; Hossam M.A. Fahmy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Combinatorial Reliability Analysis of Mu

Combinatorial Reliability Analysis of Multiprocessor Computers

✍ Hwang, Kai; Chang, Tian-Pong 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 835 KB

Split sequence generation algorithms for

Split sequence generation algorithms for efficient identification of operational subcubes in faulty hypercubes

✍ Ahmed El-Amawy; Ramachander Raja 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 853 KB

An approximation scheme for scheduling i

An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension

✍ Y. Kopidakis; V. Zissimopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 518 KB

We study the problem of scheduling independent jobs in a hypercube where jobs are executed in subcubes of various dimensions. The problem being NP-complete, several approximation algorithms based on list scheduling have been proposed, having approximation ratio of order of 2. In this paper, a linear