On the correctness of inside-out routing algorithm

Recently, a new routing algorithm called inside-out routing algorithm was proposed for routing an arbitrary permutation in the omega-based 2log(2) N stage networks. This paper discusses the problems of the inside-out routing algorithm and shows that the suggested condition for proper routing in the omega-omega network is insufficient. An extended necessary and sufficient condition for proper routing in the omega-omega network is also suggested. However, it is unknown if any permutation can be successfully routed by a heuristic algorithm which follows the condition. Thus, the rearrangeability of the omega-omega network still remains an open problem.
Publisher
IEEE COMPUTER SOC
Issue Date
1997-07
Language
ENG
Keywords

REARRANGEABLE NETWORKS

Citation

IEEE TRANSACTIONS ON COMPUTERS, v.46, no.7, pp.820 - 823

ISSN
0018-9340
URI
http://hdl.handle.net/10203/4919
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
1997_07_M. K. Kim, H. Yoon, S. R. Maeng_On the Correctness of Inside-Out Routing Algorithm.PDF(69.21 kB)Download
  • Hit : 436
  • Download : 225
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 12 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0