• Title/Summary/Keyword: Swap System

Search Result 52, Processing Time 0.028 seconds

Feasibility study of wireless motion control (Wireless 모션제어의 가능성 연구)

  • Lee, Don-Jin;Ahn, Jung-Hwan
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.82-86
    • /
    • 2001
  • This papers deals with feasibility study of wireless motion control. Wireless telecommunication advances with development of IT technology and extends more and more areas. So we selected Bluetooth out of the technologies(Bluetooth, SWAP(SharedWireless Access Protocol), IrDA(Infra Red Data Association), WLAN(Wireless Local Area Network)) which was developed for local data communication and set up simple experimental system for wireless data transfer and server and client program for wireless data transfer was wrote. We successfully transferred some data wirelessly with this program.

  • PDF

A Fast Booting Technique using Improved Snapshot Boot in Embedded Linux (개선된 스냅샷 부트를 이용한 임베디드 리눅스의 빠른 부팅 기법)

  • Park, Se-Jin;Song, Jae-Hwan;Park, Chan-Ik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.6
    • /
    • pp.594-598
    • /
    • 2008
  • In this paper we propose a fast booting technique based on Improved snapshot boot in embedded Linux, widely adopted in personal devices such as PDA and mobile phones. The existing Snapshot boot technique tries to create a snapshot image at the time of suspend, and later load the entire snapshot image into the system memory at the predefined location with the help of a bootloader at the time of resume. Since a bootloader has to copy the entire snapshot image into the predefined memory to resume the previous suspended computing state, a little bit long time is required to resume. Improved snapshot boot does not create a snapshot image consisting of whole memory pages at the time of suspend, thus resulting in smaller snapshot image than the existing snapshot boot. The remaining pages are in the swap area. The resulting smaller sized snapshot image enables much faster booting latency. Through the experiment, we can see the booting latency is reduced almost 30% with suspend image of 2982 pages. This result depends on the amount of swap-out pages.

Real-Time Arbitrary Face Swapping System For Video Influencers Utilizing Arbitrary Generated Face Image Selection

  • Jihyeon Lee;Seunghoo Lee;Hongju Nam;Suk-Ho Lee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.31-38
    • /
    • 2023
  • This paper introduces a real-time face swapping system that enables video influencers to swap their faces with arbitrary generated face images of their choice. The system is implemented as a Django-based server that uses a REST request to communicate with the generative model,specifically the pretrained stable diffusion model. Once generated, the generated image is displayed on the front page so that the influencer can decide whether to use the generated face or not, by clicking on the accept button on the front page. If they choose to use it, both their face and the generated face are sent to the landmark extraction module to extract the landmarks, which are then used to swap the faces. To minimize the fluctuation of landmarks over time that can cause instability or jitter in the output, a temporal filtering step is added. Furthermore, to increase the processing speed the system works on a reduced set of the extracted landmarks.

Design of Optimized SWAP System for Next-Generation Storage Devices (차세대 저장 장치에 최적화된 SWAP 시스템 설계)

  • Han, Hyuck
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.4
    • /
    • pp.9-16
    • /
    • 2015
  • On modern operating systems such as Linux, virtual memory is a general way to provide a large address space to applications by using main memory and storage devices. Recently, storage devices have been improved in terms of latency and bandwidth, and it is expected that applications with large memory show high-performance if next-generation storage devices are considered. However, due to the overhead of virtual memory subsystem, the paging system can not exploit the performance of next-generation storage devices. In this study, we propose several optimization techniques to extend memory with next-generation storage devices. The techniques are to allocate block addresses of storage devices for write-back operations as well as to configure the system parameters, and we implement the techniques on Linux 3.14.3. Our evaluation through using multiple benchmarks shows that our system has 3 times (/24%) better performance on average than the baseline system in the micro(/macro)-benchmark.

