{"title":"What's smart about the smart grid?","authors":"I. Hiskens","doi":"10.1145/1837274.1837510","DOIUrl":"https://doi.org/10.1145/1837274.1837510","url":null,"abstract":"The paper explores the meaning of smart grid, concluding that the term is closely linked with enhanced sensing, actuation and control of power systems. It is suggested that such cyber-physical systems would be more meaningfully described as responsive grids. The paper provides a brief historical perspective of the decision-making that underlies existing, seemingly inflexible, grid structures. It emphasizes the future needs for responsive grids, as a consequence of inevitable growth in renewable generation and newer types of loads such as plug-in electric vehicles. The paper considers the cyber-infrastructure requirements for supporting controllability of highly distributed generation and load resources.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"2 1","pages":"937-939"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72746610","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":"Clock tree synthesis under aggressive buffer insertion","authors":"Ying-Yu Chen, Chen Dong, Deming Chen","doi":"10.1145/1837274.1837297","DOIUrl":"https://doi.org/10.1145/1837274.1837297","url":null,"abstract":"In this paper, we propose a maze-routing-based clock tree routing algorithm integrated with buffer insertion, buffer sizing and topology generation that is able to consider general buffer insertion locations in order to achieve robust slew control. Buffer insertion along routing paths had been mostly avoided previously due to the difficulty to maintain low skew under such aggressive buffer insertion. We develop accurate timing analysis engine for delay and slew estimation and a balanced routing scheme for better skew reduction during clock tree synthesis. As a result, we can perform aggressive buffer insertion with buffer sizing and maintain accurate delay information and low skew. Experiments show that our synthesis results not only honor the hard slew constraints but also maintain reasonable skew.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"32 1","pages":"86-89"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74054426","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":"Trace-driven optimization of networks-on-chip configurations","authors":"A. Kahng, Bill Lin, K. Samadi, R. Ramanujam","doi":"10.1145/1837274.1837384","DOIUrl":"https://doi.org/10.1145/1837274.1837384","url":null,"abstract":"Networks-on-chip (NoCs) are becoming increasingly important in general-purpose and application-specific multi-core designs. Although uniform router configurations are appropriate for general-purpose NoCs, router configurations for application-specific NoCs can be non-uniformly optimized to application-specific traffic characteristics. In this paper, we specifically consider the problem of virtual channel (VC) allocation in application-specific NoCs. Prior solutions to this problem have been average-rate driven. However, average-rate models are poor representations of real application traffic, and can lead to designs that are poorly matched to the application. We propose an alternate trace-driven paradigm in which configuration of NoCs is driven by application traces. We propose two simple greedy trace-driven VC allocation schemes. Compared to uniform allocation, we observe up to 51% reduction in the number of VCs under a given average packet latency constraint, or up to 74% reduction in average packet latency with same number of VCs. Our results suggest that average-rate driven methods cannot effectively select appropriate links for VC allocation because they fail to consider the impact of traffic bursts. As a case study, we compare our proposed approach with an existing average-rate driven method and observe up to 35% reduction in the number of VCs for a given target latency.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"25 1","pages":"437-442"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84626848","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}
Yiyuan Xie, M. Nikdast, Jiang Xu, Wei Zhang, Qi Li, Xiaowen Wu, Yaoyao Ye, Xuan Wang, Weichen Liu
{"title":"Crosstalk noise and bit error rate analysis for optical network-on-chip","authors":"Yiyuan Xie, M. Nikdast, Jiang Xu, Wei Zhang, Qi Li, Xiaowen Wu, Yaoyao Ye, Xuan Wang, Weichen Liu","doi":"10.1145/1837274.1837441","DOIUrl":"https://doi.org/10.1145/1837274.1837441","url":null,"abstract":"Crosstalk noise is an intrinsic characteristic of photonic devices used by optical networks-on-chip (ONoCs) as well as a potential issue. For the first time, this paper analyzed and modeled the crosstalk noise, signal-to-noise ratio (SNR), and bit error rate (BER) of optical routers and ONoCs. The analytical models for crosstalk noise, minimum SNR, and maximum BER in mesh-based ONoCs are presented. An automated crosstalk analyzer for optical routers is developed. We find that crosstalk noise significantly limits the scalability of ONoCs. For example, due to crosstalk noise, the maximum BER is 10−3 on the 8×8 mesh-based ONoC using an optimized crossbar-based optical router. To achieve the BER of 10−9 for reliable transmissions, the maximum ONoC size is 6×6. A novel compact high-SNR optical router is proposed to improve the maximum ONoC size to 8×8.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"10 1 1","pages":"657-660"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79671031","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":"Thermal monitoring of real processors: Techniques for sensor allocation and full characterization","authors":"Abdullah Nazma Nowroz, Ryan Cochran, S. Reda","doi":"10.1145/1837274.1837291","DOIUrl":"https://doi.org/10.1145/1837274.1837291","url":null,"abstract":"The increased power densities of multi-core processors and the variations within and across workloads lead to runtime thermal hot spots locations of which change across time and space. Thermal hot spots increase leakage, deteriorate timing, and reduce the mean time to failure. To manage runtime thermal variations, circuit designers embed within-die thermal sensors that acquire temperatures at few selected locations. The acquired temperatures are then used to guide runtime thermal management techniques. The capabilities of these techniques are essentially bounded by the spatial thermal resolution of the sensor measurements. In this paper we characterize temperature signals of real processors and demonstrate that on-chip thermal gradients lead to sparse signals in the frequency domain. We exploit this observation to (1) devise thermal sensor allocation techniques, and (2) devise signal reconstruction techniques that fully characterize the thermal status of the processor using the limited number of measurements from the thermal sensors. To verify the accuracy of our methods, we compare our temperature characterization results against thermal measurements acquired from a state-of-the-art infrared camera that captures the mid-band infrared emissions from the back of the die of a 45 nm dual-core processor. Our results show that our techniques are capable of accurately characterizing the temperatures of real processors.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"73 1","pages":"56-61"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80544236","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":"Reliability aware power management for dual-processor real-time embedded systems","authors":"R. Sridharan, R. Mahapatra","doi":"10.1145/1837274.1837480","DOIUrl":"https://doi.org/10.1145/1837274.1837480","url":null,"abstract":"Primary-Backup (PB) model has been a widely used model for reliability in dual-processor real-time systems. In recent literature, there have been a few works focussing on minimizing energy consumption of periodic task sets executing on such systems. One of the major drawbacks of these works is that they ignore the effects of frequency-scaling on fault arrival rates. In this paper, we present a modified Primary-Backup model for dual-processor systems that aims to maintain the reliability when employing power management techniques to minimize the overall energy consumption. Furthermore, the proposed approach exploits the uncertainties in the execution time of real-time tasks to better predict the available slack for energy management. The proposed modified PB-based Reliability-Aware Power Management (RAPM) approach was tested with synthetic task sets on both homogeneous and heterogeneous dual-processor systems. Simulation results show that it can achieve up to 67 % savings in expected energy consumption for low utilization task sets and up to 32 % savings for high utilization task sets without any loss in reliability in heterogeneous dual-processor systems.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"21 1","pages":"819-824"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90456125","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. Bansal, J. Rey, A. Yang, Myung-Soo Jang, L. C. Lu, P. Magarshack, P. Marchal, R. Radojcic
{"title":"3-D stacked die: Now or future?","authors":"S. Bansal, J. Rey, A. Yang, Myung-Soo Jang, L. C. Lu, P. Magarshack, P. Marchal, R. Radojcic","doi":"10.1145/1837274.1837350","DOIUrl":"https://doi.org/10.1145/1837274.1837350","url":null,"abstract":"The continuation of Moore's law by conventional CMOS scaling is becoming challenging. 3D Packaging with 3D through silicon vias (TSV) interconnects is showing promise for extending scaling using mature silicon technology, providing another path towards the \"More than Moore\". Two years ago, the big unceasing question was \"Why 3D?\" Today, as we move forward with the concrete implementation of the technology, the questions are now \"When 3D?\" and \"How 3D?\" There are quite a few brave souls who have taken this disruptive interconnect technology and are investing in it today to gain benefit from it. However, for many the lingering questions remain \"Are we there yet?\" \"Is it now or the future?\" This panel brings together key thought leaders in the area of 3D Packaging with 3D TSV interconnects to tell us how they see 3D IC shaping up in the coming year(s) and the challenges that lie ahead associated with TSV in practical design.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"28 1","pages":"298-299"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89278452","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":"Multi-threaded collision-aware global routing with bounded-length maze routing","authors":"Wen-Hao Liu, Wei-Chun Kao, Yih-Lang Li, Kai-Yuan Chao","doi":"10.1145/1837274.1837324","DOIUrl":"https://doi.org/10.1145/1837274.1837324","url":null,"abstract":"Modern global routers use various routing methods to improve routing speed and the quality. Maze routing is the most time-consuming process for existing global routing algorithms. This paper presents two bounded-length maze routing (BLMR) algorithms (optimal-BLMR and heuristic-BLMR) to perform much faster routing than traditional maze routing algorithms. The proposed sequential global router, which adopts a heuristic-BLMR, identifies less-wirelength routing results with less runtime than state-of-the-art global routers. This study also proposes a parallel multi-threaded collision-aware global router based on a previous sequential global router. Unlike the conventional partition-based concurrency strategy, the proposed algorithm uses a task-based concurrency strategy. Experimental results reveal that the proposed sequential global router uses less wirelength and runs about 1.9X to 18.67X faster than other state-of-the-art global routers. Compared to the proposed sequential global router, the proposed parallel global router yields almost the same routing quality with average 2.71 and 3.12-fold speedup on overflow-free and hard-to-route benchmarks, respectively, when running on an Intel quad-core system.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"42 1","pages":"200-205"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86683757","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":"Electronic design automation for social networks","authors":"A. DeOrio, V. Bertacco","doi":"10.1145/1837274.1837429","DOIUrl":"https://doi.org/10.1145/1837274.1837429","url":null,"abstract":"Online social networks are a growing internet phenomenon: they connect millions of individuals through sharing of common interests, political and religious views, careers, etc. Social networking websites are observing an ever-increasing number of regular users, who rely on this virtual medium to connect with friends and share in the community. As a result, they have become the repository of a vast amount of demographic information, which could deliver valuable insights to businesses and individuals. However, as of today, this data is for the most part still untapped, partly because of the complexity entailed by analyzing some of these vast social connectivity graphs. Another area that deals with large data sets is Electronic Design Automation (EDA), the result of increasingly complex computer systems. The powerful tools used to deal with these data sets open many possibilities for social networks. In this work we propose to study interesting aspects of social networks by deploying some of the solutions commonly used in EDA.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"59 1","pages":"621-622"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87924700","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":"Cost-aware three-dimensional (3D) many-core multiprocessor design","authors":"Jishen Zhao, Xiangyu Dong, Yuan Xie","doi":"10.1145/1837274.1837308","DOIUrl":"https://doi.org/10.1145/1837274.1837308","url":null,"abstract":"The emerging three-dimensional integrated circuit (3D IC) is beneficial for various applications from both area and performance perspectives. While the general trend in processor design has been shifting from multi-core to many-core, questions such as whether 3D integration should be adopted, and how to choose among various design options must be addressed at the early design stage. In order to guide the final design towards a cost-effective direction, system-level cost evaluation is one of the most critical issues to be considered. In this paper, we propose a 3D many-core multiprocessor cost model, which includes wafer, bonding, package, and cooling cost analysis. Using the proposed cost model, we evaluate the optimal partitioning strategies for 16−, 32− and 64-core multiprocessors from the cost point of view.","PeriodicalId":87346,"journal":{"name":"Proceedings. Design Automation Conference","volume":"143 1","pages":"126-131"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85755193","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}