• Journal of KIISE
• /
• v.44 no.3
• /
• pp.232-238
• /
• 2017

Application response time is critical to end-user response time in Android smartphones. Due to the plentiful resources of recent smartphones, storage I/O response time becomes a major key factor in application response time. However, existing storage I/O trace tools for Android and Linux give limited information only for a specific I/O layer which makes it difficult to combine I/O information from different I/O layers, because not helpful for application developer and researchers. In this paper, we propose a novel storage I/O trace tool for Android, called AIOPro (Android I/O profiler). It traces storage I/O from application - Android platform - system call - virtual file system - native file system - page cache - block layer - SCSI layer and device driver. It then combines the storage I/O information from I/O layers by linking them with file information and physical address. Our evaluations of real smartphone usage scenarios and benchmarks show that AIOPro can track storage I/O information from all I/O layers without any data loss under 0.1% system overheads.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.108-121
• /
• 2004

In this paper, we propose an enhanced snapshot technique that solves performance degradation when snapshot is initiated for the storage cluster system. However, traditional snapshot technique has some limits adapted to large amount storage shared by multi-hosts in the following aspects. As volume size grows, (1) it deteriorates crucially the performance of write operations due to additional disk access to verify COW is performed. (2) Also it increases excessively the blocking time of write operation performed during the snapshot creation time. (3)Finally, it deteriorates the performance of write operations due to additional disk I/O for mapping block caused by the verification of COW. In this paper, we propose an efficient snapshot technique for large amount storage shared by multi-hosts in SAN Environments. We eliminate the blocking time of write operation caused by freezing while a snapshot creation is performing. Also to improve the performance of write operation when snapshot is taken, we introduce First Allocation Bit(FAB) and Snapshot Status Bit(SSB). It improves performance of write operation by reducing an additional disk access to volume disk for getting snapshot mapping block. We design and implement an efficient snapshot technique, while the snapshot deletion time, improve performance by deallocation of COW data block using SSB of original mapping entry without snapshot mapping entry obtained mapping block read from the shared disk.

• Journal of the Korean Applied Science and Technology
• /
• v.18 no.2
• /
• pp.118-126
• /
• 2001

Micelle formation and adsorption at the $Ti0_{2}$ interface of a series of polystyrene-polythylene oxide(PS-PEO) block copolymer in aqueous solution was studied using fluorescence probing and small-angle X-ray methods. Further, the stability of aqueous $Ti0_{2}$ dispersion in the presence of copolymer was investigated by microelectrophoresis, optical density and sedimentation measurements. The dissolution of pyrene as fluorescent probe in aqueous surfactant solution leads to a slow decrease of the $I_{1}/I_{3}$ ratio, as the copolymer concentration increase; $I_{1}$ and $I_{3}$ are respectively the intensities of the first and third vibrionic peaks in the pyrene fluorescence emission. The behaviour was due to the characteristics of the copolymers and/or to the copolymer association efficiency in water. Moreover, the adsorption at the plateau level increases with decreasing PEO until chain length. The zeta potential of $TiO_{2}$ particles decreases with increasing copolymer concentration and reaches a plateau value. Finally, stabilization using block copolymers was more effective with samples having higher weight fractions of PS block.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3519-3533
• /
• 2000

In a VOD(Video-On-Demand) system, I/O performance and storage requirements are generally more important than computing capability, Due to the development of CPU tecnology, the gap between the performance of processors and desk speed are widening. Therefore, the disk system typically becomes the bohleneck ina VOD system. In order to allevte those effects from physical constramts, disk array system is used. The I/O performance of disk arrays can be improved by the capability of processors, I/O schefuling polcy, the number of member disks in the array, disk block size, block placemet method etc. In this paper, we considered the disk scheduling schemes including EDF( Earliest Deadine First), SCAN, SGAN-EDF, Round-robm. GSS(Grouped Sweeping scheme), and C-SCAN, LOOK, C-LOOK which are variations of SCAN Mamly focusing on those disk scheduling schemes, we performed the simulation in order to compare and eview the perionmance of disk arrays considening seveial related parameters under diverse environments and analyzed the effects of those parameters to the performance.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

