The search functionality is under construction.

Author Search Result

[Author] Alauddin Y. ALOMARY(3hit)

1-3hit
  • PEAS-I: A Hardware/Software Codesign System for ASIP Development

    Jun SATO  Alauddin Y. ALOMARY  Yoshimichi HONMA  Takeharu NAKATA  Akichika SHIOMI  Nobuyuki HIKICHI  Masaharu IMAI  

     
    PAPER-Computer Aided Design (CAD)

      Vol:
    E77-A No:3
      Page(s):
    483-491

    This paper describes the current implementation and experimental results of a hardware/software codesign system for ASIP (Application Specific Integrated Processor) development: the PEAS-I System. The PEAS-I system accepts a set of application programs written in C language, associated data set, module database, and design constraints such as chip area and power consumption. The system then generates an optimized CPU core design in the form of an HDL as well as a set of application program development tools such as a C compiler, an assembler and a simulator. Another important feature of the PEAS-I system is that the system is able to give accurate estimations of chip area and performance before the detailed design of the ASIP is completed. According to the experimental results, the PEAS-I system has been found to be highly effective and efficient for ASIP development.

  • An Integer Programming Approach to Instruction Set Selection Problem

    Alauddin Y. ALOMARY  Masaharu IMAI  Jun SATO  Nobuyuki HIKICHI  

     
    PAPER-VLSI Design Technology

      Vol:
    E76-A No:10
      Page(s):
    1849-1857

    The performance of ASIPs (Application Specific Integrated Processors) is heavily affected by the design of their instruction set architecture. In order to maximize the performance of ASIP, it is essential to design an architecture that has an optimum instruction set. This paper descibes a new method that automates the design of optimum instruction set of ASIP. This method solves the Instruction set implementation Method Selection Problem(IMSP). IMSP is to be solved in the instruction set architecture design. Frse, the IMSP is formalized as an integer programming problem, which is to maximize the perfomance of the CPU under the constraints of chip area and power consumption. Then, a branch-and-bound algorithm to solve IMSP is described. According to the experimental results, the proposed algorithm is quite effective and efficient in solving the IMSP. The presented method automates a complex part of the ASIP chip design and is also a good design tool that enables designer to predict the performance of their design before completion.

  • An ASIP Instruction Set Optimization Algorithm with Functional Module Sharing Constraint

    Alauddin Y. ALOMARY  Masaharu IMAI  Nobuyuki HIKICHI  

     
    PAPER

      Vol:
    E76-A No:10
      Page(s):
    1713-1720

    One of the most interesting and most analyzed aspects of the CPU design is the instruction set design. How many and which operations to be provided by hardware is one of the most fundamental issues relaing to the instruction set design. This paper describes a novel method that formulates the instruction set design of ASIP (an Application Specific Integrated Processor) using a combinatorial appoach. Starting with the whole set of all possible candidata instructions that represesnt a given application domain, this approach selects a subset that maximizes the performance under the constraints of chip area, power consumption, and functional module sharing relation among operations. This leads to the efficient implementation of the selected instructions. A branch-and-bound algorithm is used to solve this combinatorial optimization problem. This approach selects the most important instructions for a given application as well as optimizing the hardware resources that implement the selected instructions. This approach also enables designers to predict the perfomance of their design before implementing them, which is a quite important feature for producing a quality design in reasonable time.