Efficient performance analysis of asynchronous systems based on periodicity

McGee, Peggy B.; Nowick, Steven M.; Coffman, E. G.

doi:10.1145/1084834.1084892

Cited by 20 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, our analysis method is fast and accurate enough to be used for repeated analysis and optimization as part of a design flow. Table II compares our analysis tool's runtime on linear FIFOs of varying lengths with that of one previous approach [9]. The results show that while the runtime of our tool is negligible, the previous approach becomes quite slow as the FIFO length increases to 11 stages and beyond.…”

Section: B Heuristic Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Performance estimation and slack matching for pipelined asynchronous architectures with choice

Gill¹,

Gupta²,

Singh³

2008

2008 IEEE/ACM International Conference on Computer-Aided Design

View full text Add to dashboard Cite

This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the problem of pipelining "slack matching." The approach targets systems with hierarchical topologies, which typically result when high-level (block structured) language specifications are compiled into data-driven circuit implementations. A significant contribution is that our approach is the first to efficiently handle architectures with choice (i.e., the presence of conditional computation constructs such if-then-else and conditional loops).The key idea behind the fast speed of our analysis method is to exploit information about the hierarchy of a given block-structured system, thereby yielding a runtime that is linear in the number of pipeline stages. In contrast, existing approaches typically represent an entire system as a single Petri net or marked graph, and then apply Markov chain analysis or other state enumeration methods with costly runtimes.Building upon our analysis approach, we introduce a novel solution to the problem of slack matching, i.e., determining optimal insertion of FIFO stages into a pipelined design to improve performance. We present both an optimal solution using an MILP formulation, and a fast heuristic algorithm that yielded optimal results for all of our examples.

show abstract

Section: B Heuristic Algorithmmentioning

confidence: 99%

“…OF RUN TIME WITH A PREVIOUS APPROACH[9] previous methods do not handle systems with choice [2]-[4],[11]-…”

mentioning

confidence: 99%

Performance estimation and slack matching for pipelined asynchronous architectures with choice

Gill¹,

Gupta²,

Singh³

2008

2008 IEEE/ACM International Conference on Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…There are two main alternative approaches to model event timing: (i) using stochastic models (e.g. exponential delay), 27,28 or (ii) using minmax bounds. 29 The former approach provides metrics for averagecase throughput, which can be used both to derive early performance estimates and to guide performancedriven optimization.…”

Section: Sidebar Ii: Testingmentioning

confidence: 99%

Asynchronous Design—Part 2: Systems and Methodologies

Nowick

Singh

2015

IEEE Des. Test

Self Cite

View full text Add to dashboard Cite

“…These include (i) simulation-based approaches [3], [18], [26]; (ii) Markov analysis methods [14], [17], [25]; (iii) methods based on graph unfolding [13], [4]; and (iv) closed-form analytical solutions [23], [9], [19], [15]. The simulation, Markov analysis, and graph unfolding methods all tend to require long running times.…”

Section: Introductionmentioning

confidence: 99%

Bottleneck Analysis and Alleviation in Pipelined Systems: A Fast Hierarchical Approach

Gill

Singh

2009

2009 15th IEEE Symposium on Asynchronous Circuits and Systems

View full text Add to dashboard Cite

Abstract-Fast bottleneck detection and elimination is an important component of any design flow that aims at producing high-throughput systems. Bottlenecks can be difficult to find and correct, because their causes are diverse and often subtle. In this paper, we build on our recent method for performance analysis to develop a method for bottleneck identification and alleviation for pipelined asynchronous systems.More specifically, this paper makes two contributions. First, we introduce a method that, given a throughput goal, identifies which parts of the pipelined system constrain its throughput. Each such bottleneck is categorized based on the type of structural transformation that could potentially alleviate it: increase degree of pipelining (stage splitting, stage duplication, and loop unrolling); decrease forward latency (stage merging and parallelization); and perform slack matching. The second contribution is a method that guides the user to systematically apply these modifications to alleviate the bottlenecks and reach a target throughput goal.We have validated the bottleneck analysis method on several examples and were able to attain the desired throughput goal in each case through iterative application of our bottleneck alleviation method. Runtimes were negligible in all cases (less than 50 ms).

show abstract

Efficient performance analysis of asynchronous systems based on periodicity

Cited by 20 publications

References 24 publications

Performance estimation and slack matching for pipelined asynchronous architectures with choice

Performance estimation and slack matching for pipelined asynchronous architectures with choice

Asynchronous Design—Part 2: Systems and Methodologies

Bottleneck Analysis and Alleviation in Pipelined Systems: A Fast Hierarchical Approach

Contact Info

Product

Resources

About