International Conference on Green Computing最新文献_第3页

Ultra low energy standard cell design optimization for performance and placement algorithm 超低能耗标准电池设计优化的性能和放置算法

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598273

S. Amarchinta, D. Kudithipudi

引用次数: 2

An analysis of the energy efficiency of multi-threading on multi-core machines 多核机器上多线程的能效分析

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598301

Chengling Tseng, S. Figueira

引用次数: 8

Bounded skew clock routing for 3D stacked IC designs: Enabling trade-offs between power and clock skew 用于3D堆叠IC设计的有界倾斜时钟路由:实现功率和时钟倾斜之间的权衡

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598269

Tak-Yung Kim, Taewhan Kim

{"title":"Bounded skew clock routing for 3D stacked IC designs: Enabling trade-offs between power and clock skew","authors":"Tak-Yung Kim, Taewhan Kim","doi":"10.1109/GREENCOMP.2010.5598269","DOIUrl":"https://doi.org/10.1109/GREENCOMP.2010.5598269","url":null,"abstract":"This paper addresses a bounded skew clock routing problem in 3D stacked IC designs to enable effective trade-offs between power and clock skew. The existing 3D clock tree synthesis (CTS) techniques for power and temperature management solve the clock routing problem in two steps: (step 1) constructing a zero skew clock tree and (step 2) restructuring the clock tree to minimize the increased clock skew caused by temperature variation. Unlike the previous works, this paper provides various solutions for step 1 by relaxing skew bound rather than one (possibly extreme) solution, so that the task of step 2 is more amenable and effective by reduced or controlled power in step 1. To this end, we propose an algorithm, called BSTDME-3D (bounded skew clock tree with deffered merge embedding for 3D ICs), to solve the bounded skew clock tree embedding problem in 3D ICs for a given tree topology. By utilizing the proposed clock tree embedding algorithm, we setup the (un)buffered 3D CTS flow under a (non-)zero skew bound, and study impacts of skew bound on total wirelength and thus clock power consumption. From the extensive experiments, it is shown that the unbuffered CTS with 100ps skew bound reduces 3D clock wirelength by 16% on average for the 4-die stacked 3D ICs. The buffered CTS with 100ps skew bound reduces 3D clock wirelength by 18%, buffer resource by 25%, and thereby clock power consumption by 16% on average for the 4-die stacked 3D ICs.","PeriodicalId":262148,"journal":{"name":"International Conference on Green Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114985065","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}

引用次数: 11

Optimizing performance and energy in computational grids using non-cooperative game theory 利用非合作博弈论优化计算网格的性能和能量

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598293

J. Wilkins, I. Ahmad, Hafiz Fahad Sheikh, S. Khan, S.A. Rajput

{"title":"Optimizing performance and energy in computational grids using non-cooperative game theory","authors":"J. Wilkins, I. Ahmad, Hafiz Fahad Sheikh, S. Khan, S.A. Rajput","doi":"10.1109/GREENCOMP.2010.5598293","DOIUrl":"https://doi.org/10.1109/GREENCOMP.2010.5598293","url":null,"abstract":"There is a lack of generally applicable methods for reducing energy consumption while ensuring good quality of service in distributed computational grids. We study the energy-aware task allocation problem for assigning a set of tasks onto the machines in a grid environment where the conflicting goals of ensuring quality of service and reducing energy consumption makes the machines compete with each other. We propose bidding mechanisms in which the machines have to win in order to maintain a minimum fitness value and thus remain relevant to the system and hence must try their best to meet the goals. The grid manager keeps only those machines that win and eliminate from the pool the ones that are unfit. The proposed algorithm encompasses bidding strategies, fitness calculations, penalties, exit as well as resurrection mechanisms to support a non-cooperative game in which all machines compete to win tasks. The concept of fitness is fundamental to our algorithm, defining a machine's ability to remain in the system. When heterogeneous machines are part of a shared computing resource pool governed by a grid economy, the proposed approach fits very well for achieving conflicting goals. By simulating several machines with diverse architectures and task sets with varying requirements, we demonstrate the effectiveness of the proposed scheme and show that it generates short task makespans and reduced energy consumption. The algorithm is extremely fast, takes highly detailed machine and task characteristics into consideration, and outperforms the Earliest Deadline First Scheme in every aspect.","PeriodicalId":262148,"journal":{"name":"International Conference on Green Computing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128081407","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}

引用次数: 7

Thermal constrained workload distribution for maximizing throughput on multi-core processors 用于在多核处理器上最大化吞吐量的热约束工作负载分布

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598302

Zhe Wang, S. Ranka

引用次数: 10

Quantifying the impact of GPUs on performance and energy efficiency in HPC clusters 量化gpu对高性能计算集群性能和能效的影响

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598297

J. Enos, C. Steffen, Joshi Fullop, M. Showerman, Guochun Shi, K. Esler, V. Kindratenko, J. Stone, James C. Phillips

引用次数: 46

Reliability/wearout-aware design 可靠性/ wearout-aware设计

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598272

M. Stan

引用次数: 0

CMOS nanophotonics for exascale systems 百亿亿级系统的CMOS纳米光子学

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598267

M. McLaren

引用次数: 0

Battery energy consumption footprint of embedded multimedia systems 嵌入式多媒体系统的电池能耗足迹

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598264

Jiucai Zhang, S. Ci, Xueyi Wang

引用次数: 0

Avoiding energy wastage in parallel applications 避免并行应用中的能源浪费

International Conference on Green Computing Pub Date : 2010-08-15 DOI: 10.1109/GREENCOMP.2010.5598314

V. Korthikanti, G. Agha

{"title":"Avoiding energy wastage in parallel applications","authors":"V. Korthikanti, G. Agha","doi":"10.1109/GREENCOMP.2010.5598314","DOIUrl":"https://doi.org/10.1109/GREENCOMP.2010.5598314","url":null,"abstract":"We propose a methodology to analyze algorithms in order to reduce energy waste in executing applications. Our methodology is based on three observations. First, the relation between power and frequency of a single core is approximately cubic. Thus it may be possible to run an application slower on a core in order to save energy. In the case of a parallel architecture, one has to also factor the effect (on performance and energy consumption) of the interaction between cores. Second, multicore architectures which aggressively manage power consumption by allowing cores to be operated at reduced frequencies are being developed. This means that parallel applications on a multicore architecture can be executed using a variable number of cores running at different frequencies-affecting both the performance of the application and the energy required to execute it. Lastly, there is a certain benefit (positive utility) in running an application faster and a cost (negative utility) in terms of the energy consumed. Expending energy that does not contribute to the overall utility wastes the energy. The precise trade-off between performance and energy consumption depends on the structure of a parallel algorithm and the associated utilities. We describe a methodology to do this trade-off and illustrate it with several parallel algorithms.","PeriodicalId":262148,"journal":{"name":"International Conference on Green Computing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660368","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