• Title/Summary/Keyword: Energy Allocation

Search Result 363, Processing Time 0.026 seconds

Bus Splitting Techniques for MPSoC to Reduce Bus Energy (MPSoC 플랫폼의 버스 에너지 절감을 위한 버스 분할 기법)

  • Chung Chun-Mok;Kim Jin-Hyo;Kim Ji-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.699-708
    • /
    • 2006
  • Bus splitting technique reduces bus energy by placing modules with frequent communications closely and using necessary bus segments in communications. But, previous bus splitting techniques can not be used in MPSoC platform, because it uses cache coherency protocol and all processors should be able to see the bus transactions. In this paper, we propose a bus splitting technique for MPSoC platform to reduce bus energy. The proposed technique divides a bus into several bus segments, some for private memory and others for shared memory. So, it minimizes the bus energy consumed in private memory accesses without producing cache coherency problem. We also propose a task allocation technique considering cache coherency protocol. It allocates tasks into processors according to the numbers of bus transactions and cache coherence protocol, and reduces the bus energy consumption during shared memory references. The experimental results from simulations say the bus splitting technique reduces maximal 83% of the bus energy consumption by private memory accesses. Also they show the task allocation technique reduces maximal 30% of bus energy consumed in shared memory references. We can expect the bus splitting technique and the task allocation technique can be used in multiprocessor platforms to reduce bus energy without interference with cache coherency protocol.

Consideration of Cost Allocation Methodology on Cogeneration (열병합발전에서 비용배분 방법론의 고찰)

  • Kim, Deok-Jin
    • Proceedings of the SAREK Conference
    • /
    • 2009.06a
    • /
    • pp.1197-1202
    • /
    • 2009
  • Cost allocation on cogeneration is a methodology dividing the input of common cost to electricity cost and heat cost. In the cost allocation methodology of the electricity and heat on a cogeneration, there are energy method, work method, proportional method, benefit distribution method, reversible work method, various exergetic methods, and so on. In previous study, various cost allocation methodologies have been applied and analyzed on a gas-turbine cogeneration producing the 33.1 MW of electricity and the 32.2 Gcal/h of heat, a steam-turbine cogeneration producing the 22.2 MW of electricity and the 44.3 Gcal/h of heat, and combined-cycle cogeneration producing the 314.1 MW of electricity and the 279.4 Gcal/h of heat. In this study, we integrately analyze the results of previous studies and examine the generality and rationality each methodology. Additionally, a new point of view on the values of alternative electricity efficiency and alternative heat efficiency in the previous methodologies was proposed. As the integrated result, we conclude that reversible work method of various common cost allocation methodologies is most rational.

  • PDF

Analysis of Loss Compensation Efficiency Factor in the Uniform Price Market (단일가격시장에서 손실보상효율계수의 특성 분석)

  • Hahn, Tae-Kyung;Kim, Jin-Ho;Park, Jong-Keun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.5
    • /
    • pp.871-881
    • /
    • 2010
  • In the uniform price electricity market or bilateral electricity market, the energy transactions in which the network is not considered and ISO's system operation costs which ISO try to minimize are settled separately. In this paper, transmission loss, one of the ISO's system operation costs, was dealt. The conventional marginal loss allocation method gives economic signals but three aspects have to be considered; excessiveness, arbitrariness and cross-subsidy. In this paper, marginal loss compensation efficiency method was suggested which consider those aspects of the conventional marginal loss allocation method. Also the characteristics of the marginal loss compensation efficiency were analyzed in the appendixes. And simple 2-bus system and IEEE 14 bus system were used to explain these characteristics.

A Reinforcement learning-based for Multi-user Task Offloading and Resource Allocation in MEC

  • Xiang, Tiange;Joe, Inwhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.45-47
    • /
    • 2022
  • Mobile edge computing (MEC), which enables mobile terminals to offload computational tasks to a server located at the user's edge, is considered an effective way to reduce the heavy computational burden and achieve efficient computational offloading. In this paper, we study a multi-user MEC system in which multiple user devices (UEs) can offload computation to the MEC server via a wireless channel. To solve the resource allocation and task offloading problem, we take the total cost of latency and energy consumption of all UEs as our optimization objective. To minimize the total cost of the considered MEC system, we propose an DRL-based method to solve the resource allocation problem in wireless MEC. Specifically, we propose a Asynchronous Advantage Actor-Critic (A3C)-based scheme. Asynchronous Advantage Actor-Critic (A3C) is applied to this framework and compared with DQN, and Double Q-Learning simulation results show that this scheme significantly reduces the total cost compared to other resource allocation schemes