• Journal of the Korea Safety Management & Science
• /
• v.24 no.1
• /
• pp.73-80
• /
• 2022

The purpose of this study is to present the direction of the plan to transform the residential complex into a space that can provide an open residential environment that can lead to social communication and exchange without being closed to the urban residential environment, especially in the apartment complex environment, which is becoming more dense. As a result of the Openness analysis of the 'Codan Shinonome Canal Court', the overall accessibility was good in terms of space utilization, and the openness was low in terms of the spatial composition, which is a physical environment due to the dense block type. When looking at the overall openness of the Codan Sinonome complex in terms of analysis by block, the corrected openness index (C.O.I) for all six blocks was 0.245, the corrected accessibility index (C.A.I) was 1.447 and the openness composite index (O.C.I) was assessed at 1.692. This was due to the formation of high-density block-type urban dwellings and the introduction of S-shaped streets and the layout of low-rise urban support facilities and commercial facilities. The Codan Sinonome Canal Court, which is considered an "open city residence," quantitatively confirmed that it embodies macro-space structure and human-scale space environment even in high-precision environments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.4
• /
• pp.265-269
• /
• 2009

A conference key agreement system is a scheme to generate a session key in a contributory manner in order to communicate with each other securely among participants. In this paper an efficient conference key agreement system is proposed by employing symmetric balanced incomplete block design(SBIBD), one class of block designs. The protocol presented not only minimizes the message overhead and message exchanging rounds but also makes every participant contribute evenly for generating a conference key. Our protocol constructs a conference key which takes modified Diffe-Helman form of ${\prod}_{i=0}^{v-1}R_i$, where v is the number of participants and $R_i$ is a random number generated from member i. In a special class of SBIBD, it takes only 3 rounds message exchange and message overhead is $O(v{\sqrt{v}})$. Our protocol can be proved as computationally difficult to calculate as discrete logarithms.

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

In cluster computers, it is essential to Implement the single I/O space(SIOS) supporting integrated I/O substructure to efficiently process I/O intensive applications. SIOS service provides with global I/O address space to directly access peripherals and hard disks in its own or remote nodes from any node in the cluster computer In this thesis, we propose the implementation method of SIOS in Linux clusters by using only freewares. This method is implemented at device driver level that uses Enhanced Network Block Device(ENBD) and file system level that uses S/W RAID and NFS. The major strengths of this method are easiness of implementation and almost no cost due to using freewares. In addition, since freewares used are open sources, it is possible to apply this method to other platforms with only slight modification. Moreover, experiments show that I/O throughputs are up to 5.5 times higher in write operations and approximately 2.3 times higher in read operations than those of CDD method that uses the device driver developed at kernel level.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.8 no.3
• /
• pp.201-205
• /
• 2010

Most of iodine was captured by the block when NaI solution flowed through a bentonite block sorbed silver to retard the migration of iodine released from high-level radioactive wastes. In order to understand in detail the mechanism for the retardation of the iodine by the silver ion, X-ray Absorption Near Edge Structure (XANES) and Extended X-ray Absorption Fine Structure (EXAFS) spectra of the silver sorbed bentonite before and after the contact with iodide were compared with those of AgO, $Ag_2O$ and AgI as references. This examination suggests that the silver ion sorbed on the bentonite is desorbed, and then it retards the migration of iodine by forming the cluster of AgI precipitate.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.469-475
• /
• 2017

The emerging NVMe-based multi-queue SSDs provides a high bandwidth by parallel I/O, i.e., each core performs I/O through its dedicated queue in parallel with other cores. To provide a bandwidth share for each application with I/O, a fair-share scheduler that provides a bandwidth share to each core is required. In this study, we proposed a multi-core scalable fair-queuing algorithm for multi-queue SSDs. The algorithm adopts randomization to minimize the inter-core synchronization overheads and provides a weight-proportional bandwidth share to each core. The results of our experiments indicated that the proposed algorithm gives accurate bandwidth partitioning and outperforms the existing FlashFQ scheduler, regardless of the number of cores for a Linux kernel with block-mq.