Chuck Monahan, Forrest Brewer  Home/Search
Context Related
| ucsb.edu/cad/papers/iccad97.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: ucsb.edu/personnel/kgb/resume (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper generalizes ALAP bounds for the exact scheduling problem on a pre-defined data path. Conventional bounds are inapplicable because of the possible requirement of re-computing operands for minimal schedule length. Efficient techniques are presented for constructing the new bounds which are sensitive to point-to-point delays via transitive memory units. An efficient operand mapping bound is also described. Based on these two bounds, time improvement factors of 50 have demonstrated in... (Update)
Context of citations to this paper: More
...Yang s formulation also did not use nondeterminism and hence suffered significantly from ROBDD representation growth. Monahan[94][95] also proposed an automata based scheduler. His was for predefined datapaths subject to limited memory constraints. His work did not address...
Cited by: More
Automata-Based Symbolic Scheduling - Haynal (2000) (Correct)
Active bibliography (related documents): More All
0.3: Representing and Scheduling Looping Behavior Symbolically - Steve Haynal Forrest (Correct)
0.2: Exploiting Instruction-Level Parallelism: A constructive approach - Santos (1998) (Correct)
0.2: Constraint Analysis and Heuristic Scheduling Methods - Poplavko, van Eijk, Basten (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Linguistic Databases of the American Linguistic Atlas Project .. - Kretzschmar, Jr. (Correct)
0.2: High-Level Library Mapping for Arithmetic Components - Jha, Dutt (1996) (Correct)
0.2: Modeling Custom Hardware in VHDL - Lehr (1999) (Correct)
BibTeX entry: (Update)
C. Monahan and F. Brewer, "Scheduling and Binding Bounds for RT-Level Symbolic Execution", Proc. IEEE Int. Conf. Computer-Aided-Design, pp. 230-235, 1997. http://citeseer.ist.psu.edu/monahan97scheduling.html More
@inproceedings{ monahan97scheduling,
author = "Chuck Monahan and Forrest Brewer",
title = "Scheduling and binding bounds for {RT}-level symbolic execution",
booktitle = "{ICCAD}",
pages = "230-235",
year = "1997",
url = "citeseer.ist.psu.edu/monahan97scheduling.html" }
Citations (may not include all citations):106 Code Generation for Embedded Processors (context) - Marwedel, Goosens - 1995
14 Dynamic Scheduling and Synchronization Synthesis of Concurre.. - Jr, De Micheli - 1994
14 Retargetable Generation of Code Selectors from HDL Processor.. - Leupers, Marwedel - 1997
6 Symbolic Modeling and Evaluation of Data Paths - Monahan, Brewer - 1995
5 From Design Space Exploration to Code Generati (context) - Timmer - 1996
3 Scheduling and Control Generation with Environmental Constra.. (context) - Yang, De Micheli et al. - 1996
1 High Level Synthesis Using Given Datapath Information (context) - Miyazaki, Ikeda - 1993
1 Symbolic Data Path Modeling (context) - Monahan - 1997
Documents on the same site (http://bears.ece.ucsb.edu/personnel/kgb/resume.html):
Symbolic Modeling and Evaluation of Data Paths - Monahan, Brewer (1995) (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