Architecture and Compiler Support for GPUs Using Energy-Efficient Affine Register Files

2018 ◽  
Vol 23 (2) ◽  
pp. 1-25 ◽  
Author(s):  
Shao-Chung Wang ◽  
Li-Chen Kan ◽  
Chao-Lin Lee ◽  
Yuan-Shin Hwang ◽  
Jenq-Kuen Lee
Keyword(s):  
Energy Efficient ◽  
Compiler Support ◽  
Register Files

AN ENERGY-EFFICIENT DEMAND-DRIVEN REGISTER FILE FOR MOBILE GPUs

2014 ◽  
Vol 23 (02) ◽  
pp. 1450021
Author(s):  
CHIH-CHIEH HSIAO ◽  
CHIU-CHENG HSIEH ◽  
SLO-LI CHU
Keyword(s):  
Energy Efficient ◽  
Register File ◽  
Data Parallel ◽  
On Demand ◽  
Management Scheme ◽  
Long Latency ◽  
Register Files ◽  
Multiple Power ◽  
3D Applications ◽  
Mobile Gpus

In response to the remarkable increase in 3D applications in mobile devices in recent years, mobile GPUs have become widely available. Although the computation requirements are tremendous of 3D applications, they are highly data parallel operations. Therefore, mobile GPUs are usually hardware multithreaded to increase their throughput and achieve real-time rendering. This design increases energy consumption by duplicate register files in shaders. However, the register usage of shading programs is often relatively low, which causes many duplicated registers to go unused, and thus wastes energy. In addition, long latency memory operations can consume unnecessary energy to activate registers as well. This study proposes a compiler-assisted energy-efficient demand-driven register file (EDRF) to reduce energy consumptions of registers that are unused and waiting for long latency memory operations. The proposed EDRF is shared on demand between concurrent threads with multiple power gating modes. The management scheme of EDRF puts registers into different power modes to save leakage energy. In addition, the partitioned structure of EDRF saves dynamic energy for accessing registers. Results show that the average dynamic and leakage energy reduction ratios are 84.18% and 99.20%, respectively. Furthermore, the performance degradation from the proposed EDRF is only 0.50% on average.

Performance Evaluation of AFOD Protocol for Energy Efficient Routing

2011 ◽  
Author(s):  
B. Smitha Shekar ◽  
M. Sudhakar Pillai ◽  
G. Narendra Kumar
Keyword(s):  
Performance Evaluation ◽  
Energy Efficient ◽  
Energy Efficient Routing

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

CONCEPTUAL POSITIONS OF MODERNIZATION OF EXISTING INEFFICIENT DISTRICT HEATING SYSTEMS

2017 ◽  
pp. 11-21
Author(s):  
Ye.Ye. Nikitin
Keyword(s):  
Energy Efficient ◽  
Mutual Influence ◽  
District Heating ◽  
Current Status ◽  
Cognitive Approach ◽  
Heating Systems ◽  
Energy Management Systems ◽  
Current State ◽  
Self Sufficiency ◽  
District Heating Systems

The current situation in the sphere of district heating is analysed on the basis of use of the cognitive approach. The presence of closed chains of cause-effect relationships of negative factors and conflicts of target settings of the subjects in the field of district heating is shown. The conceptual model of energy efficient modernization of district heating systems is proposed. This model includes indicators of the current status of heat sources, networks and heat consumers, energetic and economic models, restrictions, procedure of forming and analysis of the mutual influence of the recommended projects. The quantitative data on indicators of the current state of district heating systems of the cities of Ukraine are presented. The interrelation between indicators of the current state and projects of energy efficient modernization of district heating systems is shown. Assessment of energy self-sufficiency of municipal district heating systems on condition of thermal modernization of buildings is carried out. The creation of energy management systems at the district heating enterprises is proposed. Bib. 6, Fig. 7, Tab. 5.

Sign in / Sign up

Export Citation Format

Share Document