• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.459-462
• /
• 2004

In this paper, we present a reducing power consumption of a scheduling for module selection under the time constraint. A a reducing power consumption of a scheduling for module selection under the time constraint execute scheduling and allocation for considering the switching activity. The focus scheduling of this phase adopt Force-Directed Scheduling for low power to existed Force-Directed Scheduling. and it constructs the module selection RT library by in account consideration the mutual correlation of parameters in which the power and the area and delay. when it is, in this paper we formulate the module selection method as a multi-objective optimization and propose a branch and bound approach to explore the large design space of module selection. Therefore, the optimal module selection method proposed to consider power, area, delay parameter at the same time. The comparison experiment analyzed a point of difference between the existed FDS algorithm and a new FDS_RPC algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.856-867
• /
• 2006

This paper proposes a new algorithm for opportunistic scheduling that take advantage of both multiuser diversity and power control. Motivated by the multicast RTS and priority-based CTS mechanism of OSMA protocol, we propose an opportunistic packet scheduling with power control scheme based on IEEE 802.11 MAC protocol. The scheduling scheme chooses the best candidate receiver for transmission by considering the SINR at the nodes. This mechanism ensures that the transmission would be successful. The power control algorithm on the other hand, helps reduce interference between links and could maximize spatial reuse of the bandwidth. We then formulate a convex optimization problem for minimizing power consumption and maximizing net utility of the system. We showed that if a transmission power vector satisfying the maximum transmission power and SINR constraints of all nodes exist, then there exists an optimal solution that minimizes overall transmission power and maximizes utility of the system.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.188-191
• /
• 2000

This paper presents a register scheduling and allocation algorithm for high level synthesis. The proposed algorithm executes the low power scheduling to reduce the switching activity using shut down technique which was not unnecessary the calculation through the extraction DFG from VHDL description. Also, the register allocation algorithm determines the minimum register after the life time analysis of all variable. It is minimum the switching activity using graph coloring technique for low power consumption. The proposed algorithm proves the effect through various filter benchmark to adopt a new scheduling and allocation algorithm considering the low power.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.641-647
• /
• 2009

This paper proposes an improved predictive dynamic power management (DPM) scheme and a task scheduling algorithm to reduce unnecessary power consumption in embedded systems. The proposed algorithm performs pre-scheduling to minimize unnecessary power consumption. The proposed predictive DPM utilizes a scheduling library provided by the system to reduce computation overhead. Experimental results show that the proposed algorithm can reduce power consumption by 22.3% on the average comparing with the LLF algorithm for DPM-enable system scheduling.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1153-1156
• /
• 2003

In this paper, we present a reducing power consumption of a scheduling for module selection under the time constraint. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed scheduling of reducing power consumption is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our approach various HLS benchmark environment using chaining and multi-cycling in the scheduling techniques..

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1329-1339
• /
• 2017

This paper presents the power scheduling of a multi-microgrid (MMG) system using an optimization technique called particle swarm optimization (PSO). The PSO technique has been shown to be most effective at solving the various problems of the economic dispatch (ED) in a power system. In addition, a new MMG system configuration is proposed in this paper, through which the optimal power flow is achieved. Both optimization and power trading methods within an MMG are studied. The results of implementing PSO in an MMG system for optimal power flow and cost minimization are obtained and compared with another attractive and efficient optimization technique called the genetic algorithm (GA). The comparison between these two effective methods provides very competitive results, and their operating costs also appear to be comparable. Finally, in this study, power scheduling and a power trading method are obtained using the MATLAB program.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.77-83
• /
• 2008

In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1721-1723
• /
• 2002

In 3rd-generation mobile communication systems providing packet service, optimal scheduling algorithms we needed to increase service efficiency. In this paper, three scheduling algorithms (SP, EDF, and RPQ) which have been studied in the field of computer networks are applied with transmit power constraint to an interference-limited CDMA system, proving to be efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4988-5012
• /
• 2019

As a subset of the Internet of Things, the Internet of Energy (IoE) is expected to tackle the problems faced by the current smart grid framework. Notably, the conventional day-ahead power scheduling of the smart grid should be redesigned in the IoE architecture to take into consideration the intermittence of scattered renewable generations, large amounts of power consumption data, and the uncertainty of the arrival time of electric vehicles (EVs). Accordingly, a day-ahead power scheduling system for the future IoE is proposed in this research to maximize the usage of distributed renewables and reduce carbon emission caused by the traditional power generation. Meanwhile, flexible charging mechanism of EVs is employed to provide preferred charging options for moving EVs and flatten the load profile simultaneously. The simulation results revealed that the proposed power scheduling mechanism not only achieves emission reduction and balances power load and supply effectively, but also fits each individual EV user's preference.