{"title":"Partial-order correctness-preserving properties of delay-insensitive circuits","authors":"R. Berks, R. Negulescu","doi":"10.1109/ASYNC.2001.914071","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914071","url":null,"abstract":"Delay-insensitive (DI) circuits are a class of asynchronous circuits that operate correctly regardless of delays in components or wires. We model such circuits using their traces, or sequences of events (signal transitions) that occur during the operation of the circuit. DI circuits can be characterized by certain properties regarding swapping consecutive events in traces. We focus on the exhaustive verification problem, which determines whether there is any set of timing and environment conditions under which the circuit may operate incorrectly. We show that the event-swapping properties of DI circuits authorize us to verify exhaustively such circuits by only examining certain special traces.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125119268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Asynchronous design and the pursuit of low power","authors":"Bill Athas","doi":"10.1109/ASYNC.2001.914063","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914063","url":null,"abstract":"Summary form only give, as follows. Two often cited arguments for the inherent low-power benefit of asynchronous or self-timed design is that the clock signals cause unnecessary switching activity and that the clock signals themselves dissipate a large portion of the total chip power. However, the careful and explicit application of conditional clocking and the use of novel clock driver circuits in synchronous designs rival the asynchronous approaches without incurring the typical circuitry overhead of asynchronous design. There are still though some avenues to pursue in exploiting the low-power advantages of asynchronous and self-timed circuit concepts. One promising avenue is the use of self-timed postcharged logic, sometimes called self-resetting logic, which has proven to be highly effective in RAM design and could possibly extend to other kinds of computing structures.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130331895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ryusuke Konishi, Hideyuki Ito, H. Nakada, A. Nagoya, N. Imlig, Tsunemichi Shiozawa, Minoru Inamori, Kouichi Nagami, K. Oguri
{"title":"PCA-1: a fully asynchronous, self-reconfigurable LSI","authors":"Ryusuke Konishi, Hideyuki Ito, H. Nakada, A. Nagoya, N. Imlig, Tsunemichi Shiozawa, Minoru Inamori, Kouichi Nagami, K. Oguri","doi":"10.1109/ASYNC.2001.914069","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914069","url":null,"abstract":"This paper describes the asynchronous device features of PCA-1, which is the first VLSI to realize the Plastic Cell Architecture (PCA). PCA is an autonomously reconfigurable hardware architecture consisting of a programmable logic layer and a network of built-in facilities. To realize run-time generation and the deletion of circuit objects with variable grain, the circuits on the logic layer are programmed as self-timed circuits using Look-Up Tables (LUTs). The built-in facilities of PCA-1 are also designed as self-timed circuits to enhance scalability and to minimize power consumption. LSI chips are successfully fabricated, and experimental results are mentioned.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116647303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient exact two-level hazard-free logic minimization","authors":"C. Myers, H. Jacobson","doi":"10.1109/ASYNC.2001.914070","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914070","url":null,"abstract":"This paper presents a new approach to two-level hazard free sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-free logic minimization can handle large circuits without synthesis times ranging up over thousands of seconds. The logic minimization approach presented in this paper is based on state graph exploration in conjunction with single-cube cover algorithms. Our algorithm achieves fast logic minimization by using compacted state graphs and cover tables and an efficient algorithm for single-output minimization. Our exact two-level hazard-free logic minimizer finds a minimal number of literal solutions and is significantly faster than existing literal exact methods-over two orders of magnitude faster for the largest extended burst-mode benchmarks to date. This includes a benchmark that has never been possible to solve exactly in a number of literals before.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133513076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AMULET3i cache architecture","authors":"D. Hormdee, J. Garside","doi":"10.1109/ASYNC.2001.914079","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914079","url":null,"abstract":"This paper presents an evaluation of a range of cache features applied to an asynchronous, dual-ported copy-back cache. The design has been optimised for the AMULET3 asynchronous microprocessor core, but the techniques developed are much more widely applicable. It is shown that using a copy-back cache with a victim cache would gives a noticeable performance improvement on the existing fabrication technology and that the benefits will increase with increasing cache/memory speed disparity. The design presented provides the processor with a unified, dual-ported view of its memory subsystem using multiple interleaved blocks each with separate line-buffers.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124761312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Synchronous handshake circuits","authors":"A. Peeters, K. V. Berkel","doi":"10.1109/ASYNC.2001.914072","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914072","url":null,"abstract":"We present the synchronous implementation of handshake circuits as an extra feature in the otherwise asynchronous design flow based on Tangram. This synchronous option can be used in the mapping onto FPGAs or as a fallback option to provide a circuit that is easier to test and integrate in a synchronous environment. When single-rail and synchronous realizations of the same handshake circuit are compared, the synchronous versions typically require fewer state-holding elements, occupy less area, have similar performance, but consume significantly more power (in the examples studied up to a factor four). Synchronous handshake circuits provide a means to study clock-gating techniques based on the synthesis starting from a behavioral-level specification. In addition, the study provides hints as to where the asynchronous handshake circuits may be optimized further.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exploiting typical DSP data access patterns and asynchrony for a low power multiported register bank","authors":"M. Lewis, L. Brackenbury","doi":"10.1109/ASYNC.2001.914064","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914064","url":null,"abstract":"CADRE (Configurable Asynchronous DSP for Reduced Energy) is a low-power asynchronous DSP (digital signal processor) architecture intended for digital mobile phone chipsets. Central to the architecture are the X and Y register banks, which supply the four processing units with the data they require and to which results are written. The register banks each require 10 read and 6 write ports to service all possible requests, leading to a large and power-hungry unit if implemented directly. Instead, typical DSP data access patterns are exploited to produce a partitioned design which offers fast and low-power operation in typical cases but also caters for worst-case patterns. Power consumption and performance results for the register bank with the DSP running typical algorithms are presented, and it is shown that the register bank consumes only 8% of total power (core and memory) in what is already a highly power-efficient system.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"30 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123918918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Delay insensitive system-on-chip interconnect using 1-of-4 data encoding","authors":"William John Bainbridge, S. Furber","doi":"10.1109/ASYNC.2001.914075","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914075","url":null,"abstract":"The demands of System-on-Chip (SoC) interconnect increasingly cannot be satisfied through the use of a shared bus. A common alternative, using unidirectional, point-to-point connections and multiplexers, results in much greater area requirements and still suffers from some of the same problems. This paper introduces a delay-insensitive, asynchronous approach to interconnect over long paths using 1-of-4 encoded channels switched through multiplexers. A reimplementation of the MARBLE SoC bus (as used in the AMULET3H chip) using this technique shows that it can provide a higher throughput than the simpler tristate bus while using a narrower datapath.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An analysis of reshuffled handshaking expansions","authors":"R. Manohar","doi":"10.1109/ASYNC.2001.914073","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914073","url":null,"abstract":"We present a method for reasoning about the synchronization behavior of reshuffled handshaking expansions. The technique introduced converts the handshaking expansion into communicating hardware processes. We identify and discuss some of the limitations of the method. We show how the approach can be applied to analyze both the performance and the correctness of handshaking expansions.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129861424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Squaring the FIFO in GasP","authors":"J. Ebergen","doi":"10.1109/ASYNC.2001.914083","DOIUrl":"https://doi.org/10.1109/ASYNC.2001.914083","url":null,"abstract":"This paper presents a method for designing a special type of asynchronous circuits, called GasP circuits, and illustrates the method by a novel design of a low-latency, high-throughput FIFO, called a square FIFO. The design method includes a graphical notation that permits the specification not only of circuit topology but also of the time separation between any two succeeding events. A square FIFO test chip has been fabricated in a 0.35 /spl mu/m CMOS process through MOSIS. Test results show that the square FIFO chip can sustain a maximum throughput of 1.56 giga data items per second for a large range of occupancies.","PeriodicalId":272827,"journal":{"name":"Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}