• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2001 Fiscal Year Final Research Report Summary

Development of fast routing algorithms using adaptation and randomization

Research Project

Project/Area Number 10205215
Research Category

Grant-in-Aid for Scientific Research on Priority Areas (B)

Allocation TypeSingle-year Grants
Research InstitutionKyoto University

Principal Investigator

IWAMA Kazuo  Kyoto University, Graduate School of Informatics, Professor, 情報学研究科, 教授 (50131272)

Co-Investigator(Kenkyū-buntansha) IWAMOTO Chuzo  Hiroshima University, Faculty of Engineering, Associate Professor, 工学部, 助教授 (60274495)
MIYAZAKI Shuichi  Kyoto University, Graduate School of Informatics, Research Associate, 情報学研究科, 助手 (00303884)
OKABE Yasuo  Kyoto University, Graduate School of Informatics, Associate Professor, 情報学研究科, 助教授 (20204018)
KAWAKUBO Kazuo  Fukuyama University, Faculty of Engineering, Associate Professor, 工学部, 助教授 (10186067)
Project Period (FY) 1998 – 2000
Keywordsmesh computers / permutation routing / oblivious routing / adaptation / randomization / queue size / bit reversal permutation
Research Abstract

Our model in this research is a distribution of N processors on a √<N>×√<N> mesh, where each processor is connected with four neighboring processors. Each processor has a constant queue size, namely, a processor can hold only a constant number of packets. At a unit step, each processor can send a packet to one of four neighbors.
We treat a permutation routing problem on the above model. In this problem, each processor initially holds a packet to be sent to another processor. No two processors hold packets whose destination is the same processor. Performance of algorithms is evaluated by the worst case completion time. Although the diameter of mesh is 2√<N>, the best known algorithm so far achieved only O(N) time, and it had been a long open problem whether it can be improved. In 1998, our research group developed an algorithm whose time complexity is O(N^<0.75>).
In this research, we improved the upper bound. First, we developed an O(√<N>) time algorithm using bit reversal permutation. However, constant coefficient was as big a 1000. To reduce it, we refined the bit reversal permutation and obtained a (2.954+ε)√<N> time algorithm.

  • Research Products

    (42 results)

All Other