Development of 100[kW] Decentralized Control-Based Modular ESS for DC distribution system (DC 급전용 100[kW]급 분산 제어기반 모듈형 ESS 개발)

  • Yoon, Yeo-Young;Kim, Hong-Sung;Jeong, Jae-Kee
    • Proceedings of the KIPE Conference
    • /
    • 2011.07a
    • /
    • pp.502-503
    • /
    • 2011
  • 최근 환경 문제 및 화석 에너지의 고갈과 맞물려 신재생 에너지를 사용하는 DC 출력형 분산전원 시스템이 증가 일로에 있으며, 이에 따라 교류 급전시스템보다 에너지 변환 효율이 높은 직류 급전 시스템에 대한 연구개발이 활발히 이뤄지고 있다. 본 논문에서는 유지 보수의 용이성을 확보한 Hot Swap 구조형식의 DC 급전용 100[kW]급 분산 제어기반 모듈형 ESS[Energy Storage System의 개발에 관한 것이다. 실제 33[kW]급 모듈 3대로 구성된 100[kW]급 시스템을 제작하여 전압제어 실험, 병렬운전실험 및 Hot Swap 안정성 실험 등을 수행하였다.

  • PDF

A Working-set Sensitive Page Replacement Policy for PCM-based Swap Systems

  • Park, Yunjoo;Bahn, Hyokyung
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.1
    • /
    • pp.7-14
    • /
    • 2017
  • Due to the recent advances in Phage-Change Memory (PCM) technologies, a new memory hierarchy of computer systems with PCM is expected to appear. In this paper, we present a new page replacement policy that adopts PCM as a high speed swap device. As PCM has limited write endurance, our goal is to minimize the amount of data written to PCM. To do so, we defer the eviction of dirty pages in proportion to their dirtiness. However, excessive preservation of dirty pages in memory may deteriorate the page fault rate, especially when the memory capacity is not enough to accommodate full working-set pages. Thus, our policy monitors the current working-set size of the system, and controls the deferring level of dirty pages not to degrade the system performances. Simulation experiments show that the proposed policy reduces the write traffic to PCM by 160% without performance degradations.

A Study on the Effect of Financial Cooperation in East Asia on the Export-Import Logistics (수출입 물류에 동아시아 금융협력이 미치는 영향 분석)

  • Kang, Bo-Kyung
    • Journal of Korea Port Economic Association
    • /
    • v.27 no.3
    • /
    • pp.161-177
    • /
    • 2011
  • Nowadays, a capital flow and intimacy of financial system among countries have been increasing in global financial environment. So it is easily possible that the risk of some countries which are in financial crisis infects other countries in the world. A recent global financial crisis reminds countries in East Asia of advancing the financial cooperation as well as financial integration. Countries in East Asia agreed with the Chiang Mai Initiative to prevent a recurrence of financial crisis in East Asia. A bilateral swap arrangement of the CMI has several purposes in order to offer foreign currency liquidity against economic crisis, remove the opportunity cost of foreign exchange reserve, push ahead the financial integration, increase the export-import logistics and so on. This paper analyzes the effect of financial cooperation in East Asia on the export-import logistics with random effect estimation and fixed effect estimation. As a result, each of country in East Asia is able to increase almost 10.3% of the export-import logistics on average.

An Improved Mean-Variance Optimization for Nonconvex Economic Dispatch Problems

  • Kim, Min Jeong;Song, Hyoung-Yong;Park, Jong-Bae;Roh, Jae-Hyung;Lee, Sang Un;Son, Sung-Yong
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.1
    • /
    • pp.80-89
    • /
    • 2013
  • This paper presents an efficient approach for solving economic dispatch (ED) problems with nonconvex cost functions using a 'Mean-Variance Optimization (MVO)' algorithm with Kuhn-Tucker condition and swap process. The aim of the ED problem, one of the most important activities in power system operation and planning, is to determine the optimal combination of power outputs of all generating units so as to meet the required load demand at minimum operating cost while satisfying system equality and inequality constraints. This paper applies Kuhn-Tucker condition and swap process to a MVO algorithm to improve a global minimum searching capability. The proposed MVO is applied to three different nonconvex ED problems with valve-point effects, prohibited operating zones, transmission network losses, and multi-fuels with valve-point effects. Additionally, it is applied to the large-scale power system of Korea. The results are compared with those of the state-of-the-art methods as well.

A Study on the extension for frequency band and the character of Direct Digital Frequency Synthesizer (직접 디지탈 주파수 합성기의 특성과 주파수 대역 확장에 관한 연구)

  • 김경석;김원후
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1988.10a
    • /
    • pp.101-108
    • /
    • 1988
  • In this paper packet-swap Accptant Queveing system with synchronous single server and finite storage space is proposed for throughput improvement. Queueling systems are analyzed with Minisint Approximation reported by J.F CHANG and R.F Chang. Comparison between PSA. Queveing system and First-Come First Acceptant Queveing system via throughput and blocking probabilliy of test octet was performed The comparison showed that PAS Queweing system perfumes better than j.F ChANG’s Queveing system.

  • PDF

The Design and Implementation of the Reliable Network RAM using Compression on Linux (리눅스에서 압축을 이용한 안정적인 네트웍 램의 설계 및 구현)

  • 황인철;정한조;맹승렬;조정완
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.232-238
    • /
    • 2003
  • Traditional operating systems use a virtual memory to provide users with a bigger memory than a physical memory. The virtual memory augments the insufficient physical memory by the swap device. Since disks are usually used as the swap device, the cost of a page fault is relatively high compared to the access cost of the physical memory. Recently, numerous papers have investigated the Network RAM in order to exploit the idle memory in the network instead of disks. Since today's distributed systems are interconnected with high-performance networks, the network latency is far smaller than the disk access latency In this paper we design and implement the Network RAM using block device driver on Linux. This is the first implementation of the Network RAM on Linux. We propose the new reliability method to recover the page when the other workstation's memory is damaged. The system using the Network RAM as the swap device reduces the execution time by 40.3% than the system using the disk as the swap device. The performance results suggest that the new reliability method that use the processor more efficiently has the similar execution time with others, but uses smaller server memory and generates less message traffic than others.