{"title":"On test application time and defect detection capabilities of test sets for scan designs","authors":"I. Pomeranz, S. Reddy","doi":"10.1109/ICCD.2000.878314","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878314","url":null,"abstract":"The test application time of test sets for scan designs can be reduced (without reducing the fault coverage) by removing some scan operations, and increasing the lengths of the primary input sequences applied between scan operations. In this paper, we study the effects of such a compaction procedure on the ability of a test set to detect defects. Defect detection is measured by the number of times the test set detects each stuck-at fault, which was shown to be related to the defect coverage of the test set. We also propose a compaction procedure that affects the numbers of detections of stuck-at faults in a controlled way.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128615467","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":"Architectural support for dynamic memory management","authors":"J. M. Chang, W. Srisa-an, D. Lo","doi":"10.1109/ICCD.2000.878274","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878274","url":null,"abstract":"Recent advances in software engineering, such as graphical user interfaces and object-oriented programming, have caused applications to become more memory intensive. These applications tend to allocate dynamic memory prolifically. Moreover, automatic dynamic memory reclamation (garbage collection, GC) has become a popular feature in modern programming languages. As a result, the time consumed by dynamic storage management can be up to one-third of the program execution time. This illustrates the need for a high-performance memory management scheme. This paper presents a top-level design and evaluation of the proposed instruction extensions to facilitate heap management.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121192870","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}
H. Lavana, F. Brglez, Robert B. Reese, Gangadhar Konduri, A. Chandrakasan
{"title":"OpenDesign: an open user-configurable project environment for collaborative design and execution on the Internet","authors":"H. Lavana, F. Brglez, Robert B. Reese, Gangadhar Konduri, A. Chandrakasan","doi":"10.1109/ICCD.2000.878344","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878344","url":null,"abstract":"OpenDesign is an open user-configurable project environment that supports distributed collaborative design and execution on the Internet. The environment is created by configuring a generic client for a specific project. This is in contrast to an implementation of a project-specific client-server architecture. This paper introduces the OpenDesign environment in the contest of a design process and project-specific tasks. An OpenDesign task is defined as execution of one or more CAD point tools, whereas a task flow is a dependency graph of tasks and/or other task flows. Challenges arise when, within a single project, (1) tasks must be executed on remote hosts under different file systems, (2) data must be accessed, moved, modified, and archived with consistency, (3) tasks and task flows are assigned to more than one designer, and (4) designers are physically dispersed. In collaboration with peer institutions, a number of demo design projects demonstrate the features and the opportunities with the OpenDesign environment.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130666226","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}
Hoon Choi, Myung-Kyoon Yim, Jae Young Lee, Byeong-Whee Yun, Yun-Tae Lee
{"title":"Formal verification of an industrial system-on-a-chip","authors":"Hoon Choi, Myung-Kyoon Yim, Jae Young Lee, Byeong-Whee Yun, Yun-Tae Lee","doi":"10.1109/ICCD.2000.878322","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878322","url":null,"abstract":"This paper describes our experience and methodology used in the formal verification of an industrial embedded SOC product composed of the ARM920T processor core and 16 function modules, i.e., IPs. We employed the formal verification to verify the RTL implementation of each module. We used the model checking to make the RTL golden model and the equivalence checking to verify the following refinements. Specifically, we describe 1) the selection of a model checker and a modeling language, 2) the modeling of multiple clocks and gated clocks using the implicit clock of the model checker, 3) the translation between Verilog and the model checking language, and 4) the module verification strategy including the problem size reduction techniques. Results of applying the proposed verification strategy to our design are also covered.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772115","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 dynamic minimization of word-level DDs based on lower bound computation","authors":"Wolfgang Günther, R. Drechsler, Stefan Höreth","doi":"10.1109/ICCD.2000.878312","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878312","url":null,"abstract":"Word-Level Decision Diagrams (WLDDs), like *BMDs or K*BMDs, have been introduced to overcome the limitations of Binary Decision Diagrams (BDDs), which are the state-of-the-art data structure to represent and manipulate Boolean functions. However, the size of these graph types largely depends on the variable ordering, i.e. it may vary from linear to exponential. In the meantime, dynamic approaches to find a good variable ordering are also known for WLDDs. In this paper we show how these approaches can be accelerated significantly using a combination of a lower bound computation and synthesis operations. In the experiments it turned out that by this technique, the runtime for dynamic minimization can be reduced by more than 40% on average without loss of quality.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116899019","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}
Subarnarekha Sinha, S. Khatri, R. Brayton, A. Sangiovanni-Vincentelli
{"title":"Binary and multi-valued SPFD-based wire removal in PLA networks","authors":"Subarnarekha Sinha, S. Khatri, R. Brayton, A. Sangiovanni-Vincentelli","doi":"10.1109/ICCD.2000.878328","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878328","url":null,"abstract":"This paper describes the application of binary and multivalued SPFD-based wire removal techniques for circuit implementations utilizing networks of PLAs. It has been shown that a design style based on a multi-level network of approximately equal-sized PLAs results in a dense, fast, and crosstalk-resistant layout. Wire removal is a technique where the total number of wires between individual circuit nodes is reduced, either by removing wires, or replacing them with other existing wires. Three separate wire removal experiments are performed. Either wire removal is invoked before clustering the original netlist into a network of PLAs, or after clustering, or both before and after clustering. For wire removal before clustering, binary SPFD-based wire removal is used. For wire removal after clustering, multi-valued SPFD-based wire removal is used since the multi-output PLAs can be viewed as multi-valued single output nodes. We demonstrate that these techniques are effective. The most effective approach is to perform wire removal both before and after clustering. Using these techniques, we obtain a reduction in placed and routed circuit area of about 11%. This reduction is significantly higher (about 20%) for the larger circuits we used in our experiments.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128185279","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 power perspective of value speculation for superscalar microprocessors","authors":"R. Moreno, L. Piñuel, Silvia Del Pino, F. Tirado","doi":"10.1109/ICCD.2000.878281","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878281","url":null,"abstract":"Power consumption has become an important issue in the design of high-performance microprocessors. Pipeline activity in superscalar processors represents one of the most significant sources of power dissipation, due to the growing complexity of the out-of-order issue logic and the extra-work caused by speculative execution. Therefore, analyzing speculative techniques from a power-perspective seems to be essential for the design of power-efficient superscalar processors. Value prediction is one of the most recent techniques for increasing ILP through speculative execution. Although it has been proved to be an effective technique for improving performance, its hardware cost and power dissipation can represent two main limitations. The aim of this paper is to explore the main sources of power dissipation to be considered when value prediction is used, and to propose solutions to reduce this dissipation.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128260224","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 scalable high-performance DMA architecture for DSP applications","authors":"D. Comisky, S. Agarwala, Charles Fuoco","doi":"10.1109/ICCD.2000.878317","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878317","url":null,"abstract":"As frequency and processing capabilities of today's Digital Signal Processors (DSPs) are increasing, so is the needed data rate to fully utilize the available processing bandwidth. Moreover, high-end applications may require multiple DSP's on a single chip, further pushing the data rate requirements. There are varying external devices with which the processors may wish to communicate concurrently. A 'plug and play' like approach for external devices and a scalable high-performance multi-processor data rate solution would be highly desirable. In this paper, a scalable, high performance Direct Memory Access (DMA) architecture for all on-chip and off-chip data communication between multiple processors and various external devices is proposed. This architecture has been implemented on Texas Instruments TMS320C6211 C6x DSP.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506639","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}
Fabiano Hessel, P. Coste, G. Nicolescu, P. LeMarrec, N. Zergainoh, A. Jerraya
{"title":"Multi-level communication synthesis of heterogeneous multilanguage specification","authors":"Fabiano Hessel, P. Coste, G. Nicolescu, P. LeMarrec, N. Zergainoh, A. Jerraya","doi":"10.1109/ICCD.2000.878332","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878332","url":null,"abstract":"The complexity of modern embedded systems requires the cooperation of several teams belonging to different cultures and using different languages as well as the reuse of software, hardware and communication IP modules at the early design steps. The key issue for the design of such systems is the overall system validation and the synthesis of the communication between the different subsystems. In this paper we focus on the problem of multi-level communication synthesis and show the results of the application of this methodology on an example. Designers get feedback at all design steps via the cosimulation engine that permits fast evaluation.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122934583","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}
S. Agarwala, Charles Fuoco, T. Anderson, D. Comisky, Christopher Mobley
{"title":"A multi-level memory system architecture for high performance DSP applications","authors":"S. Agarwala, Charles Fuoco, T. Anderson, D. Comisky, Christopher Mobley","doi":"10.1109/ICCD.2000.878316","DOIUrl":"https://doi.org/10.1109/ICCD.2000.878316","url":null,"abstract":"With the explosion of Digital Signal Processor (DSP) applications, there is a constant requirement for increased processing capability. This in turn requires rapid performance scaling in both operations per cycle and cycles per second, both of which result in increased MIPS/MMACS/MFLOPs. The memory system has to sustain the increased frequency and bandwidth demands in order to meet the data requirements of the DSP. Traditionally, DSP system architectures have on-chip addressable RAM, which is accessible by both the central processing unit (CPU) and the direct memory access (DMA). However, RAM frequencies are not scaling along with CPU clock rates, and as a result only relatively small RAM sizes are able to meet the frequency goals. This is in direct contrast to the increasing program size requirements seen by DSP applications, which in turn require even more on-chip RAM. This paper proposes a solution which has caches and RAMs coexisting in a homogeneous environment and working seamlessly together allowing high frequencies while still maintaining the DSP goals of low cost and low power. This multi-level memory system architecture has been implemented on the Texas Instruments (TI) TMS320C6211 C6x DSP.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122746672","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}