• 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.

• Journal of Korea Game Society
• /
• v.6 no.4
• /
• pp.55-61
• /
• 2006

Graphics rendering pipeline (application, geometry, and rasterizer) is the core of real-time graphics which is the most important functionality for computer games. Usually this rendering process is completed by both the CPU and the GPU, and a bottleneck can be located either in the CPU or the GPU. This paper focuses on reducing the bottleneck between the CPU and the GPU. We are proposing a method for improving the performance of parallel processing for real-time graphics rendering by separating the CPU operations (usually performed using a thread) into two parts: pure CPU operations and operations related to the GPU, and let them operate in parallel. This allows for maximizing the parallelism in processing the communication between the CPU and the GPU. Some experiments lead us to confirm that our method proposed in this paper can allow for faster graphics rendering. In addition to our method of using a dedicated thread for GPU related operations, we are also proposing an algorithm for balancing the graphics pipeline using the idle time due to the bottleneck. We have implemented the two methods proposed in this paper in our networked 3D game engine and verified that our methods are effective in real systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2C
• /
• pp.160-169
• /
• 2002

An ATM-PON (Passive Optical Network) system consists of an OLT (Optical Line Termination), multiple ONUs (Optical Network Units) and the optical fiber which has a PON (Passive Optical Network)configuration with a passive optical splitter. To avoid cell collisions on the upstream transmission, an elaborate procedure called as ranging is needed when a new ONU is installed. The ONU can send upstream cells according to the grant provided by the OLT after the procedure. To prevent collisions being generated by the variation of several factors, OLT must performs continuously the cell phase monitoring. It means that the OLT predicts the expected arrival time, monitors the actual arrival time for all upstream cells and calculates the error between the times. Accordingly, TC (Transmission Convergence) chip in the OLT needs a predictor which predicts the time that the cell will arrive for the current grant. In this paper, we implement the predictor by using shift registers of which the length is equivalent to the equalized round trip delay. As each register consists of 8 bit, OLT can identify which ONU sends what type of cell (ranging cell, user cell, idle cell, and mini-slot). Also, TC chip is designed to calculate the effective bandwidth for all ONUs by using the function of predictor. With the time simulation and the measurement of an implemented optical board, we verify the operation of the predictor.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1250-1260
• /
• 2014

In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.98-106
• /
• 2006

In order to provide a realtime transmission over a wireless LAM, we here present a new jamming based retransmission mechanism. In a legacy wireless LAN system, all stations use the binary exponential backoff algorithm to avoid collisions among frames. It is well known that the backoff algorithm causes more collisions as the numbers of active stations increases. This makes transmission of real time traffic hard. In the proposed scheme, when each station senses collisions, it promptly allows to send a jamming signal during a unique jamming window period which is determined by its own channel access count database(CACDB). This jamming windows is chosen not to be overlapped each other by using of CACDB, and thus channel access of another station is prevented. Hereafter the station gets the ownership of the medium when the wireless medium becomes idle after sending the jamming signal and sensing carrier, and then sends frame in medium. In our proposal, repeating collisions is never happened. We here assume that real time traffic use a frame of fixed length in order to make the time for receiving its ACK frame same. Comparing the proposed jamming-based retransmission scheme with the the 802.11 and 802.11e MAC by simulation. one can find that the proposed scheme have advantages in terms of delay, average backoff time, and average number of collisions per frame. One can find that the proposed scheme might be practically applicable to several applications of realtime traffic transmission in wireless LAN systems.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.3
• /
• pp.379-387
• /
• 2013

In large-scale wireless sensor networks, tremendous amount of dummy packets is usually accompanied by keeping location privacy of the communication source and destination against global eavesdropping. In our earlier work we designed a location privacy routing protocol, ELPR(End-node Location Privacy Routing) in which the generation of dummy packets at each idle time-slot while transferring data packets are restricted to only the nodes within certain areas of encompassing the source and destination, respectively. In this paper, it is given that ELPR provides various degrees of location privacy while PCM(Periodic Collection Method) allows the only fixed level. Simulation results show that as the number of nodes or data packets increases ELPR permits in terms of the number of generated packets more cost-effective location privacy than PCM.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.9
• /
• pp.307-314
• /
• 2015

Recently, market trends of auxiliary storage device HDD and SSD are interchangeable. In the future, the SSD is expected to be used more popular than HDD as an auxiliary storage device. The TRIM command technique has been proposed and used effectively due to the development of the SSD. The TRIM command techniques can be used to solve the problem of Freezing SSD that operating system cooperates with the SSD. The TRIM command techniques are performed in the idle time of the internal SSD that are actually deleted when a user deletes the data. However, in the point of view of computer forensics, the digital crime is increasing year by year due to lack of data recovery. Thus, this rate of arrest is insufficient. In this paper, I propose a solution that selectively manages data to delete based on advantage of the stability and the write speed of the TRIM command. Through experiments, It is verified by measuring the performance of the traditional method and selected method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.78-83
• /
• 2014

This paper suggest an effective idea to implement an low area multi-mode one dimension transform block of HEVC(High Efficiency Video Coding). The time consuming multiplier path is designed to operate on low frequency. Normal multipliers dealing with variable operands are replaced with smaller constant multipliers which do the product with constant coefficient and variable only using shifters and adders. This scheme increases total multiplier counts but entire areas are reduced owing to smaller area of constant multiplier. Idle cycles caused by doubled multipliers enable to use multi-cycle paths on the cycle eating multiplier data path. Operating frequency is lowered by multi-cycle path but total throughput is maintained. This structure is implemented with TSMC 0.18 CMOS process library, and operated on 186MHz frequency to process a 4k($3840{\times}2160$) image. Max operating frequency is 300MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1507-1514
• /
• 2016

Full-image guided filter reflects all pixels of image in filtering by using weight propagation and two-pass model, whereas the existing guide filter is processed based on the kernel window. Therefore the computational complexity can be improved while maintaining characteristics of guide filter, such as edge-preserving, smoothing, and so on. In this paper, we propose an efficient VLSI architecture for the full-image guided filter by analyzing the data dependency, the data frequency and the PSNR analysis of the image in order to achieve enough speed for various applications such as stereo vision, real-time systems, etc. In addition, the proposed efficient scheduling enables the realtime process by minimizing the idle period in weight computation. The proposed VLSI architecture shows 214MHz of maximum operating frequency (image size: 384*288, 965 fps) and 76K of gates (internal memory excluded).