Paper Info
Title
Analysis of conditional resource sharing using a guard-based control representation
Abstract
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of throughput is desired. In this paper, an exact and efficient conditional resource sharing analysis using a guardbased control representation is presented. The analysis is transparent to a scheduler implementation. The proposed technique systematically handles complex conditional resource sharing for cases when folded (software pipelined) loops include conditional behavior within the loop body.
Year
DOI
Venue
1995
10.1109/ICCD.1995.528904
ICCD
Keywords
Field
DocType
complex conditional resource sharing,guard-based control representation,hardware resource,loop body,scheduler implementation,proposed technique systematically,efficient conditional resource sharing,conditional behavior,guardbased control representation,cyclic loop,conditional data-flow graph behavior,hardware,tree data structures,tree graphs,resource sharing,software pipelining,boolean functions,high level synthesis,data flow graph,systems analysis,throughput,resource management
Resource management,Tree (graph theory),Conditional loop,Computer science,Parallel computing,Tree (data structure),High-level synthesis,Theoretical computer science,Throughput,Shared resource,Maximization,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-8186-7165-3
13
0.79
References 
Authors
19
2
Name
Order
Citations
PageRank
Ivan Radivojevic1453.47
Forrest Brewer241462.95