Abstract

Multi-tiered persistent storage systems integrate many types of persistent storage devices, such as different types of NVMes, SSDs, and HDDs. This integration provides a multi-level view of persistent storage, where each tier has a different data transmission speed and capacity. This work considers the problem of efficient scheduling of parallel data transfers between the tiers of persistent storage. We propose a new model for data processing over multi-tiered persistent storage and new algorithms to minimize the overall time spent on parallel data transfers and the idle time of data transfer processes. Finally, we present the outcomes from the experiments that confirm the correctness and efficiency of the scheduling algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call