{"title":"Deep pipelines vs. risk and power walls [microprocessors]","authors":"R. Colwell","doi":"10.1109/ASYNC.2005.17","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.17","url":null,"abstract":"Summary form only given. Intel's /spl times/86 processors pushed pipelining and clock rates until physics stopped us. Less obviously, we were also pushing complexity, and therefore risk. We now know where the limits to these trends lie: with the Prescott processor. This talk explores the nature of risk in chip developments, how the ever-deepening pipelines in the Pentium series affected, and were affected by, perceived risk and thermals, and where the future will take us.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133097184","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":"A unified coding framework for delay-insensitivity","authors":"F. Worm, Patrick Thiran, P. Ienne","doi":"10.1109/ASYNC.2005.8","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.8","url":null,"abstract":"We study the problem of delay-insensitivity from a coding point of view. We define sequencing rules, i.e., the rules dictating which symbols can follow which. For example, spacer-based encoding schemes obey a sequencing rule that requires a spacer to be inserted after each symbol conveying information. We define mathematically delay-insensitive sequencing rules and study the ones which maximize bandwidth efficiency.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131869348","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":"Behavior and synthesis of two-input-gate asynchronous circuits","authors":"N. Starodoubtsev, S. Bystrov","doi":"10.1109/ASYNC.2005.13","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.13","url":null,"abstract":"This paper studies the behavioral properties of asynchronous circuits built of monotonic two-input gates (NAND2, NOR2 and NOT) and reveals the feasibility of a behavioral specification to be refined to two-input-gate-implementable form. An algebraic taxogram language was further developed to make it applicable to specifying the behavior refinement technique. The result of comparison of circuit realizations with their speed-independent counterparts produced by the petrify synthesis tool shows that there is still great unrealized potential for improving asynchronous circuit design. Producing circuits being hazard free in a wide range of variation in gate parameters as well as forgiving to shortages of the gate library, this approach offers new advantages for ASIC designs.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115525116","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}
J. Ebergen, Jonathan Gainsley, J. Lexau, I. Sutherland
{"title":"GasP control for domino circuits","authors":"J. Ebergen, Jonathan Gainsley, J. Lexau, I. Sutherland","doi":"10.1109/ASYNC.2005.21","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.21","url":null,"abstract":"We present two novel asynchronous control circuits for domino pipelines. The control circuits are based on GasP circuits, have a minimum cycle time of six gate delays, and compare favorably with previously published control circuits. We present some results from a chip implementation of several 64-bit domino adders in a TSMC CMOS 180 nm process technology.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128402974","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":"Modeling and verifying circuits using generalized relative timing","authors":"S. Seshia, R. Bryant, K. Stevens","doi":"10.1109/ASYNC.2005.24","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.24","url":null,"abstract":"We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not just a relative ordering between events, but also some forms of metric timing constraints. Circuits modeled using generalized relative timing constraints are formally encoded as timed automata. Novel fully symbolic verification algorithms for timed automata are then used to either verify a temporal logic property or to check conformance against an untimed specification. The combination of our new modeling technique with fully symbolic verification methods enables us to verify larger circuits than has been possible with other approaches. We present case studies to demonstrate our approach, including a self-timed circuit used in the integer unit of the Intel/sup /spl reg// Pentium/sup /spl reg//4 processor.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130413939","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":"A multiplexer based test method for self-timed circuits","authors":"F. T. Beest, A. Peeters","doi":"10.1109/ASYNC.2005.5","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.5","url":null,"abstract":"A new test method for self-timed circuits is presented that only uses multiplexers to make the majority of combinational feedback loops testable. Combinational feedback loops are problematic for testing, since they introduce sequential behavior in a circuit. Traditionally feedback loops are broken with scan latches or event scan flip-flops, which causes not only a large area overhead, but also has a large impact on performance. The method we present significantly reduces the cost of testing a self-timed circuit, while it retains all the benefits of traditional scan test methods. Most importantly, the method remains fully compatible with standard combinational test pattern generation tools and provides up to 100% stuck-at fault coverage. With the presented test method, it becomes cost effective to use scan test for a self-timed circuit without the need to add new specialized cells to a standard cell library.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121103305","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":"Register-communication between mutually asynchronous domains","authors":"J. Kessels","doi":"10.1109/ASYNC.2005.27","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.27","url":null,"abstract":"We present the design of several so-called communication registers, which are modules that support non-blocking communication between two mutually asynchronous domains. For that purpose, a communication register offers two mutually asynchronous access ports: a write and a read port. Communication registers differ from buffers in that read and write accesses are never held up. Consequently, data may get duplicated or lost. A read access, however, always delivers a value written into the register, although not necessarily the latest one. Each of the two access ports is either clocked or self-timed, where the accesses through a self-timed port are controlled by handshakes. Therefore, one can distinguish four different kinds of modules: one for each possible access port combination. For all four cases, we give simple designs, which in several cases are subsequently refined to meet additional requirements, such as setting an upper-bound to the mutual timing interference, keeping the power consumption low, or reducing the latency.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116456161","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":"Self-timed circuitry for global clocking","authors":"Scott M. Fairbanks, S. Moore","doi":"10.1109/ASYNC.2005.29","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.29","url":null,"abstract":"We present an apparatus used to distribute a timing reference or clock across the extent of a digital system. Self-timed circuitry both generates and distributes a clock signal, while using less power and less skew compared to a clock tree. HSpice simulations, in a 180 nm CMOS process, comparing the distributed clock generator presented in this paper and an H-tree clock distribution system, each clocking a 16 mm/spl times/16 mm area suggests a 30% power savings. Also worst case skew was reduced from 27 ps to 2 ps while using a clock period equivalent to 9 FO4 gates.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487618","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}
T. Yoneda, Atsushi Matsumoto, Manabu Kato, C. Myers
{"title":"High level synthesis of timed asynchronous circuits","authors":"T. Yoneda, Atsushi Matsumoto, Manabu Kato, C. Myers","doi":"10.1109/ASYNC.2005.22","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.22","url":null,"abstract":"This paper proposes applying a logic synthesis approach to high level synthesis from SpecC specifications to timed asynchronous gate-level circuits. The state-based logic synthesis is used to allow for global and timing optimization. In order to reduce the overhead in resetting phases, a protocol called early acknowledgment protocol and its STG (signal transition graph) generation technique are proposed. In this protocol, the state variables inserted to guarantee that STGs have CSC (complete state coding) usually cause no overhead. The experiments to synthesize a portion of a DCT circuit show that the proposed method can handle a nontrivial example and produce a smaller and faster circuit than a previous approach.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129216367","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}
E. Beigné, F. Clermidy, P. Vivet, A. Clouard, M. Renaudin
{"title":"An asynchronous NOC architecture providing low latency service and its multi-level design framework","authors":"E. Beigné, F. Clermidy, P. Vivet, A. Clouard, M. Renaudin","doi":"10.1109/ASYNC.2005.10","DOIUrl":"https://doi.org/10.1109/ASYNC.2005.10","url":null,"abstract":"The demands of scalable, low latency and power efficient system-on-chip interconnect cannot only be satisfied by point-to-point or shared-bus interconnects. In this paper, we propose a new asynchronous network-on-chip (NOC) architecture which provides low latency transfers. This architecture is implemented as a GALS system, where chip units are built as synchronous islands, connected together using a delay insensitive asynchronous network-on-chip topology. The proposed NOC protocol and its asynchronous implementation are presented as well as the multi-level modeling approach using SystemC language and transaction-level-modeling. Preliminary simulation results show that the asynchronous NOC can offer 5 Gbytes/s throughput in a 0.13 /spl mu/m CMOS technology.","PeriodicalId":432483,"journal":{"name":"11th IEEE International Symposium on Asynchronous Circuits and Systems","volume":"11 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132606060","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}