389 resultados para energy-aware
em Indian Institute of Science - Bangalore - Índia
Resumo:
Increasing network lifetime is important in wireless sensor/ad-hoc networks. In this paper, we are concerned with algorithms to increase network lifetime and amount of data delivered during the lifetime by deploying multiple mobile base stations in the sensor network field. Specifically, we allow multiple mobile base stations to be deployed along the periphery of the sensor network field and develop algorithms to dynamically choose the locations of these base stations so as to improve network lifetime. We propose energy efficient low-complexity algorithms to determine the locations of the base stations; they include i) Top-K-max algorithm, ii) maximizing the minimum residual energy (Max-Min-RE) algorithm, and iii) minimizing the residual energy difference (MinDiff-RE) algorithm. We show that the proposed base stations placement algorithms provide increased network lifetimes and amount of data delivered during the network lifetime compared to single base station scenario as well as multiple static base stations scenario, and close to those obtained by solving an integer linear program (ILP) to determine the locations of the mobile base stations. We also investigate the lifetime gain when an energy aware routing protocol is employed along with multiple base stations.
Resumo:
Unending quest for performance improvement coupled with the advancements in integrated circuit technology have led to the development of new architectural paradigm. Speculative multithreaded architecture (SpMT) philosophy relies on aggressive speculative execution for improved performance. However, aggressive speculative execution comes with a mixed flavor of improving performance, when successful, and adversely affecting the energy consumption (and performance) because of useless computation in the event of mis-speculation. Dynamic instruction criticality information can be usefully applied to control and guide such an aggressive speculative execution. In this paper, we present a model of micro-execution for SpMT architecture that we have developed to determine the dynamic instruction criticality. We have also developed two novel techniques utilizing the criticality information namely delaying the non-critical loads and the criticality based thread-prediction for reducing useless computations and energy consumption. Experimental results showing break-up of critical instructions and effectiveness of proposed techniques in reducing energy consumption are presented in the context of multiscalar processor that implements SpMT architecture. Our experiments show 17.7% and 11.6% reduction in dynamic energy for criticality based thread prediction and criticality based delayed load scheme respectively while the improvement in dynamic energy delay product is 13.9% and 5.5%, respectively. (c) 2012 Published by Elsevier B.V.
Resumo:
Multicast in wireless sensor networks (WSNs) is an efficient way to spread the same data to multiple sensor nodes. It becomes more effective due to the broadcast nature of wireless link, where a message transmitted from one source is inherently received by all one-hop receivers, and therefore, there is no need to transmit the message one by one. Reliable multicast in WSNs is desirable for critical tasks like code updation and query based data collection. The erroneous nature of wireless medium coupled with limited resource of sensor nodes, makes the design of reliable multicast protocol a challenging task. In this work, we propose a time division multiple access (TDMA) based energy aware media access and control (TEA-MAC) protocol for reliable multicast in WSNs. The TDMA eliminates collisions, overhearing and idle listening, which are the main sources of reliability degradation and energy consumption. Furthermore, the proposed protocol is parametric in the sense that it can be used to trade-off reliability with energy and delay as per the requirement of the underlying applications. The performance of TEA-MAC has been evaluated by simulating it using Castalia network simulator. Simulation results show that TEA-MAC is able to considerably improve the performance of multicast communication in WSNs.
Resumo:
Clustered VLIW architectures solve the scalability problem associated with flat VLIW architectures by partitioning the register file and connecting only a subset of the functional units to a register file. However, inter-cluster communication in clustered architectures leads to increased leakage in functional components and a high number of register accesses. In this paper, we propose compiler scheduling algorithms targeting two previously ignored power-hungry components in clustered VLIW architectures, viz., instruction decoder and register file. We consider a split decoder design and propose a new energy-aware instruction scheduling algorithm that provides 14.5% and 17.3% benefit in the decoder power consumption on an average over a purely hardware based scheme in the context of 2-clustered and 4-clustered VLIW machines. In the case of register files, we propose two new scheduling algorithms that exploit limited register snooping capability to reduce extra register file accesses. The proposed algorithms reduce register file power consumption on an average by 6.85% and 11.90% (10.39% and 17.78%), respectively, along with performance improvement of 4.81% and 5.34% (9.39% and 11.16%) over a traditional greedy algorithm for 2-clustered (4-clustered) VLIW machine. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.
Resumo:
In large flexible software systems, bloat occurs in many forms, causing excess resource utilization and resource bottlenecks. This results in lost throughput and wasted joules. However, mitigating bloat is not easy; efforts are best applied where savings would be substantial. To aid this we develop an analytical model establishing the relation between bottleneck in resources, bloat, performance and power. Analyses with the model places into perspective results from the first experimental study of the power-performance implications of bloat. In the experiments we find that while bloat reduction can provide as much as 40% energy savings, the degree of impact depends on hardware and software characteristics. We confirm predictions from our model with selected results from our experimental study. Our findings show that a software-only view is inadequate when assessing the effects of bloat. The impact of bloat on physical resource usage and power should be understood for a full systems perspective to properly deploy bloat reduction solutions and reap their power-performance benefits.
Resumo:
The twin demands of energy-efficiency and higher performance on DRAM are highly emphasized in multicore architectures. A variety of schemes have been proposed to address either the latency or the energy consumption of DRAMs. These schemes typically require non-trivial hardware changes and end up improving latency at the cost of energy or vice-versa. One specific DRAM performance problem in multicores is that interleaved accesses from different cores can potentially degrade row-buffer locality. In this paper, based on the temporal and spatial locality characteristics of memory accesses, we propose a reorganization of the existing single large row-buffer in a DRAM bank into multiple sub-row buffers (MSRB). This re-organization not only improves row hit rates, and hence the average memory latency, but also brings down the energy consumed by the DRAM. The first major contribution of this work is proposing such a reorganization without requiring any significant changes to the existing widely accepted DRAM specifications. Our proposed reorganization improves weighted speedup by 35.8%, 14.5% and 21.6% in quad, eight and sixteen core workloads along with a 42%, 28% and 31% reduction in DRAM energy. The proposed MSRB organization enables opportunities for the management of multiple row-buffers at the memory controller level. As the memory controller is aware of the behaviour of individual cores it allows us to implement coordinated buffer allocation schemes for different cores that take into account program behaviour. We demonstrate two such schemes, namely Fairness Oriented Allocation and Performance Oriented Allocation, which show the flexibility that memory controllers can now exploit in our MSRB organization to improve overall performance and/or fairness. Further, the MSRB organization enables additional opportunities for DRAM intra-bank parallelism and selective early precharging of the LRU row-buffer to further improve memory access latencies. These two optimizations together provide an additional 5.9% performance improvement.
Resumo:
Wireless Sensor Networks have gained popularity due to their real time applications and low-cost nature. These networks provide solutions to scenarios that are critical, complicated and sensitive like military fields, habitat monitoring, and disaster management. The nodes in wireless sensor networks are highly resource constrained. Routing protocols are designed to make efficient utilization of the available resources in communicating a message from source to destination. In addition to the resource management, the trustworthiness of neighboring nodes or forwarding nodes and the energy level of the nodes to keep the network alive for longer duration is to be considered. This paper proposes a QoS Aware Trust Metric based Framework for Wireless Sensor Networks. The proposed framework safeguards a wireless sensor network from intruders by considering the trustworthiness of the forwarder node at every stage of multi-hop routing. Increases network lifetime by considering the energy level of the node, prevents the adversary from tracing the route from source to destination by providing path variation. The framework is built on NS2 Simulator. Experimental results show that the framework provides energy balance through establishment of trustworthy paths from the source to the destination. (C) 2015 The Authors. Published by Elsevier B.V.
Resumo:
The measurement of surface energy balance over a land surface in an open area in Bangalore is reported. Measurements of all variables needed to calculate the surface energy balance on time scales longer than a week are made. Components of radiative fluxes are measured while sensible and latent heat fluxes are based on the bulk method using measurements made at two levels on a micrometeorological tower of 10 m height. The bulk flux formulation is verified by comparing its fluxes with direct fluxes using sonic anemometer data sampled at 10 Hz. Soil temperature is measured at 4 depths. Data have been continuously collected for over 6 months covering pre-monsoon and monsoon periods during the year 2006. The study first addresses the issue of getting the fluxes accurately. It is shown that water vapour measurements are the most crucial. A bias of 0.25% in relative humidity, which is well above the normal accuracy assumed the manufacturers but achievable in the field using a combination of laboratory calibration and field intercomparisons, results in about 20 W m(-2) change in the latent heat flux on the seasonal time scale. When seen on the seasonal time scale, the net longwave radiation is the largest energy loss term at the experimental site. The seasonal variation in the energy sink term is small compared to that in the energy source term.
Resumo:
Diffusion such is the integrated diffusion coefficient of the phase, the tracer diffusion coefficient of species at different temperatures and the activation energy for diffusion, are determined in V3Si phase with A15 crystal structure. The tracer diffusion coefficient of Si Was found to be negligible compared to the tracer diffusion coefficient of V. The calculated diffusion parameters will help to validate the theoretical analysis of defect structure of the phase, which plays an important role in the superconductivity.
Resumo:
The floating-zone method with different growth ambiences has been used to selectively obtain hexagonal or orthorhombic DyMnO3 single crystals. The crystals were characterized by x-ray powder diffraction of ground specimens and a structure refinement as well as electron diffraction. We report magnetic susceptibility, magnetization and specific heat studies of this multiferroic compound in both the hexagonal and the orthorhombic structure. The hexagonal DyMnO3 shows magnetic ordering of Mn3+ (S = 2) spins on a triangular Mn lattice at T-N(Mn) = 57 K characterized by a cusp in the specific heat. This transition is not apparent in the magnetic susceptibility due to the frustration on the Mn triangular lattice and the dominating paramagnetic susceptibility of the Dy3+ (S = 9/2) spins. At T-N(Dy) = 3 K, a partial antiferromagnetic order of Dy moments has been observed. In comparison, the magnetic data for orthorhombic DyMnO3 display three transitions. The data broadly agree with results from earlier neutron diffraction experiments, which allows for the following assignment: a transition from an incommensurate antiferromagnetic ordering of Mn3+ spins at T-N(Mn) = 39 K, a lock-in transition at Tlock-in = 16 K and a second antiferromagnetic transition at T-N(Dy) = 5 K due to the ordering of Dy moments. Both the hexagonal and the orthorhombic crystals show magnetic anisotropy and complex magnetic properties due to 4f-4f and 4f-3d couplings.
Resumo:
Using a multivalley effective mass theory, we obtain the binding energy of a D- ion in Si and Ge taking into account the spatial variation of the host dielectric function. We find that on comparison with experimental results the effect of spatial dispersion is important in the estimation of binding energy for the D- formed by As in Si and Ge. The effect is less significant for the case of D- formed by P and Sb donors.
Resumo:
numerical study of the free energy gap (FEG) dependence of the electron-transfer rate in polar solvents is presented. This study is based on the generalized multidimensional hybrid model, which not only includes the solvent polarization and the molecular vibration modes, but also the biphasic polar response of the solvent. The free energy gap dependence is found to be sensitive to several factors, including the solvent relaxation rate, the electronic coupling between the surfaces, the frequency of the high-frequency quantum vibrational mode, and the magnitude of the solvent reorganization energy. It is shown that in some cases solvent relaxation can play an important role even in the Marcus normal regime. The minimal hybrid model involves a large number of parameters, giving rise to a diverse non-Marcus FEG behavior which is often determined collectively by these parameters. The model gives the linear free energy gap dependence of the logarithmic rate over a substantial range of FEG, spanning from the normal to the inverted regime. However, even for favorable values of the relevant parameters, a linear free energy gap dependence of the rate could be obtained only over a range of 5000-6000 cm(-1) (compared to the experimentally observed range of 10000 cm(-1) reported by Benniston et al.). The present work suggests several extensions/generalizations of the hybrid model which might be necessary to fully understand the observed free energy gap dependence.
Resumo:
The topography of the free energy landscape in phase space of a dense hard-sphere system characterized by a discretized free energy functional of the Ramakishnan-Yussouff form is investigated numerically using a specially devised Monte Carlo procedure. We locate a considerable number of glassy local minima of the free energy and analyze the distributions of the free energy at a minimum and an appropriately defined phase-space "distance" between different minima. We find evidence for the existence of pairs of closely related glassy minima("two-level systems"). We also investigate the way the system makes transitions as it moves from the basin of attraction of a minimum to that of another one after a start under nonequilibrium conditions. This allows us to determine the effective height of free energy barriers that separate a glassy minimum from the others. The dependence of the height of free energy barriers on the density is investigated in detail. The general appearance of the free energy landscape resembles that of a putting green: relatively deep minima separated by a fairly flat structure. We discuss the connection of our results with the Vogel-Fulcher law and relate our observations to other work on the glass transition.
Resumo:
In our previous report on resonance energy transfer from a dye molecule to graphene [J. Chem. Phys.129, 054703 (2008)], we had derived an expression for the rate of energy transfer from a dye to graphene. An integral in the expression for the rate was evaluated approximately. We found a Yuwaka-type dependence of the rate on the distance. We now present an exact evaluation of the integral involved, leading to very interesting results. For short distances (z < 20 A), the present rate and the previous rate are in good agreement. For larger distances, the rate is found to have a z(-4) dependence on the distance, exactly. Thus we predict that for the case of pyrene on graphene, it is possible to observe fluorescence quenching up to a distance of 300 A. This is in sharp contrast to the traditional fluorescence resonance energy transfer where the quenching is observable only up to 100 A.