• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.191-198
• /
• 2002

Recently, Usage of multimedia server is rapidly increased with expansion of internet that real-time displaying service for multimedia data, MPEG and etc. For these multimedia real-time applications, it is necessary to use a disk array as a storage system. For providing requested service to much more clients at the same time in a multimedia data storage server, considerable varied strategies in a several parts. But especially it is important feature to various parameters for disk array such as relation of striping block size as a system environment and characteristics of video data. In this paper, we implemented real environment of multimedia server which provides MPEG-1 files and evaluated the suitable storage system architectures by applying synthetically generated workloads in the various parameters for disk array.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.101-121
• /
• 2010

This paper presents an intelligent prefetching technique that significantly improves performance of hybrid fash-disk storage, a combination of flash memory and hard disk. Since flash memory embedded in a hybrid device is much faster than hard disk in terms of I/O operations, it can be utilized as a 'cache' space to improve system performance. The basic strategy for prefetching is to utilize sequential pattern mining, with which we can extract the access patterns of objects from historical access sequences. We use two techniques for enhancing the performance of hybrid storage with prefetching. One of them is to modify a FAST algorithm for mapping the flash memory. The other is to extend the unit of prefetching to a block level as well as a file level for effectively utilizing flash memory space. For evaluating the proposed technique, we perform the experiments using the synthetic data and real UCC data, and prove the usability of our technique.

• The Korean Journal of Pain
• /
• v.20 no.1
• /
• pp.46-49
• /
• 2007

Background: Cervical epidural injection, performed via the interlaminar approach, represents a useful interventional pain management procedure indicated in patients with a cervical herniated disk. Due to thedecreased epidural space in the cervical region, cervical epidural injections may result in potentially serious complications, especially during a large volume injection. Methods: Thirty-four patients with neck pain due to a cervical herniated disk that were referred to the pain clinic for cervical epidural steroid injection were randomized into two groups. One group received a cervical epidural injection of 4 ml drug and the other group received 2 ml drug. The injected mixture included triamcinolon, ropivacaine and omnipaque. Spread levels of the drug after injection were estimated with the use of C-arm fluoroscopy. Results: Spread levels to the cephalad for patients in the two groups were $4.88{\pm}0.78segments$ and $4.53{\pm}0.49segments$, respectively. Spread levels to the caudad for patients in the two groups were $4.59{\pm}0.93segments$ and $4.47{\pm}0.51segments$, respectively. The results showed no significant difference in the spread level between the two groups. Conclusions: Use of a small volume of drug (2 ml) can provide a sufficient spread level of the injected drug that is desirable for patients with a cervical herniated disk.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.367-374
• /
• 2001

Recently, LINUX cluster file systems based on the storage area network (SAN) have been developed. In those systems, without using a central file server, multiple clients sharing the whole disk storage through Fibre Channel can freely access disk storage and act as file servers. Accordingly, they can offer advantages such as availability, load balancing, and scalability. In this paper, we describe metadata management schemes designed for a new SAN-based LINUX cluster file system. First, we present a new inode structure which is better than previous ones in disk block access time. Second, a new directory structure which uses extendible hashing is described. Third, we describe a novel scheme to manage free disk blocks, which is suitable for very large file systems. Finally, we present how we handle metadata journaling. Through performance evaluation, we show that our proposed schemes have better performance than previous ones.

• Transactions of The Korea Fluid Power Systems Society
• /
• v.5 no.2
• /
• pp.1-7
• /
• 2008

To improve the performance of the bent axis type axial piston pump driven by the tapered piston, it is necessary to know the driving characteristics and mechanism of the tapered piston and the cylinder block. Since each piston not only rotates on its axis and reciprocates in the cylinder bore, but also revolves around the axis of the driving shaft, it is difficult to analyze the driving mechanism theoretically. The theoretical mechanism far the bent axis type axial piston pump is studied by using the geometrical method. The driving range of the tapered piston is determined by theoretical equations. The results show that the cylinder block is driven by one tapered piston in a limited range and the core parameters such as driving factor of the piston and the ahead delay angle influenced performance of the bent axis type axial piston pump.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.27-35
• /
• 2021

