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

Design Paradigm for Parallel Algorithms and Realizability of Theoretical Parallel Computer Models

Research Project

Project/Area Number 10205209
Research Category

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

Allocation TypeSingle-year Grants
Research InstitutionNagoya Institute of Technology

Principal Investigator

WADA Koichi  Nagoya Institute of Technology, Professor, 工学部, 教授 (90167198)

Co-Investigator(Kenkyū-buntansha) ITO Nobuhiro  Nagoya Institute of Technology, Research Associate, 工学部, 助手 (40314075)
NAKANO Koji  JAIST, Associate Professor, 情報科学研究科, 助教授 (30281075)
CHEN Wei  Nanzan University, Associate Professor, 数理情報学部, 助教授 (80262955)
Project Period (FY) 1998 – 2000
Project Status Completed (Fiscal Year 2001)
Budget Amount *help
¥10,600,000 (Direct Cost: ¥10,600,000)
Fiscal Year 2000: ¥2,600,000 (Direct Cost: ¥2,600,000)
Fiscal Year 1999: ¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 1998: ¥4,500,000 (Direct Cost: ¥4,500,000)
KeywordsPRAM / reconfigurable mesh / work-preserving algorithms / convex hull / fault-tolerance / radio networks / distributed cooperative algorithms / multi-agents / 耐故障性ルーティング / 光通信網 / 並列アルゴリズム / VHDL / エンベロープ
Research Abstract

The purpose of the research is mainly the followings : (1) We close a gap between theory and practice for parallel computation to implement theoretical parallel computer models. (2) We establish new design paradigm for parallel/distributed algorithms. For (1), we implement PRAM (Parallel Random Access Model), which is one of the most theoretical models and show that it can be realizable by using feasible amount of hardware and its performance is good. We also design some processor such that several hundreds of PRAM processors can be emulated efficiently. Furthermore, we show another method to implement PRAM based on the multithread concept. For (2), we examine new design paradigm to develop parallel/distributed algorithms for geometrical and graph theoretical problems. As for parallel algorithm paradigm, we propose a new method called multi-divided and conquer and we show this method can be applicable for several geometrical problems. As for distributed algorithm paradigm, we show algorithms for several problems related to radio network problems and fault-tolerant network problems. We also some distributed cooperative algorithms by using multi-agents as cooperative design paradigm.

Report

(4 results)
  • 2001 Final Research Report Summary
  • 2000 Annual Research Report
  • 1999 Annual Research Report
  • 1998 Annual Research Report
  • Research Products

    (110 results)

All Other

