Samit Chaudhuri, Robert A. Walker  Home/Search
Context Related
| rpi.edu/pub/walkerb/pape...tvlsi95tr.ps kent.edu/~walker/papers/tvlsi96.ps rpi.edu/pub/walkerb/papers...tvlsi96.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: rpi.edu (more) From: kent.edu/~walker/papers/index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a new polynomial-time algorithm for computing lower bounds on the number of functional units (FUs) of each type required to schedule a data flow graph in a specified number of control steps. A formal approach is presented that is guaranteed to find the tightest possible bounds that can be found by relaxing either the precedence constraints or integrality constraints on the scheduling problem. This tight, yet fairly efficient, bounding method can be used to estimate FU area,... (Update)
Context of citations to this paper: More
...perform fast and efficient design space exploration and pruning. A popular approach is to employ lower bound estimation techniques [23, 10] to determine the requirements on the functional unit resources. Later, there has been an effort to provide an exact solution to a 3D...
.... 2 Previous Work There is some recent work for estimating lower bounds on area cost and total control steps (or csteps) [3, 4, 5, 6, 7, 8, 9, 10, 11, 12]. All of these works (with the exception of [7] 10] 11] and [12] are mainly concerned with FUs in their area cost...
Cited by: More
Statistical Design Space Exploration for.. - Bruni, Bogliolo, Benini (2001) (Correct)
A Comprehensive Estimation Technique for High-Level Synthesis - Seong Ohm Fadi (1995) (Correct)
Efficient Acceptable Design Exploration Based on Module.. - Chantrapornchai, Sha, Hu (1999) (Correct)
Active bibliography (related documents): More All
1.4: A Solution Methodology for Exact Design Space.. - Chaudhuri, Blythe.. (1997) (Correct)
0.8: Bounding Algorithms for Design Space Exploration - Chaudhuri, Walker (1999) (Correct)
0.7: An Exact Methodology for Scheduling in a 3D Design Space - Chaudhuri, Blythe, Walker (1995) (Correct)
Similar documents based on text: More All
0.5: Host-Based Intrusion Detection Using User Signatures - Freeman, Branch (Correct)
0.3: Efficient Optimal Design Space Characterization Methodologies - Blythe, Walker (2000) (Correct)
0.1: Computing Lower Bounds on Functional Units before Scheduling - Samit Chaudhuri (1994) (Correct)
Related documents from co-citation: More All
8: Estimating Architectural Resources and Performance for High-Level Synthesis Appl.. (context) - Sharma, Jain - 1993
6: Analyzing and Exploiting the Structure of the Constraints in the ILP-Approach to.. - Chaudhuri, Walker et al. - 1994
6: IEEE Computer Society Press (context) - Proc - 1993
BibTeX entry: (Update)
Samit Chaudhuri and Robert A. Walker, "Computing Lower Bounds on Functional Units before Scheduling", in Proc. of the 7th International Symposium on High Level Synthesis. May 1994, pp. 36--41, IEEE Computer Society Press. http://citeseer.ist.psu.edu/chaudhuri94computing.html More
@misc{ chaudhuri94computing,
author = "S. Chaudhuri and R. Walker",
title = "Computing Lower Bounds on Functional Units before Scheduling",
text = "Samit Chaudhuri and Robert A. Walker, Computing Lower Bounds on Functional
Units before Scheduling, in Proc. of the 7th International Symposium on
High Level Synthesis. May 1994, pp. 36--41, IEEE Computer Society Press.",
year = "1994",
url = "citeseer.ist.psu.edu/chaudhuri94computing.html" }
Citations (may not include all citations):112 NP-Complete Scheduling Problems (context) - Ullman - 1975
70 A Formal Approach to the Scheduling Problem in High-Level Sy.. (context) - Hwang, Lee et al. - 1991
32 Estimating Architectural Resources and Performance for High-.. (context) - Sharma, Jain - 1993
29 Analyzing and Exploiting the Structure of the Constraints in.. - Chaudhuri, Walker et al. - 1994
29 Estimating Implementation Bounds for Real Time DSP Applicati.. (context) - Rabaey, Potkonjak - 1994
29 Wiley-Interscience series in discrete mathematics (context) - Nemhauser, Wolsey et al. - 1988
22 SALSA: A New Approach to Scheduling with Timing Constraints - Nestor, Krishnamoorthy - 1993
17 Predicting System-Level Area and Delay for Pipelined and Non.. (context) - Jain, Parker et al. - 1992
15 Comprehensive Lower Bound Estimation from Behavioral Descrip.. - Ohm, Kurdahi et al. - 1994
11 Lower Bounds on the Iteration Time and the number of Resourc.. (context) - Hu, Ghouse et al. - 1993
7 Improved Lower Bounds for the Scheduling Optimization Proble.. (context) - Hu, Carlson - 1994
6 Bounds on the number of Processors and Time for Multiprocess.. (context) - Fern'andez, Bussell - 1973
4 Micron CMOS Datapath Cell Library (context) - Inc - 1988
3 An Exact Methodology for Scheduling in a 3D Design Space (context) - Chaudhuri, Blythe et al. - 1995
2 System-Level Synthesis Techiques with Emphasis on Partitioni.. (context) - Ku, cakar - 1991
2 Scheduling and Design Space Exploration in HighLevel Synthes.. (context) - Chaudhuri - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.rpi.edu.html): More
ILP-Based Scheduling with Time and Resource Constraints in.. - Chaudhuri, Walker (1994) (Correct)
Rationale for Adding Hash Tables to the C++ Standard Template.. - Musser (1995) (Correct)
Adaptive Local Refinement with Octree.. - Flaherty, Loy.. (1997) (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