Cart (Loading....) | Create Account
Close category search window
 

Heuristic assignment-driven scheduling for data-path synthesis

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)
Ohashi, K. ; Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; Kaneko, M.

This paper treats a loop pipeline scheduling problem under given resource assignment (operations to functional units and data to registers), which is one of the key tasks in design backtracking or in an assignment-driven approach for datapath synthesis. First we transform our scheduling problem into the problem of assigning integers to disjunctive arcs introduced to resolve lifetime collisions. After evaluating a feasible range of each variable to be fixed, we propose an heuristic method to reduce these ranges based on the sensitivity to iteration period so that every variable falls into an integer. Finally, our scheduler is incorporated into a Simulated Annealing exploration of assignment solution space, and data-path designs with an emphasis on connectivity minimization are demonstrated.

Published in:

Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on  (Volume:4 )

Date of Conference:

2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.