Advanced Data Storage Technologies
Open access
Peer reviewed
Abstract
Abstract
This paper addresses the problem of optimal online scheduling of data transfers among the levels of multi-tiered persistent storage systems. The paper describes the new algorithms for the optimization of data transfers and shows the important role played by multi-tiered persistent storage when processing large volumes of data. A notation of Extended Petri Nets (EPN) proposed in the paper is used to represent the data flows between the storage tiers. EPNs are also used to create efficient data transfer plans by integrating multiple queries. The paper presents new ways of online query processing with real-time constraints and shows the benefits of optimized serial data transfer plans. We conduct the evaluations of online scheduling algorithms in a simulated environment of multi-tiered persistent storage. The method was tested in a simulation that mimics real storage devices like hard disk drives (HDD), solid-state drives (SSD), and non-volatile memory (NVMe) drives, based on their usual read and write speeds. We performed extensive experiments on different storage setups, from single-tier to four-tier systems, using a variety of sample queries. The results showed that we achieved better online scheduling for data transfers in multi-tier storage systems. Received: 24 December 2024 | Revised: 25 August 2025 | Accepted: 17 November 2025 Conflicts of Interest The authors declare that they have no conflicts of interest to this work. Data Availability Statement Data sharing is not applicable to this article as no new data were created or analyzed in this study. Author Contribution Statement Nan Noon Noon: Conceptualization, Methodology, Validation, Formal analysis, Investigation, Writing – original draft, Writing – review & editing, Visualization. Janusz R. Getta: Conceptualization, Methodology, Validation, Formal analysis, Investigation, Writing – original draft, Writing – review & editing, Visualization, Supervision. Tianbing Xia: Conceptualization, Methodology, Validation, Formal analysis, Investigation, Writing – original draft, Writing – review & editing, Visualization, Supervision.
Direct answer
What can I do from this paper page?
Use this page to scan "Efficient Online Scheduling of Data Transfers in Multi-tiered Persistent Storage" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Advanced Data Storage Technologies research, save the paper, or map adjacent work.
Research areas
Follow related topics
Citation
BibTeX
@article{Noon2026Efficient,
title = {Efficient Online Scheduling of Data Transfers in Multi-tiered Persistent Storage},
author = {Nan Noon Noon and Janusz R. Getta and Tianbing Xia},
journal = {Journal of Data Science and Intelligent Systems},
year = {2026},
doi = {10.47852/bonviewjdsis62025078},
url = {https://doi.org/10.47852/bonviewjdsis62025078}
}FAQ
Using this paper in a discovery workflow
How do I find related work for this paper?
Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.
How can I keep up with new Advanced Data Storage Technologies research papers?
Follow Advanced Data Storage Technologies research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.
Can I cite this paper from this page?
This page includes a static BibTeX block for Efficient Online Scheduling of Data Transfers in Multi-tiered Persistent Storage. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.
Follow this research in Scollr
Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.
Get the app