{"title":"Applying caching to two-level adaptive branch prediction","authors":"C. Egan, G. Steven, W. Shim, L. Vintan","doi":"10.1109/DSD.2001.952280","DOIUrl":"https://doi.org/10.1109/DSD.2001.952280","url":null,"abstract":"During the 1990s Two-level Adaptive Branch Predictors were developed to meet the requirement for accurate branch prediction in high-performance superscale processors. However, while two-level adaptive predictors achieve very high prediction rates, they tend to be very costly. In particular, the size of the second level Pattern History Table (PHT) increases exponentially as a function of history register length. Furthermore, many of the prediction counters in a PHT are never used; predictions are frequently generated from non-initialised counters and several branches may update the same counter, resulting in interference between branch predictions. In this paper, we propose a Cached Correlated Two-Level Branch Predictor in which the PHT is replaced by a Prediction Cache. Unlike a PHT, the Prediction Cache saves only relevant branch prediction information. Furthermore, predictions are never based on uninitialised entries and interference between branches is eliminated. We simulate three versions of our Cached Correlated Branch Predictors. The first predictor is based on global branch history information while the second is based on local branch history information. The third predictor exploits the ability of cached predictors to combine both global and local history information in a single predictor. We demonstrate that our predictors deliver higher accuracy than conventional predictors at a significantly lower cost.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125510880","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":"Synthesis of sequential circuits on programmable logic devices based on new models of finite state machines","authors":"S. Valeri","doi":"10.1109/DSD.2001.952274","DOIUrl":"https://doi.org/10.1109/DSD.2001.952274","url":null,"abstract":"In this paper, new models, called class A, class B, class C, and class D, of a finite state machine (FSM) are proposed. This permits to effectively use both properties of FSM and architectural opportunities of PLD. The synthesis methods for each class of FSM are also presented. Experimental results on benchmarks showed that the choice of the synthesis method for suitable FSM class has the highest influence on the cost of realisation of FSM on PLD. The cost of realisation on PLD of the same examples for various FSM classes can be different more than 8 times.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123992151","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":"Design and implementation of reconfigurable processor for problems of combinatorial computations","authors":"I. Skliarova, A. Ferrari","doi":"10.1109/DSD.2001.952250","DOIUrl":"https://doi.org/10.1109/DSD.2001.952250","url":null,"abstract":"The paper analyses different techniques that might be employed in order to solve various problems of combinatorial optimization and argues that the best results can be achieved by the use of software, running on a general-purpose computer, together with an FPGA-based reconfigurable co-processor. It suggests architecture of combinatorial co-processor, which is based on hardware templates and consists of reconfigurable functional and control units. Finally the paper demonstrates how to utilize the co-processor for two practical applications formulated over discrete matrices that are satisfiability and covering problems.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114449288","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":"Two-criterial constraint-driven FSM state encoding for low power","authors":"M. Koegst, Steffen Rülke, G. Franke, M. Avedillo","doi":"10.1109/DSD.2001.952123","DOIUrl":"https://doi.org/10.1109/DSD.2001.952123","url":null,"abstract":"In this paper we propose a new state encoding approach for power reduction of digital controllers. We utilize in the encoding procedure two optimization parameters simultaneously: area and register switching rate. The area is approximated by the number of rows in the FSM controller specification. Our approach for power reduction exploits an adapted encoding strategy and provides a proper trade-off regarding both parameters. A couple of experimental results show the practicability of our approach.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994895","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":"Optimisation of PPMC model for hardware implementation","authors":"C. F. Uribe, S. R. Jones","doi":"10.1109/DSD.2001.952251","DOIUrl":"https://doi.org/10.1109/DSD.2001.952251","url":null,"abstract":"The development of new and more powerful applications in data communications and computer systems has required an ever-increasing capacity to handle large amounts of data. Lossless data compression techniques have been developed to exploit further available bandwidth of such systems by reducing the amount of data to transmit or store. They have been implemented in both software and hardware. The former approach provides good compression ratios but presents speed limitations. The latter approach offers the possibility of high-speed compression to suit the most demanding applications. Current available hardware implementations are based mainly on LZ (Lempel-Ziv) class of compression schemes. Experience suggests that classical statistical methods, particularly PPM (Prediction by Partial Matching) class of algorithms, are impractical for being too slow and resource hungry for hardware realisation. However, there seems to have been relatively little work looking at the potential for reorganising and restructuring the algorithm for hardware implementation. This paper presents a version of the PPMC class of algorithms structured for efficient hardware support and analyses the issues of its hardware implementation.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125804809","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":"Timing driven wiring on an advanced microprocessor","authors":"P. Kartschoke, S. Geissler","doi":"10.1109/DSD.2001.952352","DOIUrl":"https://doi.org/10.1109/DSD.2001.952352","url":null,"abstract":"The effect of wire delay within critical timing paths is becoming an increasing problem. By comparing the large improvement of transistor performance, due to shrinking L/sub eff/ or new technology such as silicon on insulator, versus the smaller improvements of wire delay, such as copper wires and better dielectrics, it can be seen that the wiring within an advanced microprocessor will become a more dominant portion of the critical paths. In deep sub-micron designs it is crucial to analyze and improve any wire dominated paths while assuming that the transistor delay continues to improve. This paper describes wire related improvements, such as an algorithmic wiring approach, wire bending and clock skew reduction that is used in the timing convergence of an advanced PowerPC microprocessor. The impact of wiring improvements is evaluated on the timing, clocking and wireability of the microprocessor.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130369363","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":"Pipelined genetic architecture with fitness on the fly","authors":"Aitor Ibarra, J. Lanchares, J. Hidalgo, F. Saenz","doi":"10.1109/DSD.2001.952340","DOIUrl":"https://doi.org/10.1109/DSD.2001.952340","url":null,"abstract":"One of the main bottlenecks in Genetics Algorithms is the fitness evaluation for each individual. In this work, we propose a new fitness evaluation method, which will solve the bottleneck calculating a fitness on the fly.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130871779","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":"Hierarchical modeling and verification of embedded systems","authors":"L. Cortés, P. Eles, Zebo Peng","doi":"10.1109/DSD.2001.952119","DOIUrl":"https://doi.org/10.1109/DSD.2001.952119","url":null,"abstract":"In order to represent efficiently large systems, a mechanism for hierarchical composition is needed so that the model may be constructed in a structured manner and composed of simpler units easily comprehensible by the designer at each description level. In this paper we formally define the notion of hierarchy for a Petri net based representation used for modeling embedded systems. We show how small parts of a large system may be transformed by using the concept of hierarchy and the advantages of a transformational approach in the verification of embedded systems. A real-life example illustrates the feasibility of our approach on practical applications.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133729296","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":"Synchronizing low-cost energy aware sensors in a short-range wireless cell","authors":"M. Nordman, W. Kozlowski, O. Vähämäki","doi":"10.1109/DSD.2001.952362","DOIUrl":"https://doi.org/10.1109/DSD.2001.952362","url":null,"abstract":"Time management and synchronization in distributed systems has been studied thoroughly for many years. Basically the goal has bene to close the gap between local clocks of distributed devices. In systems that need to be both low cost and low power the devices sleep most of the time making standard CMOS timers impractical to use. Instead, imprecise RC oscillators are used to manage the wake up cycles. However, there is also a need to provide time management and synchronization in these systems. This is difficult with RC oscillators being the main device clock references. In this paper we propose a method that uses event timestamps to synchronize low cost, low power sensors with RC oscillators. The method relies on the cooperation of sensors in a wireless cell and a boundary node, which collects data from the sensors. Initial evaluation of the method shows that it is promising and possible can provide good synchronization with greater flexibility, lower costs and less energy than standard CMOS timers.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115629245","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":"Combining languages in embedded system design","authors":"R. Ernst","doi":"10.1109/DSD.2001.952118","DOIUrl":"https://doi.org/10.1109/DSD.2001.952118","url":null,"abstract":"Often, several languages with different underlying models of computation are used in the design of an individual embedded system. The languages are selected because of their particular suitability for certain applications and optimizations, or because they have become generally accepted as a standard within an application field. The lack of coherency of the computational semantics, methods and tools is a significant obstacle on the way to higher design productivity and design quality. A similar problem occurs when reused components shall be integrated, possibly described in another language and incompletely documented. Examples are reused components or “legacy code.” The talk will start with a short overview of important models of computation. Then, different techniques to consistently combine model semantics are presented. We explain how to use such models for system analysis and scheduling. The embedded tutorial will conclude that unified languages are no necessity in system design and that a single language will face similar problems in system optimization as a combination of current system design languages.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657058","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}