National Tsing Hua University Institutional Repository:Transformation-based method for loop folding
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 14501246      在线人数 : 68
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    题名: Transformation-based method for loop folding
    作者: Lee,Tsing-Fa
    Wu,Allen C. -H
    Gajski,Daniel D.
    日期: 1994
    出版者: Institute of Electrical and Electronics Engineers Inc
    关键词: VLSI circuits
    Computer aided design
    Constraint theory
    Integrated circuit testing
    Iterative methods
    Electric network synthesis
    Pipeline processing systems
    摘要: We propose a transformation-based scheduling algorithm for the problem - given a loop construct, a target initiation interval and a set of resource constraints, schedule the loop in a pipelined fashion such that the iteration time of executing an iteration of the loop is minimized. The iteration time is an important quality measure of a data path design because it affects both storage and control costs. Our algorithm first performs an As Soon As Possible Pipelined (ASAPP) scheduling regardless the resource constraint. It then resolves resource constraint violations by rescheduling some operations. The software system implementing the proposed algorithm, called Theda.Fold, can deal with behavioral loop descriptions that contain chained, multicycle and/or structural pipelined operations as well as those having data dependencies across iteration boundaries. Experiment on a number of benchmarks is reported.
    显示于类别:[資訊工程學系] 期刊論文
    [積體電路設計技術研發中心] 期刊論文
    [清大/工研院聯合研究中心] 期刊論文


    档案 描述 大小格式浏览次数
    2030207010023.pdf1227KbAdobe PDF977检视/开启


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