• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.229-234
• /
• 2004

In this study, the performance is compared between RFC compatible normal TCP and several speed constraints Ignored TCP. To do these, the main algorithms that constraints the transmit rate of TCP are modified. We have modified TCP protocol stack in a Linux kernel to compare the speeds between the standard TCP and our modified TCP. We find that if the destination is short distance away from the source and packet error is scarce then the speed differences between normal and modified TCP nay be negligible. However, if the destination is far away from the source and slow start algorithm is not adopted then the transfer time for small file is different greatly In addition, if packet error occurred frequently, our modified TCP is faster than the standard TCP regardless of distance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.4
• /
• pp.9-18
• /
• 2013

Flash memory is mostly used on smart devices and embedded systems because of its nonvolatile memory, low power, quick I/O, resistant shock, and other benefits. Generally the typical file systems base on the NAND flash memory are YAFFS2, JFFS2, UBIFS, and etc. In this paper, we had variously made an experiment regarding I/O performance using our schemes and the UBIFS of the latest Linux Kernel. The proposed I/O performance analyses were classified as a sequential access and a random access. Our experiment consists of 6 cases using kmalloc(), vmalloc(), and kmem_cache(). As a result of our experiment analyses, the sequential reading and the sequential rewriting increased by 12%, 11% when the Case 2 has applied vmalloc() and kmalloc() to the UBI subsystem and the UBIFS. Also, the performance improved more by 7.82%, 6.90% than the Case 1 at the random read and the random write.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.610-617
• /
• 2007

Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. However, the cumulative site of incremental checkpoints increases at a steady rate over time because a number of updated values may be saved for the same page. In this paper, we present a comprehensive overview of Pickpt, a page-level incremental checkpointing facility. Pickpt provides space-efficient techniques aiming to minimizing the use of disk space. For our experiments, the results showed that the use of disk space using Pickpt was significantly reduced, compared with existing incremental checkpointing.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.566-572
• /
• 2017

As NAND flash storage is being widely used, its simulation methodologies have been studied in various aspects such as performance, reliability, and endurance. As a result, there have been advances in NAND flash storage simulation for both functional modeling and timing modeling. However, in addition to these advances, there is a need to drastically reduce the long simulation time that is required to evaluate the aging effect on flash storage. This paper proposes a so-called multi-core scalable real-time flash storage simulation method, which can control the simulation speed according to the user's preference. According to this method, it is possible to speed up the simulation in proportion to the number of CPU cores arbitrarily given while guaranteeing the correctness of the simulation result. Using our simulator implemented in the form of the Linux kernel module, we demonstrate the multi-core scalability and correctness of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.19-26
• /
• 2010

In this paper, we adopt Storage Class Memory, which is next-generation non-volatile RAM technology, as part of main memory parallel to DRAM, and exploit the SCM+DRAM main memory system from the dependability perspective. Our system provides instant system on/off without bootstrapping, dynamic selection of process persistence or non-persistence, and fast recovery from power and/or software failure. The advantages of our system are that it does not cause the problems of checkpointing, i.e., heavy overhead and recovery delay. Furthermore, as the system enables full application transparency, our system is easily applicable to real-world environments. As proof of the concept, we implemented a system based on a commodity Linux kernel 2.6.21 operating system. We verify that the persistence enabled processes continue to execute instantly at system off-on without any state and/or data loss. Therefore, we conclude that our system can improve availability and reliability.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.517-526
• /
• 2001

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). While active queue management in routers and gateways can potentially reduce total packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In this paper, in order to solve this problem, a new active queue management algorithm called MRED(Modified Random Early Detection) is proposed. MRED computes the packet drop probability based on our heuristic method rather than the simple method used in RED. Using simulation, MRED is shown to perform better than existing queue management schemes. To analyze the performance, we also measure throughput of traffics under the FIFO control, and compared the performance with that of this MRED system.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1472-1482
• /
• 2005

In this paper, we propose a socket interface layer for large-scale multimedia servers that adopt TCP/IP Offload Engines (TOE). In order to provide legacy network applications with binary level compatibility, the socket interface layer intercepts all socket-related system calls to forward to either TOE or legacy TCP/IP Protocol stack. The layer is designed and implemented as a kernel module in Linux. The layer is located between BSD socket layer and INET socket layer, and passes the application's socket requests to INET socket layer or TOE. The layer provides multimedia servers and web servers with the following features: (1) All standard socket APIs and file I/O APIs that are supported (2) Support for binary level compatibility of existing socket programs (3) Support for TOE and legacy Ethernet NICs at the same time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.493-497
• /
• 2005

This paper is about the research of the User Agent implementation under wireless embedded environment, using SIP which is one of protocol components construct the VoIP system. The User Agent is made of the User Agent configuration block, the device thread block to control devices and the SIP stack block to process SIP messages. The device thread consists of the RTP thread and the sound lard device processing block. Futhermore, the SIP stack consist of the worker thread to process proxy events, the SIP transceiver and SIP thread to transfer and receive SIP messages. The H/W platform is a board included the Intel's XScale PXA255 processor, flash memory, SDRAM, Audio CODEC module and wireless LAN threough PCMCIA socket, furthermore a microphone and headphone is used by the audio 1/0. The system has embedded linux kernel 2.4.19. For embedded environment, the function of User Agent and SIP method is diminished. Finally, the resource of system could be reduced about $12.9\%$, compared to overall system resource, by minimizing peripherals control and excepting TCP.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.526-529
• /
• 2015

as the smartphone industry developed, the smartphone's internal hardware devices have become high-end devices and it requires more power consumption than the previous one. therefore a battery of high capacity needed, but there is a limit in order to equip a large battery on account of smartphone minimization. The Linux Kernel provides the DVFS Mechanism to compensate for these limitations by software techniques. DVFS is dynamically adjust the frequency of the CPU to reduce the power consumption of the CPU. ondemand governor, the default policy in DVFS, apply the maximum frequency of the CPU whenever exceeding the up_threshold. so it result in a waste of CPU resources. by paying attention to this point, this paper propose the mechanism that maintain a high CPU utilization in proportion to the current frequency of the cpu to prevent the waste of CPU resources and conserve energy.