2009 Ninth International Conference on Application of Concurrency to System Design 2009
DOI: 10.1109/acsd.2009.15
|View full text |Cite
|
Sign up to set email alerts
|

Teak: A Token-Flow Implementation for the Balsa Language

Abstract: Abstract-This paper describes a new target component set and synthesis scheme for the Balsa asynchronous hardware description language. This new scheme removes the reliance on precise handshake interleaving and enclosure by separating out control 'go' and 'done' signalling into separate channels rather than using different phases of the asynchronous handshake. This leads to circuits in which optimisation and control overhead mitigation can be carried out by merging/separating control and data channels and by i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 21 publications
(16 citation statements)
references
References 10 publications
0
16
0
Order By: Relevance
“…Assuming no conflicts while doing the data reading and writing, we treat each Variable read or write as an Operator component. Very big asynchronous circuits can be designed using Teak [17] . Simulation can be used to verify the correct functionality of these circuits.…”
Section: Applicationmentioning
confidence: 99%
See 1 more Smart Citation
“…Assuming no conflicts while doing the data reading and writing, we treat each Variable read or write as an Operator component. Very big asynchronous circuits can be designed using Teak [17] . Simulation can be used to verify the correct functionality of these circuits.…”
Section: Applicationmentioning
confidence: 99%
“…To the best of our knowledge, this work is the first to address the idea that a Steer-Merge bundle is not slack-elastic. As an application, the method derived is used to verify the deadlock-freeness of the circuits generated by a syntax-directed asynchronous design tool -Teak [17] , which is a data-driven implementation of Balsa [1] . Although we simplify the deadlock checking problem by considering only acyclic component networks, it is revealed that the While and Loop structures in Teak can still be handled in a series of steps that breaks the channel cycles and then checks to see if it is well-formed.…”
Section: Introductionmentioning
confidence: 99%
“…This section presents Greatest Common Denominator (GCD) and Viterbi decoder design examples and compares them to Balsa-generated designs, as that allows direct complete-system comparisons (Teak [13][16], a successor to Balsa, will be discussed at the end of this section). There have been other toolsets that have addressed parts of the NCL asynchronous dual-rail synthesis problem, such as ATN [11] (combinational logic only, dual-rail expansion, timing-driven relaxation, technology mapping) and the toolset used by Theseus Logic [15] in 1995-2005 (roughly) timeframe (automated combinational logic only, ack networks manually created, synthesis using Synopsys); also had cell merging, and a simulator with orphan detection.…”
Section: Design Examples and Comparisonsmentioning
confidence: 99%
“…The community has attempted to address performance issues by improving the control flow [6], [7], [8]. Recently, Teak [9] and Click [10] have been proposed as dataflow synthesis frameworks to tackle the control overhead of Balsa and Haste, respectively.…”
Section: Introductionmentioning
confidence: 99%