{"title":"A self-timed divider using RSD number system","authors":"Kiyoung Choi, KiJong Lee, Jun-Woo Kang","doi":"10.1109/ICCD.1994.331961","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331961","url":null,"abstract":"The paper proposes a divider structure that combines a novel self-timed ring structure and a carry-propagation-free division algorithm. The self-timed ring structure enables the divider to compute at a speed comparable to that of previously designed dividers with less silicon area. By exploiting the carry-propagation-free division algorithm, we can achieve even better performance. A 54-bit divider employing the proposed structure and algorithm was designed with 1.2 /spl mu/m CMOS technology. We obtained a speed of 215 ns per worst case division on 4.2 mm/sup 2/ of silicon area.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125147880","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}
M. Morioka, K. Kurosawa, S. Miura, T. Nakamikawa, S. Ishikawa
{"title":"Design and evaluation of the high performance multi-processor server","authors":"M. Morioka, K. Kurosawa, S. Miura, T. Nakamikawa, S. Ishikawa","doi":"10.1109/ICCD.1994.331856","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331856","url":null,"abstract":"The paper discusses the architecture and performance of a prototype RISC multi-processor server designed for a business system like OLTP (online transaction processing). The combination of a low-latency cache-to-cache copy and an 8-way highly interleaved main memory realize high performance for the OLTP program. We analyzed the activity of the multi-processor system when executing the OLTP program by using the trace-driven simulator including kernel execution. The main findings are that: cache misses due to task migration and ping-ponging of kernel shared data occupy a larger part of the total misses, especially in a large cache capacity because of intensive I/O activities; and the low-latency cache-to-cache copy is very effective because 50-60% of the data read accesses are supplied by the cache-to-cache copy in a large cache capacity.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123293975","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":"Automatic verification of refinement","authors":"Trevor Wing Sang Lee, M. Greenstreet, C. Seger","doi":"10.1109/ICCD.1994.331894","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331894","url":null,"abstract":"Given two models of a circuit, Q and Q', we say that Q' as a refinement of Q if every possible behavior of Q' is allowed by Q. We present a unified framework for verifying refinement using both model-checking and symbolic trajectory evaluation techniques. In this framework, the refinement conditions are derived and verified automatically. To demonstrate this approach, we present a design for a synchronizer circuit used in a high-speed synchronous design.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115208741","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. Borkenhagen, Glen H. Handlogten, John D. Irish, S. Levenstein
{"title":"AS/400 64-bit powerPC-compatible processor implementation","authors":"J. Borkenhagen, Glen H. Handlogten, John D. Irish, S. Levenstein","doi":"10.1109/ICCD.1994.331886","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331886","url":null,"abstract":"An implementation of the 64-bit PowerPC Architecture optimized for the IBM AS/400 commercial environment is described. This 64-bit BiCMOS semicustom implementation runs at a clock rate of 170 MHz. The processor features a 4-way superscalar pipelined fixed point unit which can dispatch and execute up to 4 instructions each cycle, a floating point unit with a peak rate of 500 MFLOPs, 8-Kbyte L0 instruction cache, 256-Kbyte L1 cache, and support for 64-Gbyte of main storage. A 4-way rightly-coupled symmetric multi-processor system is one of several configurations supported by this implementation.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114175165","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":"Continuations in hardware-software codesign","authors":"M. Tuna, S. Johnson, Robert G. Burger","doi":"10.1109/ICCD.1994.331902","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331902","url":null,"abstract":"This paper presents a case study for using high-level programming techniques to support the migration of software into hardware. The example is a derived implementation of a symbolic processing machine. The design environment employs codesign to maintain consistency between an executable software model of the system and the individual hardware components that are extracted from it. The presentation focuses on the use of continuations to move from a procedural view of memory allocation to a process view. Our previous work has used functional models as a source for correct hardware derivation using a transformational algebra. The work reported will result in extensions that deal more powerfully with the factorization of sequential subsystems.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129557218","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":"Multifault testable circuits based on binary parity diagrams","authors":"S. Kundu","doi":"10.1109/ICCD.1994.331927","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331927","url":null,"abstract":"We introduce a new class of binary graphs called binary parity diagrams (BPDs). Ordered binary parity diagram of a function is canonical. Importance of canonical forms in circuit verification is well known. Circuits derived on the basis of these diagrams are multifault testable. In this paper we focus on multifault testability property.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129678047","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 FPGA based configurable I/O system for AC drive controllers","authors":"D. Woodward, D. Levy, R. G. Harley","doi":"10.1109/ICCD.1994.331942","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331942","url":null,"abstract":"Modern AC drive control systems rely on advanced microprocessor techniques to implement the complex, real-time control algorithms necessary for high dynamic performance of the AC drive. The techniques employed generally have addressed the computational requirements of an AC drive controller, however little attention has been placed in the past on the provision of efficient I/O structures to deal with the numerous sensors and interfaces within the AC drive environment. This paper introduces the general interface requirements of a digital AC drive controller and then proposes an I/O coprocessor architecture capable of providing low level I/O support to a conventional microprocessor within an AC drive controller. The paper concludes by suggesting a possible route for the implementation of the I/O coprocessor architecture.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129887823","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 signature analyzer for analog and mixed-signal circuits","authors":"N. Nagi, A. Chatterjee, J. Abraham","doi":"10.1109/ICCD.1994.331906","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331906","url":null,"abstract":"While the design of signature analyzers for digital circuits has been well researched in the past, signature analyzers for analog signals are relatively unknown. In this paper, a novel signature analysis scheme for analog and mixed-signal circuits is proposed. The signatures possess the interesting properly that if the input analog signal is imprecise within certain bounds (an inherent property of analog signals), then the generated signature is also imprecise within certain bounds. A failure is indicated by the generated signature being different from the expected signature by a margin greater than a predetermined threshold.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126201458","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":"WRAPTure: a tool for evaluation and optimization of weights for weighted random pattern testing","authors":"Amitava Majumdar","doi":"10.1109/ICCD.1994.331907","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331907","url":null,"abstract":"Two problems in weighted random pattern testing are addressed: 1) finding the expected test length to sample all patterns in a given test set for a given weight set; and 2) finding the optimal weight set for minimizing expected test length for a given test set. Exact analytical expressions for expected test length for sampling all patterns from a test set are given. Expressions for approximating this quantity are also derived. Based on these results an algorithm is formulated to obtain the optimal weight assignment. Experiments carried out on test sets for several circuits (including ISCAS '85 benchmarks) yield of the order of 95% to 100% reduction in expected test length over that achieved by current techniques.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132057357","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":"Latch design for transient pulse tolerance","authors":"H. Cha, J. Patel","doi":"10.1109/ICCD.1994.331932","DOIUrl":"https://doi.org/10.1109/ICCD.1994.331932","url":null,"abstract":"Previous work on radiation hardening has focused on designing memory elements to tolerate direct hits by high energy particles. The study of latch designs to tolerate high energy particle induced transient pulses arising in the combinational part of the circuit and traveling to the inputs of DFFs has been, ignored. In this work, we look at ways to slow down the input stage of latches by inserting resistances to tolerate transient pulses. Fault injection experiments indicates that most of the transient pulses can be tolerated with 7.5 ns penalty in performance, at least for the ISCAS-89 benchmark circuits. In circuits for critical systems, this penalty may be acceptable. Furthermore, this is not the best case penalty since the DFF can be individually optimized for the circuit and the transient pulse width can be somewhat shortened through redesign. Therefore, this is a viable approach for tolerating transient pulses in VLSI circuits used in critical systems.<<ETX>>","PeriodicalId":202115,"journal":{"name":"Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132061838","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}