All Publications (110 results)

  • [Publications] Lin, R., Nakano, K.et al.: "A Scalable VLSI Architecture for Binary Prefix Sums"Proc.of IEEE 11th International Parallel Processing Symposium. 333-337 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K.et al.: "Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels"Proc.of IEEE 11th International Parallel Processing Symposium. 31-35 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada, K., Chen, W.: "Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases"Springer Lecture Notes in Computer Science. 1517. 324-336 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S.: "An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes"IEEE Trans.on Parallel and Distributed Systems. 9. 561-569 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada K.et al.: "Efficient Algorithms for a Mixed k-partition Problem of Graphs without Specifying Bases"Theoretical Computer Science. 201. 233-248 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K.et al.: "Finding the convex hull of discs in Parallel"Journal of Computational Geometry and Applications. 8. 305-319 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hayashi, T., Nakano, K.et al.: "Efficient List Ranking on the Reconfigurable Mesh,with Applications"Theory of Computing Systems. 31. 593-611 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hayashi, T., Nakano, K.et al.: "Optimal Parallel Algorithms for Proximate Points,with Applications"IEEE Trans.on Parallel and Distributed Systems. 9. 1137-1166 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K.et al.: "Randomized O(loglog n)-Round Leader Election Protocols in Packet Radio Networks"Springer Lecture Notes in Computer Science. 1533. 209-218 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hayashi, T., Nakano, K.et al.: "Randomized Initialization Protocols for Packet Radio Networks"Proc.IEEE 13^<th> International Parallel Processing Symposium. 544-548 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada K.et al.: "An optimal fault-tolerant routing for triconnected planar graphs"Springer Lecture Notes in Computer Science. 1665. 191-201 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Ito N.et al.: "Action Decision with Incomplete Information: A Temporal Database Approach"Proc.of 1999 IEEE International Conference on Systems,Man and Cybernetics. 722-727 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N.et al.: "Applying π-calculus to Planning for Reflective Agents"Proc.of IEEE International Conference on Information Intelligence and Systems. 622-629 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Bordim, J.L.et al.: "Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks"Springer Lecture Notes in Computer. 1741. 215-224 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano K.et al.: "Broadcast-Efficient Protocols for Mobile Radio Networks"IEEE Tran.On Parallel and Distributed Systems. 10. 1276-1289 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Nakano, K., Wada, K.: "Parallel Algorithms for Convex Hull Problems and their Paradigm"IEICE Trans.on Fundamentals of Electronics,Communications and Computer Sciences. E83-A. 519-529 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Castanho, C.D., Chen, W., Wada, K.: "A Parallel Algorithm for Constructing Strongly Convex Superhulls of Points"IEICE Trans.on Fundamentals of Electronics,Communications and Computer Sciences. E83-A. 722-731 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Imai M.et al.: "A Hardware Implementation of PRAM and Its Performance Evaluation"Springer Lecture Notes in Computer Science. 1800. 143-148 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada, K., Chen, W.: "Optimal Fault-Tolerant Routings for k-connected Graphs with Smaller Routing Tables"Springer Lecture Notes in Computer Science. 1928. 302-313 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S.: "Randomized Leader Election Protocols for Ad-hoc Networks"SCIROCCO. 253-267 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S.: "Randomized Initialization Protocols for Ad-Hoc Networks"IEEE Trans.on Parallel and Distributed Systems. 11. 749-759 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, D.Z., Chen, W., Wada, K.: "Parallel algorithms for partitioning sorted sets and related problems"Algorithmica. 28. 217-241 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N., Du, X., Ishii, N.: "Applying pi-calculus to dynamically changing plan for agent model"International Journal on Artificial Intelligence Tools. 9. 377-395 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu S.: "Randomized Leader Election Protocols in Radio Networks with no Collision Detection"Springer Lecture Notes in Computer Science. 1969. 362-373 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N., Yamauchi, K.: "Combining Exploitation-Based and Exploration-Based Approach in Reinforcement Learning"Springer Lecture Notes in Computer Science. 1983. 326-331 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S., Zomaya, A.Y.: "Energy-Efficient Deterministic Routing Protocols in Radio Networks"IEEE Trans.on Parallel and Distributed Systems. 12. 544-557 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K.: "Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer"IEICE Trans.on Fundamentals of Electronics,Communications and Computer Sciences. E84-A. 1201-1208 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Castanho, C.D, Chen, W., Wada, K.: "Polynomially fast parallel algorithms for some P-complete problems"IEICE Trans.on Fundamentals of Electronics,Communications and Computer Sciences. E84-A. 1244-1255 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N., Du, X., Ishii, N.: "Agent Model for Dynamically-changing Plan in п-calculus"International Journal of Computers and Applications. (To appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W.et al.: "Constructing A Strongly Convex Superhull of Points"International Journal of Computational Geometry and Applications. (To appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K., Kawaguchi K: "Parallel Robust Algorithms for Constructing Strongly Convex Hulls"Theoretical Computer Science. (To appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K.: "On Computing the Upper Envelope of Segments in Parallel"IEEE Trans.on Parallel and Distributed Systems. (To appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Lin, R., Nakano, K. et al.: "A Scalable VLSI Architecture for Binary Prefix Sums"Proc. of IEEE 11^<th> International Parallel Processing Symposium. 333-337 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano K. et al.: "Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels"Proc. of IEEE 11^<th> International Parallel Processing Symposium. 31-35 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada K. and Chen W.: "Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases"Springer Lecture Notes in Computer Science. Vol. 1517. 324-336 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S.: "An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes"IEEE Trans. on Parallel and Distributed Systems. 9. 561-569 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada K. et al.: "Efficient Algorithms for a Mixed k-partition Problem of Graphs without Specifying Bases"Theoretical Computer Science. 201. 233-248 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K, et al.: "Finding the convex hull of discs in Parallel"Journal of Computational Geometry and Applications. 8. 305-319 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hayashi, T., Nakano, K. et al.: "Efficient List Ranking on the Reconfigurable Mesh, with Applications"Theory of Computing Systems. 31. 593-611 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hayashi, T., Nakano, K. et al.: "Optimal Parallel Algorithms for Proximate Points, with Applications"IEEE Trans. on Parallel and Distributed Systems. 9. 1137-1166 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K. et al.: "Randomized O(loglog n)-Round Leader Election Protocols in Packet Radio Networks"Springer Lecture Notes in Computer Science. Vol. 1533. 209-218 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hayashi. T., Nakano, K. et al.: "Randomized Initialization Protocols for Packet Radio Networks"Proc. IEEE 13^<th> International parallel Processing Symposium. 544-548 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada K. et al.: "An optimal fault-tolerant routing for triconnected planar graphs"Springer Lecture Notes in Computer Science. Vol. 1665. 191-201 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Ito N. et al.: "Action Decision with Incomplete Information : A Temporal Database Approach"Proc. of 1999 IEEE International Conference on Systems, Man and Cybernetics. VI. 722-727 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N. et al.: "Applying π-calculus to Planning for Reflective Agents"Proc. of IEEE International Conference on Information Intelligence and Systems. 622-629 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Bordim, J. L. et al.: "Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks"Springer Lecture Notes in Computer Science. Vol. 1741. 215-224 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano K. et al.: "Broadcast-Efficient Protocols for Mobile Radio Networks"IEEE Tran. On Parallel and Distributed Systems. 10. 1276-1289 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Nakano, K., Wada, K.: "Parallel Algorithms for Convex Hull Problems and their Paradigm"IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences. E83-A. 519-529 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Castanho, C. D., Chen, W., Wada, K.: "A Parallel Algorithm for Constructing Strongly Convex Superhulls of Points"IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences. E83-A. 722-731 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Imai M. et al.: "A Hardware Implementation of PRAM and Its Performance Evaluation"Springer Lecture Notes in Computer Science. Vol. 1800. 143-148 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Wada, K., Chen, W.: "Optimal Fault-Tolerant Routings for k-connected Graphs with Smaller Routing Tables"Vol. 1928. 302-313 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S.: "Randomized Leader Election Protocols for Ad-hoc Networks"SCIROCCO. 253-267 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano. K., Olariu, S.: "Randomized Initialization Protocols for Ad-Hoc Networks"IEEE Trans. on Parallel and Distributed Systems. 11. 749-759 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, D. Z., Chen, W., Wada, K., Kawaguchi K.: "Parallel algorithms for partitioning sorted sets and related problems"Algorithmica. 28. 217-241 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N., Du, X., Ishii, N.: "Applying pi-calculus to dynamically changing plan for agent model"International Journal on Artificial Intelligence Tools. 9. 377-395 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu S.: "Randomized Leader Election Protocols in Radio Networks with no Collision Detection"Springer Lecture Notes in Computer Science. Vol. 1969. 362-373 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata, K., Ito, N., Yamauchi, K., Ishii, N.: "Combining Exploitation-Based and Exploration-Based Approach in Reinforcement Learning"Springer Lecture Notes in Computer Science. Vol. 1983. 326-331 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Nakano, K., Olariu, S., Zomaya, A. Y.: "Energy-Efficient Deterministic Routing Protocols in Radio Networks"IEEE Trans. on Parallel and Distributed Systems. 12. 544-557 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K.: "Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer"IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences. E84-A. 1201-1208 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Castanho, C.D, Chen, W., Wada, K., Fujiwara, A.: "Polynomially fast parallel algorithms for some P-complete problems"IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences. E84-A. 1244-1255 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Iwata. K., Ito, N., Du, X., Ishii, N.: "Agent Model for Dynamically-changing Plan in π-calculus"International Journal of Computers and Applications. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen W., Deng, X. W., Wada, K., Kawaguchi, K.: "Constructing A Strongly Convex Superhull of Points"International Journal of Computational Geometry and Applications. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K., Kawaguchi K.: "Parallel Robust Algorithms for Constructing Strongly Convex Hulls"Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chen, W., Wada, K.: "On Computing the Upper Envelope of Segments in Parallel"IEEE Trans. on Parallel and Distributed Systems. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Castanho,C.D. et al.: "(1) A Parallel Algorithm for Constructing Strongly Convex Superhulls of Points"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. E83-A,4. 722-731 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Imai,M. et al.: "(2) A Hardware Implementation of PRAM and Its Performance Evaluation"Lecture Notes in Computer Science. 1335. 143-148 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Cui,J. et al.: "(3) Multithreaded Parallel Computer Model with Performance Evaluation"Lecture Notes in Computer Science. 1800. 155-160 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Wada,K.,Chen,W.: "(4) Optimal Fault-Tolerant Routings for $k$-connected Graphs with Smaller Routing Tables"Lecture Notes in Computer Science. 1928. 302-313 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Nakano,K,Olariu,S.: "(5) Randomized Leader Election Protocols for Ad-hoc Networks"Proc.of 7th International Colloquium on Structural Information & Communication Complexity. 253-267 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Wada,K.: "(6) Optimal Fault-Tolerant Routings on Surviving Route Graph Model"Proc.Of International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet. 1-10 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Nakano,K,Olariu,S.: "(7) Randomized Initialization Protocols for Ad-Hoc Networks"IEEE Trans.on Parallel and Distributed Systems. 11,7. 749-759 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Nakano,K,Olariu,S.: "(8) Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with no Collision Detection"IEEE Trans.on Parallel and Distributed Systems. 11,8. 851-863 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Bordim,J. et al.: "(9) Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks"IEICE Trans.Fundamentals. E83-A,9. 1796-1803 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Nakano,K,Olariu S.: "(10) Randomized Leader Election Protocols in Radio Networks with no Collision Detection"Proc.Of International Symposium on Algorithms and Computation (ISAAC00). 362-373 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Nakano,K.,Olariu,S.,Zomaya,A.Y.: "(11) Energy-Efficient Deterministic Routing Protocols in Radio Networks"IEEE Trans.on Parallel and Distributed Systems. (to appear). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Castanho,C.D. et al.: "(12) Polynomially fast parallel algorithms for some P-complete problems"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. (To appear). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Chen,W.,Wada,K.: "(13) Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer"IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences. (To appear). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Chen,W. et al.: "(14) Constructing A Strongly Convex Superhull of Points"International Journal of Computational Geometry and Applications. (To appear). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] Chen,W.,Wada,K.,Kawaguchi K.: "(15) Parallel Robust Algorithms for Constructing Strongly Convex Hulls"Theoretical Computer Science. (To appear). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] {Bordim,J.L.,Hayashi,T.,Nakano,K.: "(16) A Tool for Algorithm Visualization on the Reconfigurable Mesh"VLSI design. (To appear).

    • Related Report
      2000 Annual Research Report
  • [Publications] 中本聡,尾関博昭,陳慰,和田幸一: "(17)DNA計算におけるグラフ問題の符号化について"電子情報通信学会技術研究報告. 100,144. 49-56 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 服部真充,伊藤暢浩,陳慰,和田幸一: "(18)分散環境に適した行列積アルゴリズムについて"電子情報通信学会技術研究報告. 100,144. 65-72 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 伊藤,中川,杜,石井: "(1)EAMMO記述処理系によるサッカーエージェントの設計"電気学会論文誌C. 119-C,1. 28-36 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Nakano, K., Olariu, S., Zomaya, A.: "(2)A Time-Optimal Solution for the Path Cover Problems on Cographs"Proc. IEEE 13th International Parallel Processing Symposium. 26-30 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Lin, R. et al.: "(3)An Efficient VLSI Architecture Parallel Prefix Counting with Domino Logic"Proc. IEEE 13th International Parallel Processing Symposium. 273-277 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Hayashi, T. et al.: "(4)Randomized Initialization Protocols for Packet Radio Networks"Proc. IEEE 13th International Parallel Processing Symposium. 544-548 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Wada, K., Nagata, Y., Chen, W.: "(5)An optimal fault-tolerant routing for triconnected planar graphs"Lecture Notes in Comuter Science. 1665. 191-201 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Ito, N. et al.: "(6)Action Decision with Incomplete Information : A Temporal Database Approach"Proc. of 1999 IEEE International Conference on Systems, Man and Cybernetics. VI. 722-727 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Bordim, J. et al.: "(7)Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks"International Symposium on Algorithms and Computtion. 215-224 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Nakano, K. et al.: "(8)Broadcast-Efficient Protocols for Broadcast Networks with Few Channels"IEEE Trans. on Parallel and Distributed Systems. (to appear). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Chen, W., Nakano, K., Wada, K.: "(9)Parallel Algorithms for Convex Hull Problems and their Paradigm"IEICE Trans. on Information and Systems. (to appear). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Chen, W. et al.: "(10)Constructing A Strongly Convex Superhull of Points"International Journal of Computational Geometry and Applications. (to appear). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Chen, D. Z. et al.: "(11)Parallel algorithms for partitioning sorted sets and related problems"Algorithmica. (to appear). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Castanho, C. D. et al.: "(12)A Parallel Algorithm for Constructing Strongly Convex Superhulls of points"IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences. (to appear). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Imai, M. et al.: "(13)A Hardware Implementation of PRAM and its Performance Evaluation"Workshop on Advances in Parallel and Districted Computational Models, Lecture Notes in Comuter Science. (to appear). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] R.Lin,K.Nakano et al.: "A Scalable VLSI architecture for binary prefix sums" Proc.of IEEE 11th Int.Parallel Processing Symposium. 333-337 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Nakano et al.: "Broadcast-Efficient algorithms on the coarse-grain broadcast Communication model with few channels" Proc.of IEEE 11th Int.Parallel Processing Symposium. 31-35 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Wada,W.Chen: "Linear algorithms for a k-partition problem of planar graphs without specifying bases" Lecture Notes in Computer Science Graph-Thetetic Concepts Computer Science. 1517. 324-336 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Nakano,S.Olariu: "An efficient algorithm for row minima compatations on basic reconfigurable meshes" IEEE Trans.on Parallel and Distributed Systems. 9,6. 561-569 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Wada et al.: "Efficient algorithms for a mixed k-partition problem of graphs without specifying bases" Theoretical Computer Science. 201,1-2. 233-248 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] W.Chen,K.Wada: "On computing the apper envelope of segments in parallel" Proc.of 27th Int.Conf.on Parallel Processing. 253-260 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] W.Chen,K.Wada et al.: "Finding the conuex hull of diocs in parallel" J.of Computational Geometry and Applications. 8,3. 305-319 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] T.Hayashi,K.Nakano et al.: "Efficient list ranking on the reconfigurable mesh,with applications" Theory of Computing Systems. 31. 593-611 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] T.Hayashi,K.Nakano et al.: "Optinal parallel algorithms for proximate points,with applications" IEEE Trans.on Parallel and Distributed Systems. 9,12. (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] T.Hayashi,K.Nakano et al.: "An O(loglogn)^2)time convex hull algorithm on reconfigurable meshes" IEEE Trans.on Parallel and Distributed Systems. 9,12. (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] K.Nakano et al.: "Randomized O(loglogn)-round leader election protocols in packet radio networks" Proc.of Int.Sym.on Algorithms and Compatations. (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] W.Chen,K.Wada: "Multi-level divide-and-conquer:method for designing efficient parallel algorithms" Proc.of Int.Conf.on Parallel and Distributed Compaty and Networks. 555-560 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] D.Z.Chen,W.Chen,K.Wada et al.: "Parallel algorithms for partitioning sorted sets and related problems" Algorithmica. (to appear). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] C.D.Castanho,W.Chen,K.Wada: "A parallel algorithm for constructing strongly convex superhulls of points" 情報基礎理論ワークショップ(夏のLAシンポジウム). 62-67 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 今井,早川,河中,陳,和田: "PRAMのハードウェア化に関する設計と実現" 電子情報通信学会コンピュテーション研究会資料. (発表予定). (1999)

    • Related Report
      1998 Annual Research Report

URL: 

Published: 1998-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi