• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1669-1675
• /
• 2005

Recently, the small sized wireless terminals have problems of processing of large sized file because of the trends of a small sized terminals and a large sized files. Moreover, the web servers or the file servers have problems of the overload because of the concentration with many number of files to the them. Also, There is a security vulnerability of the data processing caused by the processing with a unit of the independent file. To resolve the problems, this paper proposes a new scheme of fat splining distribution using the P2P networks with the mesh topology. The proposed scheme is to distribute blocks of file into any peer of P2P networks. It can do that the small sized wireless terminals can process the large size file, the overload problems of a web or file servers can solve because of the decentralized files, and, the security vulnerability of the data processing is mitigated because of the distributed processing with a unit of the blocks to the peers.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.57-64
• /
• 2008

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The proposed policy considers file size to reduce the number of files corresponding to a requested file rather than forecasting the uncertain future for replacement. The results of the simulation show that hit ratio was similar when the cache size was small, but the proposed policy was superior to traditional policies when the cache size was large.

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

With the advance in digital technologies and the increasing prevalence of high quality multimedia contents, there is a growing user demand for multimedia devices, such as mobile phones, digital TV, PMP, digital camcoders, digital cameras. Such devices provide various services associated with multimedia file manipulation, including multimedia contents playback, multimedia file editing, etc. Conventional file systems exhibit a performance-related drawback that requires considerable amount of time and disk I/Os in order to store large-sized edited multimedia files. This paper proposes a fast, efficient writing technique for large-sized edited multimedia files by using data block sharing with adjustment of inode block pointers. Our experiments show that the proposed scheme not only improves write performance of the Ext3 file system on average by 16 times with various types of edited multimedia files, but also reduces consumed disk space dramatically through the data block sharing.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.511-516
• /
• 2006

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used) LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The results of the simulation show that the proposed policy performs better than traditional policies.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.661-671
• /
• 1998

It is important to minimize the number of disk accesses which is necessary to transfer data in disk into main memory when processing transactions in physical database design. A vertical file partitioning method is used to reduce the number of disk accesses by partitioning relations vertically and accessing only necessay fragments. In this paper, SOFM(Self-Organizing Feature Maps) network is used to solve vertical partitioning problems. This paper shows that SOFM network is efficient in solving vertical partitioning problem by comparing approximate solution of SOFM network with optimal solution of N-ary branch and bound method. And this paper presents a heuristic algorithm for allocating duplicate attributes to vertically partitioned fragments. As branch and bound method requires particularly much computing time to solve large-sized problems, it is shown that SOFM network is able to overcome this limitation of branch and bound method and solve large-sized problems efficiently in a short time.

• The KIPS Transactions:PartA
• /
• v.17A no.2
• /
• pp.63-72
• /
• 2010

Recently, the need for multimedia devices, such as digital TV, and camcorder has increased. These devices provide many services on multimedia files such as playing, recording, and editing. Throughout these services, in case of storing edited large-scaled multimedia files, existing file system have several capability problems that are taking too much time and requiring disk I/O. In this paper, we propose the use of Linux Ext2 file system based 'Block-Link file (BL-file) system' in order to solve these problems. For the BL-file system, when editing and storing large-scaled files, there is no data input or output but only modification of the metadata. Additionally, by sharing data blocks between multimedia files, we can save disk spaces. Moreover, because the managing of data block sharing information is more convenient than the existing FWAE technique, we can lessen system overhead. The BL-file system is based on Ext2 file system and implemented in a Linux environment, and the usefulness of the proposed technique is validated by applying the Linux multimedia file-editing tool 'Avidemux'.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.1-10
• /
• 1995

The allocation of files is essential to the efficiency and effectiveness of a distributed system that must meet geographically dispersed data processing demands. In this paper, we address an optimization model that generates optimal file migration policies in distributed database systems. The proposed model is a more generalized model that includes system's capacity constraints - computing sites' storage capacity and communication networks' capacity - which have not taken into consideration in previous researches. Using this model, we can establish initial file allocation, file reallocation and file migration polices that minimize a system operating cost under system's capacity constraints at an initial system design or reorganization point The proposed model not only can be adopted by small-sized systems but also provides a foundation for effective and simple heuristics for adaptive file migration in large systems.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.25-34
• /
• 2003

Because of explosive growth in demand for web-based multimedia applications, proper proxy caching for large multimedia object (especially video) has become needed. For a video object which is much larger in size and has different access characteristics than the traditional web object such as image and text, caching the whole video file as a single web object is not efficient for the proxy cache. In this paper, we propose a proxy caching strategy with the constant-sized segment for video file and an improved proxy cache replacement policy. Through the event-driven simulation under various conditions, we show that our proposal is more efficient than the variable-sized segment strategy which has been proven to have higher hit ratio than other traditional proxy cache strategies.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.1
• /
• pp.31-42
• /
• 2017

Thumbnail, the small sized graphic file such as JPEG or GIF, serves to help the users to be recognized as a rapidly helps to make it easier recognize while browsing the large sized graphic file. Gallery application, which is installed in a later version of the 4.4.x(Kitkat) Android smartphone records the generated time of graphic file in thumbnail metadata. Thumbnail can be used to draw up the timeline of user action about user's action such as creation, modification, deletion with original graphic file analysis. Also, take advantage of the features thumbnails are stored sequentially in a single thumbcache file, even if the thumbcache is deleted, we can restore the thumbnails. This paper illustrates the feature of thumbnail created by Android OS basic gallery app and methods for utilization in digital forensics.

• Journal of Advanced Navigation Technology
• /
• v.27 no.5
• /
• pp.610-620
• /
• 2023

The interest in the aircraft interior market is gradually growing due to technological development based on the 4th industrial revolution and competition for airlines to attract customers, and as part of that, Cabin Display System (CDS) for FAA Part.25 civil aircraft is being developed in Korea. The CDS is a system that provides various multimedia services to passengers by utilizing Flexible and Transparent Organic Light Emitting Diodes (OLED) with Integrated Display Processing Module (IDPM). This paper presents a new method for efficient Data Load Process of large-sized files and deals with their implementation and performance. The results of this study are expected to be applied to Data Load Process development of avionics that require reliable large-capacity file transmission along with reducing the costs of development compared to existing ARINC-615A.