An invariant extension method for system area networks of multicore computational systems. An ideal system network
From MaRDI portal
Publication:544768
DOI10.1134/S0005117910120131zbMath1225.05036OpenAlexW2050288813MaRDI QIDQ544768
Publication date: 16 June 2011
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117910120131
Network design and communication in computer systems (68M10) Combinatorial aspects of block designs (05B05) Deterministic network models in operations research (90B10)
Related Items (5)
Boosting performance of multidimensional tores ⋮ A comparison of system area networks: generalized extended multiring vs flattened butterfly ⋮ An extended multiring of diameter 2 ⋮ Small-diameter system area network composed of small-port routers ⋮ An extended generalized hypercube as a fault-tolerant system area network for multiprocessor systems
Cites Work
- Counterexample to a conjecture of Szymanski on hypercube routing
- Fault-tolerant expansion of system area networks in multiprocessor computer systems
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
- On rearrangeable and non-blocking switching networks
- Routing a permutation in the hypercube by two sets of edge disjoint paths
This page was built for publication: An invariant extension method for system area networks of multicore computational systems. An ideal system network