• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.103-108
• /
• 2014

The flash memory which is exploited on hand-held devices such as smart phones is a non-volatile storage and has the benefit that it can store mass data at a small sized chip. To process queries on the mass data stored in the flash memory, the index scheme should be exploited. However, since the write operation of the flash memory is slower than the read operation and the overwrite is not supported, it is required to reevaluate the performance of the index and find out the drawbacks. In this paper, we evaluate the performance of a space division typed index scheme on the flash memory. To do this, we implement the fixed grid file and measure the average speeds of the query and update processing on a various condition and compare the value of the flash memory with that of the magnetic disk.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.201-205
• /
• 2008

The flash memory is widely used as a main storage of embedded devices. It is adopted as a storage of database as growing the capacity of the flash memory. We run TPC-C benchmark on various FTL algorithms. But, the database shows poor performance on flash memory because the characteristic of I/O requests is full random. In this paper, we show the performance of all existing FTL algorithms is very poor. Especially, the FTL algorithm known as good at small mobile equipment shows worst performance. In addition, the chip-inter leaving which is a technique to improve the performance of the flash memory doesn't work well. In this paper, we inform you the reason that we need a new FTL algorithm and the direction for the database in the future.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.70-74
• /
• 2010

As the storage capacity of the flash memories increased portable devices began to store mass amount of multimedia data on flash memory. Therefore, there has been a need for an effective data management scheme by indexing structure. Among many indexing schemes, M-tree is well known for it's suitability for multimedia data with high dimensional matrix space. Since flash memories have writing operation restriction, there is a performance limitation in indexing scheme with frequent write operation. In this paper, a new node split method with reduced write operation for m-tree indexing scheme in flash memory is proposed. According to experiments the proposed method reduced the write operation to about 7% of the original method. The proposed method will effectively construct an indexing structure for multimedia data in flash memories.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.325-334
• /
• 2008

Flash memory is widely used as a storage medium for mobile devices such as cell phones, MP3 players, PDA's due to its tiny size, low power consumption and shock resistant characteristics. Additionally, some computer manufacturers try to replace hard-disk drives used in Laptops or personal computers with flash memory. More recently, there are some literatures on developing a flash memory-aware $B^+$-tree index for an efficient key-based search in the flash memory storage system. They focus on minimizing the number of "overwrites" resulting from inserting or deleting a sequence of key values to/from the $B^+$-tree. However, in addition to this factor, the size of a physical page allocated to a node can affect the maintenance cost of the $B^+$-tree. In this paper, with diverse experiments, we compare and analyze the costs of construction and search of the $B^+$-tree and the space requirement on flash memory as the node size increases. We also provide sorting-based or non-sorting-based algorithms to be used when inserting a key value into the node and suggest an header structure of the index node for searching a given key inside it efficiently.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.83-91
• /
• 2012

Recently, column-oriented storage has become a progressive model for high-speed database systems because of its superior I/O performance. In this paper, we analysis traditional raw-oriented storage model and then propose a new column-aware storage management model using flash memory drive and assist drive to improve the effective performance of the high-speed column-oriented database system. Our storage management scheme called column-aware polarization improves the performance of update operation by dividing and compressing table columns into active-columns or inactive-columns, and balancing congested update operations using a assist drive in high workload periods. The results obtained from experimental tests show that our scheme improves the update throughput of column-oriented storage by 19 percent, and the response time by up to 49 percent.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.377-382
• /
• 2010

With the advent of flash memory based new storage device (SSD), there is considerable interest within the computer industry in using flash memory based storage devices for many different types of application. The dynamic index structure of large text collections has been a primary issue in the Information Retrieval Applications among them. Previous studies have proven the three approaches to be effective: In- Place, merge-based index structure and a combination of both. The above-mentioned strategies have been researched with the traditional storage device (HDD) which has a constraint on how keep the contiguity of dynamic data. However, in case of the new storage device, we don' have any constraint contiguity problems due to its low access latency time. But, although the new storage device has superiority such as low access latency and improved I/O throughput speeds, it is still not well suited for traditional dynamic index structures because of the poor random write throughput in practical systems. Therefore, using the experimental performance evaluation of various index maintenance schemes on the new storage device, we propose an efficient index structure for new storage device that improves significantly the index maintenance speed without degradation of query performance.

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

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.5
• /
• pp.235-243
• /
• 2018

NAND flash memory has been widely used for embedded systems as storage device and the flash memory file systems such as JFFS2, YAFFS/YAFFS2 have been adopted by these embedded systems. The flash memory file systems provide the high performance and overcome the limitations of flash memory. However, these file systems don't solve the slow mount time problem when a sudden power failure happens. In this paper, we proposed a flash memory management method for enhancing the recovery performance. The proposed method manages the flash memory block type and stores the block type information at recovery image block. When file operations are occurred, our method stores the file information at the metadata block before and after the file operation. When mounting the flash memory, our method only scans the recovery image blocks and metadata blocks. The proposed method reduces the mount time by seeking the metadata block locations fast by using the recovery image blocks. We implemented the proposed method and evaluation results show that our method reduces the mount time 13 ~ 46 % compared with YAFFS2.

• Clean Technology
• /
• v.26 no.4
• /
• pp.279-285
• /
• 2020

Laboratories and industrial processes typically involve the use of flammable substances. An important property used to estimate fire and explosion risk for a flammable liquid is the flash point. In this study, flash point data at 101.3 kPa were determined using a SETA closed cup flash point tester on the following solvent mixtures: {2,2,4-trimethylpentane + methylcyclohexane}, {2,2,4-trimethylpentane + ethylbenzene}, and {2,2,4-trimethylpentane + p-xylene}. The purpose of this work is to obtain flash point data for binary mixtures of 2,2,4-trimethylpentane with three hydrocarbons (methylcyclohexane, ethylbenzene, and p-xylene), which are representative compounds of the main aromatic hydrocarbon fractions of petroleum. The measured flash points are compared with the predicted values calculated using the GE models' activity coefficient patterns: the Wilson, the Non-Random Two-Liquid (NRTL), and the UNIversal QUAsiChemical (UNIQUAC) models. The non-ideality of the mixture is also considered. The average absolute deviation between the predicted and measured lower flash point s is less than 1.99 K, except when Raoult's law is calculated. In addition, the minimum flash point behavior is not observed in any of the three binary systems. This work's predicted results can be applied to design safe petrochemical processes, such as identifying safe storage conditions for non-ideal solutions containing volatile components.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 1997.11a
• /
• pp.203-210
• /
• 1997

Reports of explosions in cargo and storage tanks of high flash point liquids such as residual fuel oil, asphalt, and oily waste water have shown that these explosions have occurred even when the liquid temperatures are well below the liquid nominal flash point. The reasons for these seemingly paradoxical explosions are reviewed and results of recent laboratory tests are presented to better define the conditions leading to flammable vapor atmospheres in these tanks. The potential effectiveness of various prevention measures are discussed including inerting, monitoring tank vapor concentrations, and periodic cleaning of condensation and deposits on the tank walls and roof.