Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
From MaRDI portal
Publication:3682403
DOI10.1109/TC.1983.1676335zbMath0566.94022MaRDI QIDQ3682403
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
parallel computationparallel computerpacket switching networksshuffle-exchange graphd-way shuffle graphs
Related Items (20)
Towards a better understanding of pure packet routing ⋮ On some decision questions concerning pushdown machines ⋮ Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ A representation of trees by languages. II ⋮ Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations ⋮ The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine ⋮ On the decidability of equivalence for deterministic pushdown transducers ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ Deterministic one-counter automata ⋮ A result on the equivalence problem for deterministic pushdown automata ⋮ The inclusion problem for simple languages ⋮ A direct algorithm for checking equivalence of LL(k) grammars ⋮ Economy of description by parsers, DPDA's, and PDA's ⋮ A representation of trees by languages. I ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ A note on non-singular deterministic pushdown automata ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ New families of non real time dpda's and their decidability results ⋮ Some results on subclass containment problems for special classes of dpda's related to nonsingular machines ⋮ An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
This page was built for publication: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
