• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.23-28
• /
• 2012

The performance improvement of the secondary storage is very slow compared to the main memory and processor. The data is loaded from secondary storage to memory for the execution of an application. At this time, there is a bottleneck. In this paper, we propose an Executable Compression Method to speed up the initial loading time of application. and we examined the performance. So we implemented the two applications. The one is a compressor for Execution Binary File. and The other is a decoder of Executable Compressed application file on the Embedded System. Using the test binary files, we performed the speed test in the six files. At the result, one result showed that the performance was decreased. but others had a increased performance. the average increasing rate was almost 29% at the initial loading time. The level of compression had different characteristics of the file. And the performance level was dependent on the file compressed size and uncompress time. so the optimized compression algorithm will be needed to apply the execution binary file.

• Asia pacific journal of information systems
• /
• v.2 no.2
• /
• pp.71-84
• /
• 1992

Analysis for the file with distributed free space such as a VSAM has been done. Birth and death process has been adopted to describe the status changes of control intervals in a VSAM file. File utilization is calculated as a function of the number of control intervals which contain different number of records in them. Effect of the control interval sizes and the loading factors are analyzed over the time horizon.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.215-223
• /
• 1997

The advantages of service in satellite links are representatively a long distance and large capacity transfer and simultaneous communication. And terrestrial links are of high speed and high quality data transfer Therefore a combined form of characteristics of satellite and terrestrial links is desirable to furnish a good quality service to subscribers. And in satellite links an analysis method and a simulation method of file transfer are conducted to evaluate the efficiency of file transfer. The parameters are used the message length and transmission time, and the number of chain record and transmission time. From the results of evaluation, in satellite links, it is found that when the message length is shorter than 512 bytes, the file transmission time becomes extremely long and when the message length is set at 1024 bytes, the file transmission time abruptly increase from 2048 bytes. Also it is confirmed that when the number of chain record is under 15, the file transmission time becomes extremely long and if the number increase up to 90,the time becomes gradually short and over 90,it becomes constant.Therefore,from the result of file transmission in th case of utilizing satelite links,it is confirmed that the optimum message length in the minmum transmission time is present closely at 1024 bytes.Also it is confirmed that when the satelite transmission sped becoms smaller from 24kbps to2400bps,the optimum message length also becomes smaller from 640 bytes to 256bytes.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.2
• /
• pp.101-108
• /
• 2008

In this paper, we develop system to backup automatically personal data by real time based on ECA model. This system backups data that is changed in user PC using CDP technology based on ECA model. Proposed ECA model defines file's change such as file creation, update, remove etc. in user PC to event for synchronization between server and user PC. If event is detected about file, proposed system examines condition that is defined and backup the file to server. Backup data that is stored to server can recovery on point of time that user wants. The proposed system can be applied to data management system for business, personal data management system, high-capacity contents management system etc.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.2
• /
• pp.135-140
• /
• 2011

Currently, studies have show that the network related energy consumption are increasing. and part of overall energy consumption of our society are too. So, that is important to look for energy-efficient network applications and protocols. A most of network energy consumption are due to network edge devices. in this paper, in order to cut down the emissions of carbon dioxide from ICT business, which contributes 2% of the global energy consumption, it is necessary to understand energy consumption in peer-to-peer system. In this paper, in this paper we propose a architecture based on the introduction of a p2p proxy. The model is analyzed analytically and numerically to reveal how these factors influence the overall power consumption in both steady state and flash crowd information exchange scenarios. Specifically, our results show that the proxy-based solution can provide up to 50% reduction in the energy consumption and, at the same time, a significant reduction in the average file download time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.527-535
• /
• 2004

Handling mixed workload in digital set-top box or streaming server becomes an important issue as integrated file system gets momentum as the choice for the next generation file system. The next generation file system is required to handle real-time audio/video playback while being able to handle text requests such as web page, image file, etc. Legacy file system provides only best effort I/O service and thus cannot properly support the QoS of soft real-time I/O. In this paper, we would like to present our experience in developing the file system which fan guarantee the QoS of multimedia stream. We classify all application I/O requests into two category: periodic I/O and sporadic I/O. The QoS requirement of multimedia stream could be guaranteed by giving a higher priority to periodic requests than sporadic requests. The proto-type file system(Qosfs) is developed on Linux Operating System.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.77-82
• /
• 2023

Multi-cloud rendering has been attracting attention recently as the computational load of rendering fluctuates over time and each rendering process can be performed independently. However, it is challenging in multi-cloud rendering to deliver large amounts of input data instantly with consistency constraints. In this paper, we develop a new distributed file system for multi-cloud rendering. In our file system, a local machine maintains a file server that manages versions of rendering input files, and each cloud node maintains a rendering cache manager, which performs distributed cooperative caching by considering file versions. Measurement studies with rendering workloads show that the proposed file system performs better than NFS and the uploading schemes by 745% and 56%, respectively, in terms of I/O throughput and execution time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.384-393
• /
• 2002

A Parallel file system is normally used to support excessive file requests from parallel applications in a cluster system, whereas prefetching is useful for improving the file system performance. This paper proposes a new prefetching method, Fips(dynamic File Prefetching Scheme based on file access patterms), that is particularly suitable for parallel scientific applications and multimedia web services in a parallel file system. The proposed prefetching method introduces a dynamic prefetching scheme to predict data blocks precisely in run-time although the file access patterns are irregular. In addition, it includes an algorithm to determine whether and when the prefetching is performed using the current available I/O bandwidth. Experimental results confirmed that the use of the proposed prefetching policy in a parallel file system produced a higher file system performance.

• The Journal of the Korean dental association
• /
• v.38 no.12 s.379
• /
• pp.1167-1171
• /
• 2000

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.256-260
• /
• 2008

This paper describes an improvement of mount-time delay in NAND Flash file systems. To improve file system mount performance, this work configures a hierarchical storage system with byte-addressable NVRAM and NAND Flash memory, and let the meta data of a file system allocated in the NVRAM. Since the meta data are stored in NVRAM supporting data integrity some of the items, which are stored in Spare area and Object Header area of NAND Flash memory to control meta data of NAND Flash file system, could be eliminated. And also, this work eliminates the scanning operation of the Object Header area of previous work FRASH1.0. The scanning operation is definitely required to find out the empty Object Header address for storing the Object Header data and provokes a certain amount of performance loss in file generation and deletion. In this work, an implemented file system, so-called FRASH1.5, is demonstrated, featuring new data structures and new algorithms. The mount time of FRASH1.5 becomes twice as fast as that of the FRASH1.0. The performance in file generation gets improved by about $3{\sim}8%$. In particular, for most large-size files, the FRASH1.5 has 8 times faster mount time than YAFFS, without any performance loss as seen in the file generation.