• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.7
• /
• pp.52-60
• /
• 2010

In this paper, we propose a dynamic power management framework for multi-core systems. We reduced the power consumption of multi-core processors such as Intel Centrino Duo and ARM11 MPCore, which have been used at the consumer electronics and personal computer market. Each processor uses a different technique to save its power usage, but there is no embedded multi-core processor which has a precise power control mechanism such as dynamic voltage scaling technique. The proposed dynamic power management framework is suitable for smart phones which have an operating system to provide multi-processing capability. Basically, our framework follows an intuitive idea that reducing the power consumption of idle cores is the most effective way to save the overall power consumption of a multi-core processor. We could minimize the energy consumption used by idle cores with application-targeted policies that reflect the characteristics of active workloads. We defined some properties of an application to analyze the performance requirement in real time and automated the management process to verify the result quickly. We tested the proposed framework with popular processors such as Intel Centrino Duo and ARM11 MPCore, and were able to find that our framework dynamically reduced the power consumption of multi-core processors and satisfied the performance requirement of each program.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.98-100
• /
• 1998

실시간 시스템은 서버와 같은 공유자원들에 대해서 보다 높은 우선순위 활동의 최악 블록시간(worst case blocking time)을 결정해야한다. 현재까지 분산 시스템을 위한 여러 서버 모델들이 제안되었으며 이러한 서버모델들에 우선순위 규약을 적용하여 실시간성을 높이고 있다. 본 논문에서는 RT- Mach에서 실시간성을 향상시키기 위한 새로운 모델을 제시하여 우선순위 반전 문제를 해결하기 위해 동적 스레드 관리자(dynamic thread manager) 를 제안하였다. 기존의 여러 서버 모델들과 달리 서버마다 동적 스레드 관리자를 두어 작업자 그룹내에서 유혹 스레드(idle thread)와 바쁜스레드 (busy thread ) 판별하여 적절한 스레드를 선정, 조정하고 서버로부터의 요구에 대해 최상위 우선순위를 할당하여 서버간의 우선순위 반전을 중이고 실시간성을 향상시키고자 했다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.312-334
• /
• 2023

In large-scale computing, cloud computing plays an important role by sharing globally-distributed resources. The evolution of cloud has taken place in the development of data centers and numerous servers across the globe. But the cloud information centers incur huge operational costs, consume high electricity and emit tons of dioxides. It is possible for the cloud suppliers to leverage their resources and decrease the consumption of energy through various methods such as dynamic consolidation of Virtual Machines (VMs), by keeping idle nodes in sleep mode and mistreatment of live migration. But the performance may get affected in case of harsh consolidation of VMs. So, it is a desired trait to have associate degree energy-performance exchange without compromising the quality of service while at the same time reducing the power consumption. This research article details a number of novel algorithms that dynamically consolidate the VMs in cloud information centers. The primary objective of the study is to leverage the computing resources to its best and reduce the energy consumption way behind the Service Level Agreement (SLA)drawbacks relevant to CPU load, RAM capacity and information measure. The proposed VM consolidation Algorithm (PVMCA) is contained of four algorithms: over loaded host detection algorithm, VM selection algorithm, VM placement algorithm, and under loading host detection algorithm. PVMCA is dynamic because it uses dynamic thresholds instead of static thresholds values, which makes it suggestion for real, unpredictable workloads common in cloud data centers. Also, the Algorithms are adaptive because it inevitably adjusts its behavior based on the studies of historical data of host resource utilization for any application with diverse workload patterns. Finally, the proposed algorithm is online because the algorithms are achieved run time and make an action in response to each request. The proposed algorithms' efficiency was validated through different simulations of extensive nature. The output analysis depicts the projected algorithms scaled back the energy consumption up to some considerable level besides ensuring proper SLA. On the basis of the project algorithms, the energy consumption got reduced by 22% while there was an improvement observed in SLA up to 80% compared to other benchmark algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2101-2119
• /
• 2013

The spectrum allocation is an attractive issue for mobile cognitive radio (CR) network. However, the time-varying characteristic of the spectrum allocation is not fully investigated. Thus, this paper originally deduces the probabilities of spectrum availability and interference constrain in theory under the mobile environment. Then, we propose a prediction mechanism of the time-varying available spectrum lists and the dynamic interference topologies. By considering the node mobility and primary users' (PUs') activity, the mechanism is capable of overcoming the static shortcomings of traditional model. Based on the mechanism, two prediction-based spectrum allocation algorithms, prediction greedy algorithm (PGA) and prediction fairness algorithm (PFA), are presented to enhance the spectrum utilization and improve the fairness. Moreover, new utility functions are redefined to measure the effectiveness of different schemes in the mobile CR network. Simulation results show that PGA gets more average effective spectrums than the traditional schemes, when the mean idle time of PUs is high. And PFA could achieve good system fairness performance, especially when the speeds of cognitive nodes are high.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.7
• /
• pp.539-546
• /
• 2013

