𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized multi-stage connection networks

✍ Scribed by G. M. Masson; B. W. Jordan Jr.


Publisher
John Wiley and Sons
Year
1972
Tongue
English
Weight
954 KB
Volume
2
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis


This paper develops multi-stage connection networks i n which each input terminaZ can be connected t o any number o f output terminals. strict29 nonblocking or are rearrangeable. rithms and upper bounds on the required number of moves are deveZoped and it is shown that such netuorks have fewer crosspoints than the product of input and output t e m i n a l s f o r a sufficientzy large number of input and output terminaZs.

Conditions are given such that these networks are Rearrangement algo-


πŸ“œ SIMILAR VOLUMES


Weighted multi-connected loop networks
✍ Γ–ystein J. RΓΆdseth πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 487 KB

Given relatively prime integers N,a~,...,ak, a multi-connected loop network is defined as the directed graph with vertex set Z/NZ = {0, 1 ..... N -1}, and directed edges i ~ r :-i+ aj (mod N). If each edge i ---, i+ aJ is given a positive real weight wj for j = 1 ..... k, then we have a weighted mul

Multi-stage energy generation
πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 55 KB

Assignee: Freeplay Market Development, UK A power system comprises a generator for generating electrical current, a rechargeable electrical storage device connectable to a load, and a source of non-electrical energy for driving the generator, the arrangement being that energy output by the generator