• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.886-888
• /
• 2005

고품질의 확장성 있는 서비스를 제공함으로써 다수의 사용자의 요청을 처리하고 시스템을 견고하게 유지할 수 있는 인터넷 서버를 구현하기 위한 한 가지 방법은 비동기 입출력 기능(AIO)을 이용하는 것이다. 기존의 고전적인 입출력 방식인 poll()/select()에 비해 AIO는 CPU 부하를 비롯한 시스템 자원의 낭비를 줄일 수 있으며, 입출력 완료를 기다리면서 블록되지 않으므로 시스템 부하를 감소할 수 있다. 본 논문에서는 리눅스 커널에 구현되어 있는 파일 기반 AIO기능을 네트워크 소켓 상에서 동작할 수 있도록 확장 구현하였으며, 그 구조에 대하여 자세히 설명하였다. 또한 클라이언트-서버 구조를 모델링한 실험을 통해 기존 메커니즘과의 성능 차이를 비교하였다.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.653-656
• /
• 2003

We have designed embedded web sewer system and ported Linux operating system version 2.4.5 at our system. And then We implemented to control and monitor widely separated hardware and implemented to monitor widely separated image using CMOS image sensor HV7131B. Web server is the Boa web server with General Public License. We designed for this system using of Intel's SA1110 ARM core base processor and connecting input and output device at GPIO port of SA1110. Device driver of General purpose I/O for Embedded Linux OS is designed. And then the application program controlling driver is implemented to use of common gate interface C language. User is available to control and monitor at client PC. This method have benefit to reduce the Expenditure of hardware design and development time against PC base system and have various and capacious application against firmware base system.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.524-530
• /
• 2016

The desire to access data faster and the growth of next-generation memories such as non-volatile memories, contribute to the development of research on memory file systems. It is recommended that memory mapped file I/O, which has less overhead than read-write I/O, is utilized in a high-performance memory file system. Memory mapped file I/O, however, brings a page table overhead, which becomes one of the big overheads that needs to be resolved in the entire file I/O performance. We find that same overheads occur unnecessarily, because a page table of a file is removed whenever a file is opened after being closed. To remove the duplicated overhead, we propose the mapping cache, a technique that does not delete a page table of a file but saves the page table to be reused when the mapping of the file is released. We demonstrate that mapping cache improves the performance of traditional file I/O by 2.8x and web server performance by 12%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1866-1874
• /
• 2008

Existing web server lowers the whole capacity of system because of the problem on the processing load of server by closing connection increasing code handshake operation, and remarkable decrease of server capacity if it is the state of overload. Also, there occurs disadvantages of increasing connection tine about client's request and response time because handling of client's multi-requests is not smooth because of thread block and it requests a lot of time and resources for revitalization of thread. Therefore, this paper proposes the extended web server which provides the technique for delay handling and improves the overload of server for better system capacity, communication support, and the unification which is the advantage of web service. And it evaluates the existing system(implemented at Tomcat 5.5) and the proposed mobile web server architecture. The extended server architecture provides excellent exchange condition for system capacity and evaluates improved web server architecture which combines multi-thread with thread pool. The proposed web service architecture in this paper got the better result of improved capacity benefit than the evaluation result of original Tomcat 5.5.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.580-587
• /
• 2000

In this paper, we present a design method of a digital filter converting humming voice melody into MIDI data and a method of adapting it to a distributed multimedia I/O server. MuX uses device-independent DLMs(Dynamic Linking Module) for the inteliace with various I/O devices, and has wave-form audio DLM and MIDI DLM for audio interfaces. In order to expand the audio device interfacing ability of MuX system, we have designed and implemented a filter transforming human voice into MIDI messages. As the methods to input MIDI data are expanded to human voice in addition to MIDI files and MIDI instrument, someone who is not good at playing instruments can also generate the MIDI data, which enables our media interfaces to be used in various applications.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.337-346
• /
• 2000

In a Vod(video0on-demand) system, a scheduling strategy is designed to increase the system efficiency and to eatisfy the isochronous requirements of showing a video to multiple viewers with one disk access. In this paper, we have proposed the Stream Relay Scheme (SRS) which utilizes the client's buffer space to reduce the server's disk I/O, buffer consumption, and stream capacity. Under the SRS which we have proposed in this paper, the server does not service all the requests directly but forwards the new request selectively to the client who is being served currently in order to reduce the initial latency and increase the system throughput. The SRS-BAT which integrated the SRS with the Batching technique is introduced. The results of the simulated experiments which compared the SRS with the conventional technique have shown the noticeable performance improvements in terms of initial latency and the server throughput.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.1
• /
• pp.101-108
• /
• 2021

This paper builds a real-time home security system based on the OneNet cloud platform to control the status of the house through a smartphone. The system consists of a local part and a cloud part. The local part has I/O devices, router and Raspberry Pi (RPi) that collects and monitors sensor data and sends the data to the cloud, and the Flask web server is implemented on a Rasberry Pi. When a user is at home, the user can access the Flask web server to obtain the data directly. The cloud part is OneNet in China Mobile, which provides remote access service. The hybrid App is designed to provide the interaction between users and the home security system in the smartphone, and the EDP and RTSP protocol is implemented to transmit data and video stream. Experimental results show that users can receive sensor data and warning text message through the smartphone and monitor, and control home status through OneNet cloud.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1480-1485
• /
• 2015

As SSDs are increasingly being used as high-performance storage or caches, attention is increasingly paid to the provision of SSDs with Quality-of-Service for I/O request streams of various applications in server systems. Since most SSDs are using the AHCI controller interface on a SATA bus, it is not possible to provide a differentiated service by distinguishing each I/O stream from others within the SSD. However, since a new SSD interface, the NVME controller interface on a PCI Express bus, has been proposed, it is now possible to recognize each I/O stream and schedule I/O requests within the SSD for differentiated services. This paper proposes Flash Operation Group Scheduling within NVME-based flash storage devices, and demonstrates through QEMU-based simulation that we can achieve a proportional bandwidth share for each I/O stream.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.