2002•Unpublished venueRequires access

An efficient technique for exploring register file size in ASIP synthesis

Manoj Kumar Jain, S. Balakrishnan, Anshul Kumar

Open publisher page 10 citations

Abstract

Performance estimation is a crucial operation which drives the design space exploration in Application Speci c Instruction Set Processors (ASIP) synthesis. The usual approach to estimate performance is to do simulation. With increasing dimensions of the design space, simulator based approaches become too time consuming. This problem can be solved by scheduler based approaches, which are much faster. However existing scheduler based approaches do not help in exploring storage organization. This paper presents a scheduler based technique for exploring register le size in ASIP synthesis.

About this research paper

What this paper is about

Performance estimation is a crucial operation which drives the design space exploration in Application Speci c Instruction Set Processors (ASIP) synthesis. The usual approach to estimate performance is to do simulation. With increasing dimensions of the design space, simulator based approaches become too time consuming. This problem can be solved by scheduler based approaches, which are much faster. However existing scheduler based approaches do not help in exploring storage organization. This paper presents a scheduler based technique for exploring register le size in ASIP synthesis.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Performance estimation is a crucial operation which drives the design space exploration in Application Speci c Instruction Set Processors (ASIP) synthesis. The usual approach to estimate performance is to do simulation. With increasing dimensions of the design space, simulator based approaches become too time consuming. This problem can be solved by scheduler based approaches, which are much faster. However existing scheduler based approaches do not help in exploring storage organization. This paper presents a scheduler based technique for exploring register le size in ASIP synthesis.

Key concepts: Register file, Register allocation, Computer science, Reuse, Parallel computing, Instruction set, Processor register, Register (sociolinguistics)

Related papers

Back to paper searchBrowse research topicsOriginal source
An efficient technique for exploring register file size in ASIP synthesis — Research Paper | ScholarLens