QoS-, Energy- and Cost-efficient Resource Allocation for Cloud-based Interactive TV Applications

  • Kulupana, Gosala;Talagala, Dumidu S.;Arachchi, Hemantha Kodikara;Fernando, Anil
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.3
    • /
    • pp.158-167
    • /
    • 2017
  • Internet-based social and interactive video applications have become major constituents of the envisaged applications for next-generation multimedia networks. However, inherently dynamic network conditions, together with varying user expectations, pose many challenges for resource allocation mechanisms for such applications. Yet, in addition to addressing these challenges, service providers must also consider how to mitigate their operational costs (e.g., energy costs, equipment costs) while satisfying the end-user quality of service (QoS) expectations. This paper proposes a heuristic solution to the problem, where the energy incurred by the applications, and the monetary costs associated with the service infrastructure, are minimized while simultaneously maximizing the average end-user QoS. We evaluate the performance of the proposed solution in terms of serving probability, i.e., the likelihood of being able to allocate resources to groups of users, the computation time of the resource allocation process, and the adaptability and sensitivity to dynamic network conditions. The proposed method demonstrates improvements in serving probability of up to 27%, in comparison with greedy resource allocation schemes, and a several-orders-of-magnitude reduction in computation time, compared to the linear programming approach, which significantly reduces the service-interrupted user percentage when operating under variable network conditions.

Development of Heliostat Aiming Point Allocation Scheme in Heliostat Field Control Algorithm for 200kW Tower Type Solar Thermal Power Plant (200kW 탑형 태양열발전시스템을 위한 헬리오스타트 필드 운영 알고리즘의 헬리오스타트 반사목표점 할당 방안 개발)

  • Park, Young Chil
    • Journal of the Korean Solar Energy Society
    • /
    • v.34 no.3
    • /
    • pp.21-29
    • /
    • 2014
  • Heliostat field control algorithm is the logics to operate the heliostat field of tower type solar thermal power plant and it could include various methodologies of how to control the heliostat field so as to optimize the energy collection efficiency as well as to reduce the system operating cost. This work, as the first part of the consecutive works, presents heliostat aiming mint allocation scheme which will be used in the heliostat field control algorithm for 200kW solar thermal power plant built in Daegu, Korea. We first discuss the structure of heliostat field control system required for the implementation of aiming scheme developed in this work. Then the methodologies to allocate the heliostat aiming points on the receiver are discussed. The simulated results show that the heliostat aiming point allocation scheme proposed in this work reduces the magnitude of peak heat flux on the receiver more than 40% from the case of which all the heliostats in the field aim at the center of receiver simultaneously. Also it shows that, when the proposed scheme is used, the degradation of heliostat field optical efficiency is relatively small from the maximal optical efficiency the heliostat field could have.

Optimal Allocation of Distributed Solar Photovoltaic Generation in Electrical Distribution System under Uncertainties

  • Verma, Ashu;Tyagi, Arjun;Krishan, Ram
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1386-1396
    • /
    • 2017
  • In this paper, a new approach is proposed to select the optimal sitting and sizing of distributed solar photovoltaic generation (SPVG) in a radial electrical distribution systems (EDS) considering load/generation uncertainties. Here, distributed generations (DGs) allocation problem is modeled as optimization problem with network loss based objective function under various equality and inequality constrains in an uncertain environment. A boundary power flow is utilized to address the uncertainties in load/generation forecasts. This approach facilitates the consideration of random uncertainties in forecast having no statistical history. Uncertain solar irradiance is modeled by beta distribution function (BDF). The resulted optimization problem is solved by a new Dynamic Harmony Search Algorithm (DHSA). Dynamic band width (DBW) based DHSA is proposed to enhance the search space and dynamically adjust the exploitation near the optimal solution. Proposed approach is demonstrated for two standard IEEE radial distribution systems under different scenarios.

Selection Based Cooperative Beamforming and Power Allocation for Relay Networks

  • Liu, Yi;Nie, Weiqing
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.377-384
    • /
    • 2011
  • Cooperative beamforming has previously been proven to be an efficient way to improve the cooperative diversity. This method generally requires all relay nodes to participate in beamforming, which can be seen as "all participate" cooperative beamforming. However, not all relay nodes have constructive impacts on the end-to-end bit error rate (BER) performance. Based on this observation, we propose a new cooperative scheme which only selects those "appropriate" relay nodes to perform cooperative beamforming. Such relay nodes can be simply determined with mean channel gains. Therefore, the selection complexity is significantly reduced as global instantaneous channel state information is not required. This scheme guarantees that energy is only allocated to the "appropriate" relay nodes, and hence provides superior diversity. We also prove that power allocation among source and selected relay nodes is a convex problem, and can be resolved with lower computational complexity. Simulation results demonstrate that our scheme achieves an essential improvement in terms of BER performance for both optimal and limited feedback scenarios, as well as high energy-efficiency for the energy-constrained networks.

Matching game based resource allocation algorithm for energy-harvesting small cells network with NOMA

  • Wang, Xueting;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5203-5217
    • /
    • 2018
  • In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.