NAND flash memory-based SSD needs an internal software, Flash Translation Layer(FTL) to provide traditional block device interface to the host because of its physical constraints, such as erase-before-write and large erase block. However, because useful host-side information cannot be delivered to FTL through the narrow block device interface, SSDs suffer from a variety of problems such as increasing garbage collection overhead, large tail-latency, and unpredictable I/O latency. Otherwise, the new type of SSD, open-channel SSD exposes the internal structure of SSD to the host so that underlying NAND flash memory can be managed directly by the host-level FTL. Especially, I/O data classification by using host-side information can achieve the reduction of garbage collection overhead. In this paper, we propose a new scheme to reduce garbage collection overhead of open-channel SSD by separating the journal from other file data for the journaling filesystem. Because journal has different lifespan with other file data, the Write Amplification Factor (WAF) caused by garbage collection can be reduced. The proposed scheme is implemented by modifying the host-level FTL of Linux and evaluated with both Fio and Filebench. According to the experiment results, the proposed scheme improves I/O performance by 46%~50% while reducing the WAF of open-channel SSDs by more than 33% compared to the previous one.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.234-244
• /
• 2003

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced block to the idel node on cache replacement in order to maintain the replaced block in the cache field. However the wrong approximate information deteriorates the performance, the concistency maintenance goes to great expense to exchange messeges and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintance cost for consistency and the management cost for cache Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.374-385
• /
• 2009

Flash memory becomes increasingly popular as data storage for various devices because of its versatile features such as non-volatility, light weight, low power consumption, and shock resistance. Flash memory, however, has some distinct characteristics that make today's disk-based database technology unsuitable, such as no in-place update and the asymmetric speed of read and write operations. As a result, most traditional disk-based database systems may not provide the best attainable performance on flash memory. To maximize the database performance on flash memory, some approaches have been proposed where only the changes made to the database, i.e., logs, are written to another empty place that has born erased in advance. In this paper, we propose an efficient log management scheme for flash-based database systems. Unlike the previous approaches, the proposed approach stores logs in specially allocated blocks, called log blocks. By evenly distributing logs across log blocks, the proposed approach can significantly reduce the number of write and erase operations. Our performance evaluation shows that the proposed approaches can improve the overall system performance by reducing the number of write and erase operation compared to the previous ones.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.109-114
• /
• 2024

Enterprise storage systems that require high data reliability are applying RAID (Redundant Array of Independent Disks) systems to recover from data loss and failure. In particular, RAID 5 ensures space efficiency and reliability by distributing parity across multiple storage devices. However, when storage devices have different capacities, RAID is built based on the smallest capacity storage device, resulting in wasted storage space. Therefore, research is needed to solve this resource management problem. In this paper, we propose a method for RAID grouping of each independent NAND flash memory block in a RAID consisting of SSD (Solid State Disk) with external SSDs as well as internal SSDs. This method is divided into a policy for delivering block information inside SSDs to the RAID system and a policy for RAID grouping of physical addresses delivered from the RAID system. This method allows us to maintain a RAID that does not waste resources when SSDs of different capacities are grouped into RAID5. Finally, we demonstrate the effectiveness of the proposed method through experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.33-49
• /
• 2003

Recently, there have been large storage demands for manipulating multimedia data. To solve the tremendous storage demands, one of the major researches is the SAN(Storage Area Network) that provides the local file requests directly from shared-disk storage and also eliminates the server bottlenecks to performance and availability. SAN also improve the network latency and bandwidth through new channel interface like FC(Fibre Channel). But to manipulate the efficient storage network like SAN, traditional local file system and distributed file system are not adaptable and also are lack of researches in terms of a metadata structure for large-scale inode object such as file and directory. In this paper, we describe the architecture and design issues of our shared-disk file system and provide the efficient bitmap for providing the well-formed block allocation in each host, extent-based semi flat structure for storing large-scale file data, and two-phase directory structure of using Extendible Hashing. Also we describe a detailed algorithm for implementing the file system's device driver in Linux Kernel and compare our file system with the general file system like EXT2 and shard disk file system like GFS in terms of file creation, directory creation and I/O rate.