Cargando…
A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads
In heterogeneous I/O workload environments, disk scheduling algorithms should support different QoS (Quality-of-Service) for each I/O request. For example, the algorithm should meet the deadlines of real-time requests and at the same time provide reasonable response time for best-effort requests. Th...
Autores principales: | Kim, Taeseok, Bahn, Hyokyung, Won, Youjip |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3981465/ https://www.ncbi.nlm.nih.gov/pubmed/24782678 http://dx.doi.org/10.1155/2014/940850 |
Ejemplares similares
-
Electricity Usage Scheduling in Smart Building Environments Using Smart Devices
por: Lee, Eunji, et al.
Publicado: (2013) -
Tight Evaluation of Real-Time Task Schedulability for Processor’s DVS and Nonvolatile Memory Allocation
por: Nam, Sunhwa A., et al.
Publicado: (2019) -
Performance of Heterogeneous Algorithm Scheduling in CMSSW
por: Bocci, Andrea, et al.
Publicado: (2023) -
Algorithm for the Pruning of Synthesis Graphs
por: Zahoránszky-Kőhalmi, Gergely, et al.
Publicado: (2022) -
CMS readiness for multi-core workload scheduling
por: Perez-Calero Yzquierdo, A, et al.
Publicado: (2017)