Dynamic Chip Clustering and Task Allocation for Real-time Flash
TimeThursday, December 9th10:30am - 10:54am PST
Event Type
Research Manuscript
Virtual Programs
Presented In-Person
Time-Critical System Design
Embedded Systems
DescriptionThe goal of this paper is to provide worst-case timing guarantees for real-time I/O requests, while fully utilizing the potential bandwidth for non real-time I/O requests in NAND flash storage systems. We propose a new real-time I/O scheduling framework that enables flexible resource isolation between real-time I/O requests to meet all timing constraints and co-scheduling of real-time and non real-time I/O requests to provide high bandwidth utilization. Our in-depth evaluation results show that the proposed approach outperforms the static approaches significantly in terms of the schedulability for real-time I/O requests and the bandwidth for non real-time I/O requests.