Surge phenomenon can be occurred in a compressor when compressor performance of turbofan engine for an aircraft is changed considerably in a short time on the cases like take-off phase and changing of RPM from idle to maximum, because performance of aircraft engine is changed suddenly. This study is aimed to avoid surge in a compressor. Dynamic simulation in a compressor is modeled by simulink in specific condition. Fuel flow is control input, rpm and air mass flow are expressed in terms of transfer function. Surge margin is obtained by using compressor performance map from NPSS. VIGV(Variable Inlet Guide Vane) is controlled by PD controller with difference between surge margin and reference. Finally this paper verifies IGV can prevent surge phenomenon in a compressor.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.87-103
• /
• 2006

Advances in computer and network technology provide new computing environment that were only possible with supercomputers before. In order to provide the environment, a distributed runtime system has to be provided, but most of the conventional distributed runtime systems lack in providing dynamic and flexible system reconfiguration depending on workload variance, due to a static architecture of fixed master node and slave working nodes. This paper proposes and implements a new model for distributed job allocation and management which is a distributed runtime system is P2P environment for flexible and dynamic system reconfiguration. The implemented systems enables job program transfer and management, remote compile and execution among cooperative developers based on P2P standard protocol Jxta platform. Since it makes dynamic and flexible system reconfiguration possible, the proposed method has some advantages in that it can collect and utilize idle computing resources immediately at a needed time for distributed job processing. Moreover, the implemented system's effectiveness and performance increase are shown by applying and processing the crawler jobs, in a distributed way, for collecting a large amount of data needed for internet search.

• Journal of IKEEE
• /
• v.21 no.3
• /
• pp.174-184
• /
• 2017

This paper proposes a torque predictive control for dynamic performance improvement of clamping force in electro-mechanical brake (EMB) for railroad cars. In general, pneumatic braking system (PBS) is used for railroad cars. It is sensitive depending on environmental changes and it has increasing idle running time because of slow dynamic response. Additionally, the PBS has low braking efficiency in case braking torque more than standard value is applied to the brake system such as emergency braking. In order to overcome these disadvantages of the PBS, the EMB is used for the railroad cars. The EMB for railroad cars has advantages that increasing the fuel efficiency and design flexibility because it is able to decrease vehicle weight of railroad cars and secure space for design. In this paper, control method for dynamic performance improvement of clamping force in EMB for railroad car is proposed. The effectiveness of the proposed control method is verified by the simulation results.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.349-358
• /
• 2007

Ethernet Passive Optical Network(EPON), which is one of PON technologies for realizing FTTx(Fiber-To-The-Curb/Home/Office), can cost-effectively construct optical access networks. In addition, EPON can provide high transmission rate up to 10Gbps and it is compatible with existing customer devices equipped with Ethernet card. To effectively control frame transmission from ONUs to OLT EPON can use Multi-Point Control Protocol(MPCP) with additional control functions in addition to Media Access Control(MAC) protocol function. For EPON, many researches on intra- and inter-ONU scheduling algorithms have been performed. Among the inter-ONU scheduling algorithms, IPS(Interleaved Polling with Stop) based on polling scheme is efficient because OLT assigns available time portion to each ONU given the request information from all ONUs. Since the IPS needs an idle time period on uplink between two consecutive frame transmission periods, it wastes time without frame transmissions. In this paper, we propose a dynamic bandwidth allocation algorithm to increase the channel utilization on uplink and evaluate its performance using simulations. The simulation results show that the proposed Two-phase Cycle Danamic Bandwidth Allocation(TCDBA) algorithm improves the throughput about 15%, compared with the IPS and Fast Gate Dynamic Bandwidth Allocation(FGDBA). Also, the average transmission time of the proposed algorithm is lower than those of other schemes.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.413-434
• /
• 2010

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.15-21
• /
• 2009

An Ethernet passive optical network (EPON) is an economical and efficient access network that received significant research attention in recent year. A MAC protocol of the PON, the next generation access network, is based primarily on TDMA (Time Division Multiple Access). In this paper, we addressed the problems of a dynamic bandwidth allocation (DBA) in Fairness and QoS Performance. We augmented the advanced bandwidth allocation algorithms to support efficient resource utilization by reducing the unused remaining bandwidth made by idle state ONUs. Our new proposed advanced bandwidth allocation algorithm can allocate effectively and fairly the bandwidths between end-users.