All Publications (42 results)

  • [Publications] Halldorsson, M., et.al.: "Online Independent Sets"Theoretical Computer Science. (掲載予定).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asahiro, Y., et.al.: "Complexity of Finding Dense Subgraphs"Discrete Applied Mathematics. (掲載予定).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Miyano, E.: "An O(√<N>)Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size"Journal of Algorithms. (掲載予定).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Tamaki, S.: "Exploiting Partial Knowledge of Satisfying Assignments"Proc.Workshop on Algorithm Engineering. 118-128 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., et.al.: "Separating Oblivious and Non-Oblivious BPs"Proc.Computing and Combinatorics Conference. 28-38 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Manlove, D.et.al.: "Hard Variants of Stable Marriage"Theoretical Computer Science. (掲載予定).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Miyano, E.: "A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes"J.Algorithms. (掲載予定).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asano, T., et.al.: "Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits"Proc.ISAAC2000. 204-215 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., et.al.: "Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM"Proc.Workshop on Algorithm Engineering. 123-134 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., et.al.: "A Family of NFA's which Need 2^n α Deterministic States"Proc.MFCS 2000. 436-445 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Miyano, E.: "A(2.954+e)n Oblivious Routing Algorithm on 2D Meshes"Proc.ACM SPAA 2000. 186-195 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Kawachi, A.: "Brief Announcement: Compact Routing with Stretch Factor of Less Than Three"Proc.ACM PODC 2000. 337-337 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asahiro, Y., et.al.: "Greedily Finding a Dense Subgraph"J.Algorithms. 34. 203-221 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., et.al.: "Tight Bounds on the Number of States of DFA's That Are Equivalent to n-State NFA's"Theoretical Computer Science. 237. 485-494 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., et.al.: "Efficient randomized routing algorithms on the two-dimensional mesh of buses"Theoretical Computer Science. (掲載予定).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Miyano, E.: "Oblivious Routing Algorithms on the Mesh of Buses"J.Parallel and Distributed Computing. 60. 137-149 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Miyazaki, S.: "Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle"Proc.ISAAC'99. 133-142 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Yonezawa, K.: "Using Generalized Forecasts for Online Currency Conversion"Proc.COCOON'99. 409-421 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., Miyano, E.: "Multipacket routing on 2-D meshes and its applications to fault-tolerant routing"Proc.ESA'99. 53-64 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwama, K., et.al.: "Stable Marriage with Incomplete Lists and Ties"Proc.ICALP'99. 443-452 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Amano, M., Iwama, K.: "Undecidability on Quantum Finite Automata"Proc.STOC'99. 368-375 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 岩間 一雄: "アルゴリズム理論入門"昭晃堂. 185 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Halldorsson, M., Iwama, K., Miyazaki, S. and Taketomi S.: "Online Independent Sets,"Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Asahiro, Y., Hassin, R. and Iwama, K.: "Complexity of Finding Dense Subgraphs"Discrete Applied Mathematics. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K. and Miyano, E.: "An 0(√<N>) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size"Journal of Algorithms. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K. and Tamaki, S.: "Exploiting Partial Knowledge of Satisfying Assignments,"Proc. WAE01. 118-128 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., Okabe, Y. and Takase, T.: "Separating Oblivious and Non-Oblivious BPs,"Proc. COCOON01. 28-38 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Manlove, D., Irving, R., Iwama, K., Miyazaki, S., and Morita, Y.,: "Hard Variants of Stable Marriage"Theoretical Computer Science. (to appear.).

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K. and Miyano, E.: "A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes,"J. Algorithms. (to appear.).

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Asano, T., Halldorsson, M., Iwama, K. and Matsuda, T.: "Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits,"Proc. ISAAC2000. 204-215 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., Kawai, D., Miyazaki, S., Okabe, Y. and Umemoto, J.: "Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM"Proc. Workshop on Algorithm Engineering. 123-134 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., Matsuura, A. and Paterson M.: "A Family of NFA's which Need 2^nα Deterministic States,"Proc. MFCS 2000. 436-445 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K. and Miyano, E.: "A (2.954 + e)n Oblivious Routing Algorithm on 2D Meshes"Proc. ACM SPAA 2000. 186-195 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., and Kawachi, A.: "Brief Announcement : Compact Routing with Stretch Factor of Less Than Three,"Proc. ACM PODC 2000. 337 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., Kambayashi, Y. and Takaki, K.: "Tight Bounds on the Number of States of DFA's That Are Equivalent to n-State NFA's"Theoretical Computer Science. 237. 485-494 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., Miyano, E., Tajima, S., and Tamaki, H.: "Efficient randomized routing algorithms on the two-dimensional mesh of buses"Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., and Miyano, E.: "Oblivious Routing Algorithms on the Mesh of Buses"J. Parallel and Distributed Computing. 60. 137-149 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., and Miyazaki, S.: "Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle"Proc. ISAAC'99. 133-142 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., and Yonezawa, K.: "Using Generalized Forecasts for Online Currency Conversion"Proc. COCOON'99. 409-421 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., and Miyano, E.: "Multipacket routing on 2-D meshes and its applications to fault-tolerant routing,"Proc. ESA'99. 53-64 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Iwama, K., Miyazaki, S., Manlove, D., and Morita, Y.: "Stable Marriage with Incomplete Lists and Ties,"Proc ICALP'99. 443-452 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Amano, M., and Iwama, K.: "Undecidability on Quantum Finite Automata,"Proc. STOC'99. 368-375 (1999)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2003-09-17  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi