Seong Y. Ohm, Fadi J. Kurdahi, Chu S. Jhon  Home/Search
Context Related
| cs.swu.ac.kr/~osy/public/ieice95.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.swu.ac.kr/~osy/myresearch (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes an optimal scheduling approach which finds the scheduling result of the minimum functional unit cost under the given timing constraint. In this method, a well-defined search space is constructed incrementally and traversed in a branch-and-bound manner. During the traversal, tighter lower bounds are estimated and utilized coupled with the upper bound on the optimal solution in pruning the search space effectively. This method is extended to support multi-cycling operations,... (Update)
Context of citations to this paper: More
...to support multicycling, chaining, and functional pipelining of operations. For more details on FU lower bounds, the reader is referred to [10] and [12]. B.2 Register Lower Bounds In Section III, we sketched how an optimal recovery point set, which requires the minimum...
Cited by: More
Software Technology - Unu Iist Report (Correct)
High-Level Synthesis of Recoverable VLSI Microarchitectures - Blough, Kurdahi, Ohm (Correct)
Active bibliography (related documents): More All
0.1: Application-driven Design Automation for Microprocessor Design - Iksoo Pyo (1992) (Correct)
0.1: A High Level Synthesis System for VLSI Image Processing.. - Verdier, Zavidovique (1994) (Correct)
0.1: Scheduling Strategies in High-Level Synthesis - Silc (1994) (Correct)
Similar documents based on text: More All
0.3: Linguistic Databases of the American Linguistic Atlas Project .. - Kretzschmar, Jr. (Correct)
0.2: Register-Transfer Synthesis of Pipelined Data Paths - Park, Kurdahi (1995) (Correct)
0.2: Automatic Synthesis of Time-Stationary Controllers for.. - Kim, Kurdahi, Park (Correct)
Related documents from co-citation: More All
2: Comprehensive Lower Bound Estimation from Behavioral Descriptions - Ohm, Kurdahi et al. - 1994
BibTeX entry: (Update)
S.Y. Ohm, F.J. Kurdahi, and C.S. Jhon, "An Optimal Scheduling Approach using Lower Bound in High Level Synthesis", IEICE Transactions on Information and Systems, vol. E78-D, pp. 231--236, March 1995. http://citeseer.ist.psu.edu/ohm95optimal.html More
@misc{ ohm95optimal,
author = "S. Ohm and F. Kurdahi and C. Jhon",
title = "An Optimal Scheduling Approach using Lower Bound in High Level Synthesis",
text = "S.Y. Ohm, F.J. Kurdahi, and C.S. Jhon, An Optimal Scheduling Approach using
Lower Bound in High Level Synthesis, IEICE Transactions on Information and
Systems, vol. E78-D, pp. 231--236, March 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/ohm95optimal.html" }
Citations (may not include all citations):70 A Formal Approach to the Scheduling Problem in High Level Sy.. (context) - Hwang, Lee et al. - 1991
40 Tutorial on High-Level Synthesis (context) - McFarland, Parker et al. - 1988
32 Estimating Architectural Resources and Performance for High-.. (context) - Sharma, Jain - 1993
22 SALSA: A new Approach to Scheduling with Timing Constraints - Nestor, Krishnamoorthy - 1993
21 High-Level Synthesis (context) - Gajski, Wu et al. - 1992
8 SEHWA: A Program for Synthesis of Pipelines (context) - Park, Park - 1986
1 Fast and Near Optimal Scheduling in Automated Data path Synt.. (context) - Park, Kyung - 1991
Documents on the same site (http://cs.swu.ac.kr/~osy/myresearch.html): More
A Fast and Exact Cell Matching Method for MUX-based FPGA.. - Yi, Ohm (1999) (Correct)
Comprehensive Lower Bound Estimation from Behavioral Descriptions - Seong Ohm Fadi (1994) (Correct)
High-Level Synthesis of Recoverable VLSI Microarchitectures - Blough, Kurdahi, Ohm (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC