By Topic

STAR: An automatic data path allocator

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fur-Shing Tsai ; Dept. of Comput. Sci., California Univ., Riverside, CA, USA ; Yu-Chin Hsu

The STAR package consists of three phases-preprocessing, data path construction (DPC), and data path refinement (DPR). The data structures are created and the lower limit of each area-dominant resource is determined in the preprocessing phase. In the DPC phase, the allocation is vertically divided into three subtasks: data transfer binding, operation assignment, and variable binding. Data transfers, operations and variables are grouped into clusters of manageable size, and a branch-and-bound search is performed in each cluster for each subtask. In the DPR phase, the data path is refined globally by evaluating the binding quality of each object. The contributions include: (1) a novel technique to evaluate the binding quality of an object on the basis of a sharing of hardware resources in which the object uses; (2) a method to judge the potential for upgrading a data path; and (3) an iterative improvement technique based on the idea of a relation network and state transition

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:11 ,  Issue: 9 )