2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)最新文献

筛选
英文 中文
Comprehensive die-level assessment of design rules and layouts 全面的模具级设计规则和布局评估
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742867
R. Ghaida, Yasmine Badr, Mukul Gupta, Ning Jin, Puneet Gupta
{"title":"Comprehensive die-level assessment of design rules and layouts","authors":"R. Ghaida, Yasmine Badr, Mukul Gupta, Ning Jin, Puneet Gupta","doi":"10.1109/ASPDAC.2014.6742867","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742867","url":null,"abstract":"Co-development of design rules and layout methodologies is the key to successful adoption of a technology. In this work, we propose Chip-level Design Rule Evaluator (ChipDRE), the first framework for systematic evaluation of design rules and their interaction with layouts, performance, margins and yield at the chip scale (as opposed to standard cell-level). A “good chips per wafer” metric is used to unify area, performance, variability and yield. The framework uses a generated virtual standard-cell library coupled with a mix of physical design, semi-empirical, and machine-learning-based models to estimate area and delay at the chip level. The result is a unified design-quality estimate that can be computed fast enough to allow using ChipDRE to optimize a large number of complex design rules. For instance, a study of well-to-active spacing rule reveals a non-monotone dependence of rule value to chip area (although the dependence to cell area is monotone) due to delay changes coming from well-proximity effect.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"2 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113977761","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}
引用次数: 10
Fast large-scale optimal power flow analysis for smart grid through network reduction 基于网络约简的智能电网大规模快速最优潮流分析
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742918
Yi Liang, Deming Chen
{"title":"Fast large-scale optimal power flow analysis for smart grid through network reduction","authors":"Yi Liang, Deming Chen","doi":"10.1109/ASPDAC.2014.6742918","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742918","url":null,"abstract":"Optimal power flow (OPF) plays an important role in power system operation. The emerging smart grid aims to create an automated energy delivery system that enables two-way flows of electricity and information. As a result, it will be desirable if OPF can be solved in real time in order to allow the implementation of the time-sensitive applications, such as real-time pricing. In this paper, we present a novel algorithm to accelerate the computation of alternating current optimal power flow (ACOPF) through power system network reduction (NR). We formulate the OPF problem based on an equivalent reduced system and interpret its solution and the detailed optimal dispatch for the original power system is obtained afterwards using a distributed algorithm. Our results are compared with two widely used methods: full ACOPF and the linearized OPF with DC power flow and lossless network assumption, the so-called DCOPF. Experimental results show that for a large power system, our method achieves 7.01X speedup over ACOPF with only 1.72% error, and is 75.7% more accurate than the DCOPF solution. Our method is even 10% faster than DCOPF. Our experimental results demonstrate the unique strength of the proposed technique for fast, scalable, and accurate OPF computation. We also show that our method is effective for smaller benchmarks.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116619340","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}
引用次数: 3
Array scalarization in high level synthesis 高级合成中的阵列标量化
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742960
P. Panda, Namita Sharma, Arun Kumar Pilania, G. Krishnaiah, S. Subramoney, Ashok Jagannathan
{"title":"Array scalarization in high level synthesis","authors":"P. Panda, Namita Sharma, Arun Kumar Pilania, G. Krishnaiah, S. Subramoney, Ashok Jagannathan","doi":"10.1109/ASPDAC.2014.6742960","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742960","url":null,"abstract":"Parallelism across loop iterations present in behavioral specifications can typically be exposed and optimized using well known techniques such as Loop Unrolling. However, since behavioral arrays are usually mapped to memories (SRAM) during synthesis, performance bottlenecks arise due to memory port constraints. We study array scalarization, the transformation of an array into a group of scalar variables. We propose a technique for selectively scalarizing arrays for improving the performance of synthesized designs by taking into consideration the latency benefits as well as the area overhead caused by using discrete registers for storing array elements instead of denser SRAM. Our experiments on several benchmark examples indicate promising speedups of more than 10x for several designs due to scalarization.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"435 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123418380","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}
引用次数: 2
A read-write aware DRAM scheduling for power reduction in multi-core systems 一种在多核系统中用于降低功耗的读写感知DRAM调度
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742957
Chih-Yen Lai, Gung-Yu Pan, Hsien-Kai Kuo, Jing-Yang Jou
{"title":"A read-write aware DRAM scheduling for power reduction in multi-core systems","authors":"Chih-Yen Lai, Gung-Yu Pan, Hsien-Kai Kuo, Jing-Yang Jou","doi":"10.1109/ASPDAC.2014.6742957","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742957","url":null,"abstract":"The demand of high performance and low power has increased the importance of power efficiency in multi-core systems. In modern multi-core architectures, DRAM has dominated the power consumption and therefore reordering based DRAM scheduling has been intensively studied to reduce the power. However, the benefit of reordering is not fully explored by the previous studies. To further reduce the power, this paper proposes the read-write reordering and the read-write aware throttling. When compared to the existing work, the proposed techniques reduce 10% more DRAM power with less performance degradation.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874535","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}
引用次数: 5
Bounding buffer space requirements for real-time priority-aware networks 实时优先级感知网络的边界缓冲空间需求
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742875
H. Kashif, Hiren D. Patel
{"title":"Bounding buffer space requirements for real-time priority-aware networks","authors":"H. Kashif, Hiren D. Patel","doi":"10.1109/ASPDAC.2014.6742875","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742875","url":null,"abstract":"One implementation alternative for network interconnects in modern chip-multiprocessor systems is priority-aware arbitration networks. To enable the deployment of real-time applications to priority-aware networks, recent research proposes worst-case latency (WCL) analyses for such networks. Buffer space requirements in priority-aware networks, however, are seldom addressed. In this work, we bound the buffer space required for valid WCL analyses and consequently optimize router design for application specifications by computing the required buffer space at each virtual channel in priority-aware routers. In addition to the obvious advantage of bounding buffer space while providing valid WCL bounds, buffer space reduction decreases chip area and saves energy in priority-aware networks. Our experiments show that the proposed buffer space computation reduces the number of unfeasible implementations by 42% compared to an existing buffer space analysis technique. It also reduces the required buffer space in priority-aware routers by up to 79%.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691606","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}
引用次数: 16
Power minimization of pipeline architecture through 1-cycle error correction and voltage scaling 通过1周期误差校正和电压缩放实现管道架构的功耗最小化
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742886
Insup Shin, Jae-Joon Kim, Youngsoo Shin
{"title":"Power minimization of pipeline architecture through 1-cycle error correction and voltage scaling","authors":"Insup Shin, Jae-Joon Kim, Youngsoo Shin","doi":"10.1109/ASPDAC.2014.6742886","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742886","url":null,"abstract":"We present a new 1-cycle timing error correction method, which enables aggressive voltage scaling in a pipelined architecture. The proposed method differs from the state-of-the-art in that the pipeline stage where the timing error occurs can continue to receive input data without halting to avoid data collision. The feature allows the pipeline to avoid recurring clock gating when timing errors happen at multiple stages or timing errors continue to occur at a certain stage. Compared to a state-of-the-art method, the proposed method shows 2-6% energy reduction for a 5-stage pipeline and 7-11% reduction for a 10-stage pipeline. In addition, the proposed logic to propagate clock gating signal is much simpler than that of the previous method [1] by eliminating reverse propagation path of clock gating signal.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"197 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124716365","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}
引用次数: 2
Synthesis of power- and area-efficient binary machines for incompletely specified sequences 非完全指定序列的功率效率和面积效率二进制机器的综合
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742962
Nan Li, E. Dubrova
{"title":"Synthesis of power- and area-efficient binary machines for incompletely specified sequences","authors":"Nan Li, E. Dubrova","doi":"10.1109/ASPDAC.2014.6742962","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742962","url":null,"abstract":"Binary Machines (BMs) are a generalization of Linear Feedback Shift Registers (LFSRs) in which a current state is a nonlinear function of the previous state. It is known how to construct a BM generating a given completely specified binary sequence. In this paper, we present an algorithm which can efficiently handle the case of incompletely specified sequences. Our experimental results show that it significantly outperforms the approaches based on all-0 or random fill in both area and power dissipation. On average, it reduces dynamic power dissipation twice compared to all-0 fill approach and 6 times compared to random fill approach. The presented algorithm can potentially be useful for many applications, including Logic Built-In Self Test (LBIST).","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131753985","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}
引用次数: 2
Normally-off technologies for healthcare appliance 用于医疗设备的正常关闭技术
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742853
S. Izumi, H. Kawaguchi, M. Yoshimoto, Y. Fujimori
{"title":"Normally-off technologies for healthcare appliance","authors":"S. Izumi, H. Kawaguchi, M. Yoshimoto, Y. Fujimori","doi":"10.1109/ASPDAC.2014.6742853","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742853","url":null,"abstract":"Battery mass and power consumption of wearable system must be reduced because the key factors affecting wearable system usability are miniaturization and weight reduction. This report describes a wearable biosignal monitoring system using normally-off technologies to minimize the power consumption. Especially we focused on daily-life monitoring and electrocardiograph (ECG) processor. Our system employs Ferroelectric Random Access Memory (FeRAM) and Near Field Communication (NFC) for normally-off data logging and normally-off data communication. A robust heart rate monitor and Cortex M0 core are used to on-node processing for logging data reduction.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"521 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131868624","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}
引用次数: 3
QoS-aware dynamic resource allocation for spatial-multitasking GPUs 空间多任务gpu的qos感知动态资源分配
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742976
Paula Aguilera, Katherine Morrow, N. Kim
{"title":"QoS-aware dynamic resource allocation for spatial-multitasking GPUs","authors":"Paula Aguilera, Katherine Morrow, N. Kim","doi":"10.1109/ASPDAC.2014.6742976","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742976","url":null,"abstract":"General-purpose computing on GPUs (GPGPU computing) is becoming widely adopted; however, some GPGPU applications fail to fully utilize GPU resources. In these cases, spatial multitasking better exploits the parallelism offered by GPUs by partitioning the GPU resources among simultaneously-running applications. When one or more such applications have quality-of-service (QoS) requirements, enough resources must be allocated for those applications to satisfy their requirements. Remaining resources can be either disabled to reduce power consumption or used to accelerate other applications. However, we observe that the amount of resources for a QoS application to satisfy its performance requirement is dependent in part upon the co-executing applications. In this paper, we propose a runtime technique to dynamically partition GPU resources between concurrently running applications - at least one of which has a QoS requirement. We demonstrate that the proposed technique can satisfy a 100% QoS requirement while also achieving either a 7W power consumption reduction or a 17.57% performance improvement for co-executing best-effort applications.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133435031","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}
引用次数: 42
Storage-less and converter-less maximum power point tracking of photovoltaic cells for a nonvolatile microprocessor 非易失性微处理器的光伏电池无存储和无转换器最大功率点跟踪
2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) Pub Date : 2014-02-20 DOI: 10.1109/ASPDAC.2014.6742919
Cong Wang, N. Chang, Younghyun Kim, Sangyoung Park, Yongpan Liu, H. Lee, Rong Luo, Huazhong Yang
{"title":"Storage-less and converter-less maximum power point tracking of photovoltaic cells for a nonvolatile microprocessor","authors":"Cong Wang, N. Chang, Younghyun Kim, Sangyoung Park, Yongpan Liu, H. Lee, Rong Luo, Huazhong Yang","doi":"10.1109/ASPDAC.2014.6742919","DOIUrl":"https://doi.org/10.1109/ASPDAC.2014.6742919","url":null,"abstract":"This paper pioneers the maximum power point tracking (MPPT) of photovoltaic (PV) cells that directly supply power to a microprocessor without an energy storage element (a battery or a large-size capacitor) nor power converters. The maximum power point tracking is conventionally performed by an MPPT charger that stores in the energy storage element, and a voltage regulator (typically a DC-DC converter) produces a proper voltage level for the microprocessor. The energy storage element is an energy buffer and makes it possible to perform MPPT of the PV cells and power management of the microprocessor independently. However, the energy storage element, MPPT charger and DC-DC converter cause seriously limited lifetime (when a typical battery is adopted), significant energy loss (typically over 20%), increased weight/volume and high cost, etc. The proposed method enables extremely fine-grain dynamic power management (DPM) in every a few hundred microseconds and performs the MPPT without using an MPPT charger and a DC-DC converter as well as an energy storage element. We achieve 84.5% of energy harvesting efficiency using the proposed setup with huge reduction in cost, weight and volume, and extended lifetime, which is not even numerically comparable with conventional MPPT methods.","PeriodicalId":234635,"journal":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125072928","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}
引用次数: 64
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书