SERICO: Scheduling Real-Time I/O Requests in Computational Storage Drives

被引:0
作者
Huang, Yun [1 ]
Guan, Nan [1 ]
Bai, Shuhan [1 ,2 ]
Kuo, Tei-Wei [3 ]
Xue, Chun Jason [1 ]
机构
[1] City Univ Hong Kong, Hong Kong, Peoples R China
[2] Huazhong Univ Sci & Technol, Wuhan, Peoples R China
[3] Natl Taiwan Univ, Taipei, Taiwan
来源
2023 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, DATE | 2023年
关键词
D O I
10.23919/DATE56975.2023.10137101
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The latency and energy consumption incurred by I/O accesses are significant in data-centric computing systems. Computational Storage Drive (CSD) can largely reduce data movement, and thus reduce I/O latency and energy consumption by offloading data-intensive processing to processors inside the storage device. In this paper, we study the problem of how to efficiently utilize the limited processing and memory resources of CSD to simultaneously serve multiple I/O requests from various applications with different real-time requirements. We proposed SERICO, a system of scheduling computational I/O requests in CSD. The key idea of SERICO is to perform admission control of real-time computational I/O requests by online schedulability analysis, to avoid wasting the processing resources and memory capacity of CSD in doing meaningless work for those requests deemed to violate the timing constraints. Each admitted computational I/O request is served in a controlled manner with carefully designed parameters, to meet its timing constraint with minimal memory cost. We evaluate SERICO with both synthetic workloads on simulators and representative applications on realistic CSD hardware. Experiment results show that SERICO significantly outperforms the default method used in the CSD device and the standard deadline-driven scheduling approach.
引用
收藏
页数:6
相关论文
共 23 条
[1]   blockNDP: Block-storage Near Data Processing [J].
Barbalace, Antonio ;
Decky, Martin ;
Picorel, Javier ;
Bhatotia, Pramod .
PROCEEDINGS OF THE 2020 21ST INTERNATIONAL MIDDLEWARE CONFERENCE INDUSTRIAL TRACK (MIDDLEWARE INDUSTRY '20), 2020, :8-15
[2]  
BARUAH SK, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P182, DOI 10.1109/REAL.1990.128746
[3]   Limited Preemption EDF Scheduling of Sporadic Task Systems [J].
Bertogna, Marko ;
Baruah, Sanjoy .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2010, 6 (04) :579-591
[4]   IS-HBase: An In-Storage Computing Optimized HBase with I/O Offloading and Self-Adaptive Caching in Compute-Storage Disaggregated Infrastructure [J].
Cao, Zhichao ;
Dong, Huibing ;
Wei, Yixun ;
Liu, Shiyong ;
Du, David H. C. .
ACM TRANSACTIONS ON STORAGE, 2022, 18 (02)
[5]   A Survey of Hard Real-Time Scheduling for Multiprocessor Systems [J].
Davis, Robert I. ;
Burns, Alan .
ACM COMPUTING SURVEYS, 2011, 43 (04)
[6]   GenStore: A High-Performance In-Storage Processing System for Genome Sequence Analysis [J].
Ghiasi, Nika Mansouri ;
Park, Jisung ;
Mustafa, Harun ;
Kim, Jeremie ;
Olgun, Ataberk ;
Gollwitzer, Arvid ;
Cali, Damla Senol ;
Firtina, Can ;
Mao, Haiyu ;
Alserr, Nour Almadhoun ;
Ausavarungnirun, Rachata ;
Vijaykumar, Nandita ;
Alser, Mohammed ;
Mutlu, Onur .
ASPLOS '22: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, 2022, :635-654
[7]   Biscuit: A Framework for Near-Data Processing of Big Data Workloads [J].
Gu, Boncheol ;
Yoon, Andre S. ;
Bae, Duck-Ho ;
Jo, Insoon ;
Lee, Jinyoung ;
Yoon, Jonghyun ;
Kang, Jeong-Uk ;
Kwon, Moonsang ;
Yoon, Chanho ;
Cho, Sangyeun ;
Jeong, Jaeheon ;
Chang, Duckhyun .
2016 ACM/IEEE 43RD ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE (ISCA), 2016, :153-165
[8]  
Jo Insoon, PROC VLDB ENDOW
[9]  
Kim Shine, USENIX FAST 21
[10]   Summarizer: Trading Communication with Computing Near Storage [J].
Koo, Gunjae ;
Matam, Kiran Kumar ;
Te, I ;
Narra, H. V. Krishna Giri ;
Li, Jing ;
Tseng, Hung-Wei ;
Swanson, Steven ;
Annavaram, Murali .
50TH ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE (MICRO), 2017, :219-231