• Title/Summary/Keyword: HDD I/O Speed

Search Result 5, Processing Time 0.022 seconds

Development and Application of HDD I/O Measurement Utility Blockwrite (하드디스크 데이터 I/O 속도 측정용 유틸리티 blockwrite 개발과 응용)

  • Kim, Hyo-Ryoung;Song, Min-Gyu
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1151-1158
    • /
    • 2020
  • In order to investigate the speed profile of data I/O of HDD, we have developed an utility program. The application to HDD reveals the detail properties of the speed profile of HDD and the relation between the cylinder structure of HDD and the velocity profile. For the extent application, the experiment of the large volume storage was performed, and the profile of SSD media, which is known as the new rapid media, was measured. The new M.2 NVME SSD, which has the ability of over 10Gbps, we can compare the velocities between cp under linux O/S and the utility, and shows that the performance of the utility can be reliable.

A Hetero-Mirroring Scheme to Improve I/O Performance of High-Speed Hybrid Storage (고속 하이브리드 저장장치의 입출력 성능개선을 위한 헤테로-미러링 기법)

  • Byun, Si-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.4997-5006
    • /
    • 2010
  • A flash-memory-based SSDs(Solid State Disks) are one of the best media to support portable and desktop computers' storage devices. Their features include non-volatility, low power consumption, and fast access time for read operations, which are sufficient to present flash memories as major database storage components for desktop and server computers. However, we need to improve traditional storage management schemes based on HDD(Hard Disk Drive) and RAID(Redundant array of independent disks) due to the relatively slow or freezing characteristics of write operations of SSDs, as compared to fast read operations. In order to achieve this goal, we propose a new storage management scheme called Hetero-Mirroring based on traditional HDD mirroring scheme. Hetero-Mirroring-based scheme improves RAID-1 operation performance by balancing write-workloads and delaying write operations to avoid SSD freezing. Our test results show that our scheme significantly reduces the write operation overheads and freezing overheads, and improves the performance of traditional SSD-RAID-1 scheme by 18 percent, and the response time of the scheme by 38 percent.

A Study on the Vibration Characteristics of HDD Spindle Motor (하드 디스크 구동 스핀들 모터의 진동 특성에 관한 연구)

  • 장건희;한재혁
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.160-166
    • /
    • 1997
  • The spindle motor in a computer hard disk drive can be modeled as a rotor-bearing system supported by the base plate. Ball bearing is the crucial element to determine the stiffness of the spindle motor, and its design parameters and operating conditions determine the dynamic characteristics of the spindle motor. In the analysis of a rotor-bearing system with a short shaft like a spindle motor, the stiffness of the base plate as well as ball bearings must be considered accurately to analyze the dynamic charateristics of a spindle motor. In this paper, the lateral and the axial vibration of the spindle motor were analyzed by the transfer matrix method for the dual-shaft rotor-bearing model and by d.o.f lumped parameter model, respectively. The simulation results had good agreements with the experimental modal testing. The dynamic characteristics were fully investigated for the change of the major design parameters of the spindle motor, i.e. the preload of ball bearings and the rotational speed.

  • PDF

Performance Evaluation of SSD-Index Maintenance Schemes in IR Applications

  • Jin, Du-Seok;Jung, Hoe-Kyung
    • 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.

Prefetching Framework for General Workloads Using Breakpoint (브레이크포인트를 이용한 범용 워크로드 프리페칭 프레임워크)

  • Ko, Kwangjin;Ryu, Junhee;Kang, Kyungtae;Shin, Heonshik
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.832-837
    • /
    • 2014
  • Application loading speed can be improved by timely prefetching disk blocks likely to be needed by an application. However, existing prefetchers -- if they are not specialized to a particular application -- incur high overheads and are poor at identifying the blocks that will actually be required. There are many sequences in which blocks may be needed and, even if two access sequences are identical, block tracing and access timings can be affected significantly by the state of the buffer cache. We propose a new application-independent software-based prefetching technique, in which breakpoints are inserted at appropriate places in an application to collect the information on correlations between the blocks and to prefetch the potential blocks ahead of their schedule based on it. Experiments on an HDD-based desktop PC demonstrated an average 30% reduction in application launch time and 15% in general I/O, while reducing the wasted overhead.