Teak: A token-flow implementation for the Balsa language

Andrew Bardsley, Luis Tarazona, Doug Edwards

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    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 introducing handshake-decoupling latches. This work aims to make Balsa descriptions implementable in the more widely used and understood higher performance token-based asynchronous circuit styles. © 2009 IEEE.
    Original languageEnglish
    Title of host publicationProceedings - International Conference on Application of Concurrency to System Design, ACSD|Proc. Int. Conf. Appl. Concurrency Syst. Des. ACSD
    Place of PublicationUSA
    PublisherIEE
    Pages23-31
    Number of pages8
    ISBN (Print)9780769536972
    DOIs
    Publication statusPublished - 2009
    EventACSD 2009 - 9th International Conference on Application of Concurrency to System Design - Augsburg
    Duration: 1 Jul 2009 → …

    Conference

    ConferenceACSD 2009 - 9th International Conference on Application of Concurrency to System Design
    CityAugsburg
    Period1/07/09 → …

    Keywords

    • Asynchronous logic
    • Logic synthesis

    Fingerprint

    Dive into the research topics of 'Teak: A token-flow implementation for the Balsa language'. Together they form a unique fingerprint.

    Cite this