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

Research on the execution environment for algorithms on a powerful model BSR^+ of parallel computation

Research Project

Project/Area Number 14580398
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionKyushu Sangyo University

Principal Investigator

XIANG Limin  Kyushu Sangyo University, Faculty of Information Science, Associate Professor, 情報科学部, 助教授 (60341294)

Co-Investigator(Kenkyū-buntansha) USHIJIMA Kazuo  Kyushu Sangyo University, Faculty of Information Science, Professor, 情報科学部, 教授 (40037750)
Project Period (FY) 2002 – 2003
Project Status Completed (Fiscal Year 2003)
Budget Amount *help
¥2,600,000 (Direct Cost: ¥2,600,000)
Fiscal Year 2003: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2002: ¥1,700,000 (Direct Cost: ¥1,700,000)
KeywordsParallel Computation / Model of Parallel Computation / BSR / Parallel Algorithms / PRAM / BROADCAST Instruction
Research Abstract

The PRAM (Parallel Random Access Machine) is a popular model of parallel computation. In the variants of PRAM, BSR^+ is the most powerful in computation. Based on the model BSR (Broadcasting with Selective Reduction), BSR^+ was proposed by the head investigator, etc., in IEEE Transactions on Parallel and Distributed Systems (vol. 10, no. 8) in 1999. Along with the LAN being made universal and the PC being of low cost, it is possible to build an execution environment for algorithms on BSR^+ model of parallel computation by use of several PC's in laboratory. One PC used as the Interconnection Unit and the Control Unit, and P (4 【less than or equal】 P 【less than or equal】 6) PC's as the P processors, the function of BSR^+ was implemented in this research. The number P of processors is a constant in any physical parallel computer, but the size N is a variable of the problem in many applications. By the principle that the design of algorithm is independent on the physical computer, the function transforming N into P should be supplied in the environment of parallel computation. Built on the LAN, the execution environment with the transforming function was tested and verified for algorithms on BSR^+ model of parallel computation in this research. The environment that BSR^+ algorithms can be executed on is helpful to the research on parallel algorithms and to the application of parallel algorithms.

Report

(3 results)
  • 2003 Annual Research Report   Final Research Report Summary
  • 2002 Annual Research Report
  • Research Products

    (13 results)

All Other

All Publications (13 results)

  • [Publications] L.Xiang, K.Ushijima, Jianjun Zhao: "An O(1) Time Algorithm for Generating Restricted Permutations"INFORMATION. 6・4. 417-426 (2003)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] Cunwei Lu, Limin XIANG: "Optimal intensity-modulation projection technique for three-dimensional shape measurement"Applied Optics. 42・23. 4649-4657 (2003)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] J.Zhao, H.Yang, L.Xiang, B.Xu: "Change Impact Analysis to Support Architectural Evolution"Journal of Software Maintenance and Evolution : Research and Practice. 14・5. 317-333 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] L.Xiang, K.Ushijima, J.Zhao: "Time Optical n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR"Parallel Processing Letters. 12・3&4. 365-374 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] L.Xiang, K.Ushijima, Jianjun Zhao: "An 0(1) Time Algorithm for Generating Restricted Permutations"INFORMATION. 6-4. 417-426 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] Cunwei LU, Limin XIANG: "Optimal intensity-modulation projection technique for three-dimensional shape measurement"Applied Optics. 42-23. 4649-4657 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] J.Zhao, H.Yang, L.Xiang, B.Xu: "Change Impact Analysis to Support Architectural Evolution"Journal of Software Maintenance and Evolution: Research and Practice. 14-5. 317-333 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] L.Xiang, K.Ushijima, J.Zhao: "Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR"Parallel Processing Letters. 12-3&4. 365-374 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] L.Xiang, K.Ushijima, etc.: "O(1) Time Algorithm On BSR for Constructing a Random Binary Search Tree"Proc.PDCAT 2003, IEEE Press. 599-602 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] Cunwei LU, Limin XIANG: "Optimal intensity-modulation projection technique for three-dimensional shape measurement"Applied Optics. 42・23. 4649-4657 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] L.Xiang, K.Ushijima, Jianjun Zhao: "An O(1) Time Algorithm for Generating Restricted Permutations"INFORMATION. 6・4. 417-426 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] L.Xiang, K.Ushijima, J.Zhao: "Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR"Parallel Processing Letters. 12・3&4. 365-374 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] L.Xiang, K.Ushijima: "O(1) Time Algorithm on BSR for Computing Convex Hull"Proceedings of the 14^<th> International Conference PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS. 143-146 (2002)

    • Related Report
      2002 Annual Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi