• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.57-64
• /
• 2004

The speed gap between processors and disks is a serious problem. So, I/O sub-system limits the performance of computer system. To overcome the speed gap, caches have been used in computer system. By using cache, the access times to disk blocks can be reduced and the performance of computer system can be improved. In this paper, we proposed an efficient cache management algorithm for computer system which have buffer cache and disk cache. The proposed algorithm can minimize the duplicated blocks between buffet cache and disk cache. We evaluate the proposed algorithm by trace-driven simulation. The simulation results show that the proposed algorithm can reduce the mean access time to disk blocks.

• Journal of Internet Computing and Services
• /
• v.14 no.1
• /
• pp.53-62
• /
• 2013

It is common among users to have multiple computing devices as well as to access their files or do work at different locations. To achieve file consistency as well as mobility in this scenario, an efficient approach for workspace synchronization should be used. However, file synchronization alone cannot guarantee the mobility of work environment which allows activities to be resumed at any place and time. This paper proposes a ubiquitous synchronization approach which provides cloud-based access to a user's workspace. Efficient synchronization is achieved by combining session monitoring with file system management. Experimental results show that the proposed mechanism outperforms Cloud Master-replica Synchronization in terms of number of I/O operations, CPU utilization, as well as the average and maximum latencies in responding to client requests.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.8
• /
• pp.779-788
• /
• 1992

The Input /output (I /0) subsystem is often the bottleneck in high performance computer system. Generally, system performance evaluation models were enhanced to include the effect of the I/0 system. In this paper, we modeled the terminal servers which are Indispensable devices In distribution of computer resources. We use M /M /1 Queueing model for find out the point of the system performance FIFO buffer sizes In the terminal server arc the Important fanctions of the system design and could be effected to the overall system functions. We have proposed the of optimal buffer sizes in the model of terminal server for increasing the system performance. We analizing the vatting time for terruanl server using Queueing model. and We find out the reference model result from simulation.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.502-508
• /
• 2005

This paper proposes a dynamic hybrid patching technique that can improve the performance of VOD systems by adopting the advantages of both greedy patching and grace patching to use a VOD server's limited network-I/O bandwidth. The proposed technique uses grace patching to the requests for the videos, arrival intervals of which are smaller than the size of patching window, and uses greedy patching to the rest requests. In addition, proposed patching technique expands the latest particular patching multicast into a regular multicast for a new request. In result, the patching multicast data for the new request can be the data from the beginning to the skew point of the video and the holding time of a dispatched channel can exceedingly decrease. Simulation results confirm that the proposed technique is better than grace patching in terms of defection rate and average service latency.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.180-187
• /
• 1996

This paper describes a post-layout simulation method using VHDL and C for verifying the architecture of antifuse-based FPGAs and the dedicated CAD system. An antifuse-based FPGA consists of programming circuitry including decoding logic, logic modules, segmented tracks, antifuses and I/O pads. The VHDL model which includes all these elements is used for logic verification and programming verification of the implemented circuit by reconstructing the logic circuit from the bit-stream generated from layout tool. The implemented circuit comprises of logic modules and routing networks. Since the routing delay of the complex networks is comparable to the delay of the logic module in the FPGA, the accurate post-layout simulation is essential to the FPGA system. In this paper, the C program calculates the delay of the routing netowrks using SPICE, elmore or horowitz delay models and the results feedback to the VHDL simulation. Critical path anc be found from this post-layout simulation results.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.69-72
• /
• 2000

Multilevel modulation schemes are known to be highly bandwidth efficient. By varying modulation level adaptively according to channel conditions (i.e. adaptive QAM schemes or AQAM), high bandwidth efficiency can be achieved. This paper considers the effect of time delay on the adaptive QAM schemes in dispersive fading channels. In order to undertake investigations effectively, a simulator has been developed. The simulation results show that the BER performance obtained for the wideband channel with a delay spread of 0.75 $\mu$sec is better than 10$^{-4}$ with a SNR value of 40 ㏈ and ABPS is found to be approximately 5.5.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.153-156
• /
• 2004

