• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.27-34
• /
• 2013

NAND Flash Memory has been used in several devices by low cost and high capacity, and the demand for mass NAND Flash Memory has increased due to the multimedia extension of mobile devices. The JFFS2, NILFS2, and YAFFS2 file systems are used mainly in NAND Flash Memory. In this paper, the performance of Sequential read/write of the 3 file systems are analyzed for the 4 I/O schedulers : CFQ(Complete Fair Queuing) I/O scheduler, NOOP(No Operation) I/O scheduler, Anticipatory I/O scheduler, and Deadline I/O scheduler. In JFFS2 file system, Anticipatory I/O scheduler has the best performance by 8% decreasing speed in writing time and 1.5% decreasing speed in reading time compared to the other I/O scheduler. In YAFFS2 file system, it results are similar to performance in reading and writing for the 4 I/O schedulers. In NILFS2 file system, NOOP I/O scheduler has 2% faster in writing and Deadline I/O scheduler has 6% faster in reading than other I/O schedulers.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.129-137
• /
• 2018

NVMe(Non-Volatile Memory Express) SSD(Solid State Drive) is a high-performance storage that makes use of flash memory as a storage cell, PCIe as an interface and NVMe as a protocol on the interface. It supports multiple I/O queues which makes it feasible to process parallel-I/Os on multi-core environments and to provide higher bandwidth than SATA SSDs. Hence, NVMe SSD is considered as a next generation-storage for data-center and cloud computing system. However, in the virtualization system, the performance of NVMe SSD is not fully utilized due to the bottleneck of the software I/O stack. Especially, when it uses I/O stack of the hypervisor or the host operating system like Xen and KVM, I/O performance degrades seriously due to doubled-I/O stack between host and virtual machine. In this paper, we propose a new I/O engine, called Direct-AIO (Direct-Asynchronous I/O) engine, that can access NVMe SSD directly for I/O performance improvements on QEMU emulator. We develop our proposed I/O engine and analyze I/O performance differences between the existed I/O engine and Direct-AIO engine.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.1989-1995
• /
• 2006

RAID(Redundant mays of inexpensive disks) were proposed as a way to use parallelism between multiple disks to improve aggregate I/O performance. The emerging of intelligent I/O architecture provides a standard for high performance I/O subsystems and introducer intelligence at the hardware level. With an embedded processor, intelligent I/O adaptors can offload the major I/O processing workload from the CPU and, at the same time, increase the I/O performance. This parer addresses the essential issue in the design of disk scheduling for intelligent I/O devices. In this paper we compare with MB throughput per second and maximum I/O respond time in RAID.

• 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 the Korean Chemical Society
• /
• v.39 no.3
• /
• pp.176-185
• /
• 1995

To improve photosensisitizing efficiency of ZnO/$H_2Pc(I)_x$ system, ZnO/$H_2Pc(I)_x$ system was dispersed in a typical photoconductive polymer of poly(9-vinylcarbazole)(PVCZ). The iodine dopant level(x) of ZnO/${\chi}-H_2Pc(I)_x$ is proportional to concentration of iodine, whereas x of ZnO/${\beta}-H_2Pc(I)_x$ decreased from the highest x=0.97 at more than $6.3{\times}10^{-3}$ M iodine solution. The Raman spectra of ZnO/${\chi}-H_2Pc(I)_x$ at 514 nm exhibited characteristic $I_3^-$ patterns in the range of 50∼550 $cm^{-1}$ at $x{\geq}0.57.$ The surface photovoltage of ZnO/${\chi}-H_2Pc(I)_{0.48}$/PVCZ was approximately 1.6 times greater than ZnO/${\chi}-H_2 Pc(I)_{0.48}$ and was 1.8 times of ZnO/${\chi}-H_2Pc(I)_{0.57}$/PVCZ at 670 nm. With ZnO/$H_2Pc(I)_x$/PVCZ, the highest iodine dopant levels showed a higher photovoltage. Therefore the injection of holes from H2Pc into PVCZ resulted in that photosensisitizing effect of ZnO/$H_2Pc(I)_x$/PVCZ system was improved compared to ZnO/$H_2Pc(I)_x$ case.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

• Journal of the Korea Society for Simulation
• /
• v.6 no.2
• /
• pp.89-104
• /
• 1997

Performance bottleneck of parallel computer systems has mostly been I/O devices because of disparity between processor speed and I/O speed. Therefore I/O node placement strategy is required such that it can minimize the number of I/O nodes, I/O access time and I/O traffic in an interconnection network. In this paper, we propose an optimal distance-k embedding algorithm, and analyze its effect on system performance when this algorithm is applied to n x n torus architecture. We prove this algorithm is an efficient I/O node placement using software simulation. I/O node placement using the proposed algorithm shows the highest performance among other I/O node placements in all cases. It is because locations of I/O nodes are uniformly distributed in the whole network, resulting in reduced traffic in the intE'rconnection network.

• Journal of Korea Game Society
• /
• v.16 no.4
• /
• pp.57-68
• /
• 2016

As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

• Journal of the Microelectronics and Packaging Society
• /
• v.20 no.4
• /
• pp.69-74
• /
• 2013

In this paper, the impact of integrating large number of I/O (Input-Output) and Core power Delivery Network (PDN) on a 6 layers Flip-Chip Ball Grid Array (FCBGA) package is investigated. The impact of core induced supply noise on high-speed I/O interfaces, and high-speed I/O interface's supply noise coupling to adjacent high-speed I/O interfaces' jitter impact are studied. Concurrent stress validation software is used to induce SSO noise on each individual I/O interfaces; and at the same time; periodic noise is introduced from Core PDN into the I/O PDN domain. In order to have the maximum coupling impact, a prototype package is designed to merge the I/O and Core PDN as one while impact on jitter on each I/O interfaces are investigated. In order to understand the impact of the Core to I/O and I/O to I/O noise, the on-die noise measurements were measured and results were compared with the original PDN where each I/O and Core PDN are standalone and isolated are used as a benchmark.

• Korean Journal of Materials Research
• /
• v.2 no.5
• /
• pp.330-336
• /
• 1992

Four distinctive hot pressed and heat treated S${i_3}{N_4}$ceramics, S${i_3}{N_4}$-8%${Y_2}{O_3}$, S${i_3}{N_4}$-6% ${Y_2}{O_3}$-2% $A{l_2}{O_3}$, S${i_3}{N_4}$-4% ${Y_2}{O_3}$-3% $A{l_2}{O_3}$, 그리고 S${i_3}{N_4}$-1% MgO-1% Si$O_2$(in wt%), were prepared and characterized by X-ray diffraction, scanning electron microscopy, image analysis and mechanical tests. The fracture toughness of S${i_3}{N_4}$-8% ${Y_2}{O_3}$specimens containing large elongated grains showed the highest value of about 9.8MPa$m^{1/2}$. Two out of four S${i_3}{N_4}$, ceramics(S${i_3}{N_4}$-6% ${Y_2}{O_3}$-2% $A{l_2}{O_3}$and S${i_3}{N_4}$-4% ${Y_2}{O_3}$-3% $A{l_2}{O_3}$) heat treated at 200 $0^{\circ}C$retained the fracture strength of over 900MPa and fracture toughness of over 8.0MPa$m^{1/2}$. Large ${\beta}$-S${i_3}{N_4}$grains having a diameter larger than 1${\mu}$m appeared to contribute to increase in fracture toughness.