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

Operation scheduling considering time borrowing for high-performance latch-based circuits

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

Recently, latch-based design has attracted attention due to its several merits. Time borrowing is one feature of latches, where a slower functional unit can borrow timing slacks from a faster functional unit. This paper shows that latency can be reduced by integrating the time borrowing into operation scheduling in latch-based design. Specifically, continuous execution delay model is adapted to operation scheduling, and design conditions based on this model are presented. A list scheduling-based algorithm is proposed to solve the minimum-latency resource-constrained scheduling problem. Experiments demonstrate the latency reduction with an average of 11% compared to the conventional design.

Published in:

New Circuits and Systems Conference (NEWCAS), 2011 IEEE 9th International

Date of Conference:

26-29 June 2011

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.