위치기반 서비스 시스템에서 주 요구사항은 사용자의 실시간 위치 정보 검색과 질의에 대한 빠른 응답시간이다. 그러나 기존의 위치기반서비스 시스템에서 저장장치로 사용하는 디스크 기반 데이터베이스 시스템은 빈번한 디스크 I/O로 인해 발생하는 질의응답에 대한 시간지연으로 이러한 요구사항을 만족시키지 못한다. 또한 주기억장치 데이터베이스 시스템은 한번에 주기억장치에 적재할 수 있는 양이 제한되어 있기 때문에 대용량의 공간 데이터를 처리하는데 문제가 있다. 본 논문에서는 위치기반서비스를 위하여 위치 정보 데이터의 다단계 저장 관리를 통해 LBS 플랫폼에서 실시간 서비스를 지원하는 하이브리드 저장 관리자를 제안한다. 하이브리드 저장 관리 시스템은 위치기반 서비스 시스템에서 대용량의 이동체 데이터의 효과적인 저장 및 관리를 위해 주기억장치 데이터베이스 관리시스템과 디스크 기반의 공간 데이터베이스 관리시스템을 통합한 구조를 가진다. LBS 플랫폼에서 빠른 응답을 필요로 하고 자주 사용되는 데이터는 메모리 기반의 데이터베이스에 관리를 하고, 사용 빈도가 적은 데이터는 디스크 기반의 데이터베이스에 관리하는 하이브리드 저장 관리자를 제시한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.3 s.357
• /
• pp.43-51
• /
• 2007

OneNAND flash combines the advantages of NAND and NOR flash, and has become an alternative to the former. But the advanced features of OneNAND flash are not utilized effectively in demand paging systems designed for NAND flash. We propose delayed dual buffering, a demand paging system which fully exploits the random-access I/O interface and dual page buffers of OneNAND flash demand paging system. It effectively reduces the time of page transfer from the OneNAND page buffer to the main memory. On average, it achieves and 28.5% reduction in execution time and 4.4% reduction in paging system energy consumption.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.101-112
• /
• 2009

Existing techniques for defragmentation of the file system need intensive disk operation for some periods at specific time such as disk defragmentation program. In this paper, for solving this problem, we design and implement the automatic and continuous defragmentation free system by distributing the disk operation. We propose the Automatic Layout Scoring(ALS) mechanism for measuring defragmentation degree and suggest the Lazy Copy mechanism that copies the defragmented data at idle time for scattering the disk operation. We search the defragmented file by Automatic Layout Scoring mechanism and then find for empty spaces for that searched file. After lazy copy of searched fils to empty space for preventing that file from being lost, the algorithm solves the defragmentation problem by updating the I-node of that file. We implement these algorithms in Linux and evaluate them for small and defragmented file to get the layout scoring. We outperform the Linux EXT2 file system by $2.4%{\sim}10.4%$ in layout scoring evaluation. And the performance of read and write for various file size is better than the EXT2 by $1%{\sim}8.5%$ for write performance and by $1.2%{\sim}7.5%$ for read performance. We suggest this system for solving the problem of defragmentation automatically without disturbing the I/O task and manual management.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.363-373
• /
• 2017

Ext4 file system is widely used in various computing environments such as those of the PC, the server, and the Linux-based embedded system. Ext4, which uses a buffer for block I/O, provides fsync() system call to applications to guarantee the consistency of a specific file. A log of the analytical studies regarding the operation of Ext4 and the improvement of its performance has been compiled, but it has not been studied in detail in terms of kernel versions. We figure out that the behavior of fsync() system call is different depending on the kernel version. Between the kernel versions of 3.4.0 and 4.7.2, 3.4.0, 3.8.0, and 4.6.2 showed behavioral differences regarding the fsync() system call. The latency of fsync() in kernel 3.4.0 is longer than that of the more-advanced 3.7.10; meanwhile, the characteristics of 3.8.0 enabled the disruption of the Ext4 journaling order, but the ordered defect was solved with 4.6.2.