𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling of independent jobs in star graph networks

✍ Scribed by S. Latifi; P.K. Srimani

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
679 KB
Volume
32
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Wormhole broadcast in star graph network
Wormhole broadcast in star graph networks
✍ Shahram Latifi; Pradip K. Srimani πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 175 KB

We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is deri

Conditional Fault Diameter of Star Graph
Conditional Fault Diameter of Star Graph Networks
✍ Yordan Rouskov; Shahram Latifi; Pradip K. Srimani πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 300 KB

It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optimally fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults. We investigate star graphs under the conditions of forbidden faulty set

An optimal schedule time of a job shop-l
An optimal schedule time of a job shop-like disjunctive graph
✍ S. Ashour; K. Y. Chiu; T. E. Moore πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 812 KB

## Abstract This paper considers the shop scheduling problem which involves both job precedence and machine interference constraints. Based on the graph‐theoretical representation of the problem, a branch‐and‐bound algorithm is proposed for implicitly producing an optimal schedule such that the sch