• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.548-551
• /
• 2003

JSize is a Java equivalent of the Unix size program. The Unix size program analyses an executable file and estimates the size of code and data segment when the file is loaded on memory. Likewise, JSize analyze a Java class file and estimates the size of class area when the file is loaded on memory. This paper presents the principles necessary to estimate the class area size with the information obtained from a class file. An experimental result is included to show the accuracy of estimation the JSize provides.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.1-8
• /
• 2017

In this paper, we propose a file system for flash memory which remedies shortcomings of existing flash memory file systems. Besides supporting large block size, the proposed file system reduces time in initializing file system significantly by adopting logical address comprised of erase block number and bitmap for pages in the block to find a page. The file system is suitable for embedded systems with limited main memory since it has small in-memory data structures. It also provides efficient management of obsolete blocks and free blocks, which contribute to the reduction of file update time. Finally the proposed file system can easily configure the maximum file size and file system size limits, which results in portability to emerging larger flash memories. By conducting performance evaluation studies, we show that the proposed file system can contribute to the performance improvement of embedded systems.

• Restorative Dentistry and Endodontics
• /
• v.28 no.1
• /
• pp.64-71
• /
• 2003

The purpose of this study was to compare the initial apical file(IAF) first Ole that fits to the apex in each canal before and after early flaring to analyze if the size of file to fit to the apex would increase after flaring. Eighty anterior teeth with complete apical formation and patent foramens were selected. The samples were randomly divided into 4 groups(GG, OS, GT, PT Group) of 20 teeth each. A file was fit to the apex in each canal and that size recorded. Radicular flaring were completed using different types of instruments. After flaring a file was again fit to the apex in the same manner as before and its size recorded. The results of this study were as follows : 1. The mean diameter of IAF before flaring(file diameters in $mm{\times}10^{-2}$) was $19.81{\pm}8.32$ before and $25.94{\pm}9.21$ after(p<0.05). 2. The increase in diameter of IAF was approximately one file size for all groups. 3. Ranking of increasing diameter of IAF were GG>CT>OS>PT group. There was a statistically significant difference between before and after flaring(p<0.05). 4 Ranking of the time for flaring were GG>GT>OS>PT group. There was a statistically significant difference between GG group and other groups(p<0.05). 5. In the case without change of IAF diameter, they showed decrease in force after flaring when IAF was pulled out from root canal(p<0.05). This study suggested that early radicular flaring increases the file size that is snug at the apex, and awareness of that difference gives the clinician a better sense of canal size. Early flaring of the canal provides better apical size information and with this awareness, a better decision can be made concerning the appropriate final diameter needed for complete apical shaping.

• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.12 s.177
• /
• pp.205-210
• /
• 2005

This paper addresses the correlation between the change of file size and the scanning path build time by the slicing height of STL file. Though the study about STL file has been achieved quite actively scanning path build time using STL file is not investigated so much to be satisfied. The file size depends on the number of polygon created by the slicing height specified. And this number of polygons increases in a regular rate. The correlation between the number of polygons and the scanning path build time is examined and verified.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.11 no.4
• /
• pp.1-9
• /
• 2008

It is restricted on CPU ability, memory, display size and networking to process GIS data on ubiquitous-based terminal. For that reason, we tried to improve the cadastral electronic file to solve these problems in this paper. The format of old cadastral electronic files is not efficient because it is made of file structure. So, it has inconvenience to let us read whole file, displaying on the screen and connecting to geographic objects by adding index file like database for connecting to geographic object and displaying on the screen. The file size was decreased to 27.6% of original file size through converting format.

• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.29-43
• /
• 2004

As the development of an information technique, gradually, mobile device is going to be miniaturized and operates at high speed. By such the requirements, the devices using a flash memory as a storage media are increasing. The flash memory consumes low power, is a small size, and has a fast access time like the main memory. But the flash memory must erase for recording and the erase cycle is limited. JFFS is a representative filesystem which reflects the characteristics of the flash memory. JFFS to be consisted of LSF structure, writes new data to the flash memory in sequential, which is not related to a file size. Mounting a filesystem or an error recovery is achieved through the sequential approach. Therefore, the mounting delay time is happened according to the file system size. This paper proposes a MJFFS to use a multi-checkpoint information to manage a mass flash file system efficiently. A MJFFS, which improves JFFS, divides a flash memory into the block for suitable to the block device, and stores file information of a checkpoint structure at fixed interval. Therefore mounting and error recovery processing reduce efficiently a number of filesystem access by collecting a smaller checkpoint information than capacity of actual files. A MJFFS will be suitable to a mobile device owing to accomplish fast mounting and error recovery using advantage of log foundation filesystem and overcoming defect of JFFS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.581-591
• /
• 2001

We consider some problems of remote file accesses of multiple clients in mobile computing environments. In this environment, user mobility affects file access latency. Mobile hosts have severe resource constraints in terms of limited size of non-volatile storage. Thus, the burden of computation and communication load raise file access latency. In this paper, we propose a scheme for reducing the file access latency through the file migration. The objective is to minimize of file accesses for all mobile hosts which delivering the file to clients as quickly as possible. We develope an on-demand scheme which determines when the file server should migrate files to another server, or when it should transfer files to mobile hosts. Using simulation, we examine the effects which parameters such as file access frequency, file size, mobility rate have on file system access latency. Through simulation results, we show that our proposed migration scheme is effective in reducing the access latency on the requested file of a mobile host with high access rate and low mobility.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.855-858
• /
• 1998

Nowadays it is possible to make realization of Multimedia service by virtue of developing computer hardware technique and high-bandwidth network. But Multimedia service has some problems. Its file need large storage. Above all, Analog CCTV used in recent has been utilized for various purpose in ban, company and public institution, but this has many defects such as management, low resolution, and etc. To overcome this problems, multimedia component-file-have to be reduced in size. This paper proposes adaptive MPEG-1 video to reduce file size. The method in this paper is realized that according to movement variation, file size is reduced by adaptively making use of MQuant.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.149-157
• /
• 2020

Today, due to the large amount of data duplication caused by the increase in user data, various deduplication studies have been conducted. However, research on personal storage is relatively poor. Personal storage, unlike high-performance computers, needs to perform deduplication while reducing CPU and memory resource usage. In this paper, we propose an adaptive algorithm that selectively applies fixed size chunking (FSC) and whole file chunking (WFH) according to the file type and size in order to maintain the deduplication rate and reduce the load in personal storage. We propose an algorithm for minimization. The experimental results show that the proposed file system has more than 1.3 times slower at first write operation but less than 3 times reducing in memory usage compare to LessFS and it is 2.5 times faster at rewrite operation.