Mainstream applications–such as file copy/transfer, Web, DBMS, or video streaming–typically issue synchronous diskrequests. As shown in this paper, this fact may cause work-conserving schedulers to fail both to enforce guarantees and to provide a high disk throughput. A high throughput can be however recovered by just idling the disk for a short time interval after the completion of each request. In contrast, guarantees may still be violated by existing timestamp-based schedulers, because of the rules they use to tag requests.Budget Fair Queueing (BFQ), the new disk scheduler presented in this paper, is an example of how disk idling, combined with properback-shifting of request timestamps, may allow a timestamp-based disk scheduler to preserve both guarantees and a high throughput.Under BFQ each application is always guaranteed–over any time interval and independently of whether it issues synchronous requests–a bounded lag with respect to its reserved fraction of the total number of bytes transferred by the disk device.We show the single-disk performance of our implementation of BFQ in the Linux kernel through experiments with real and emulated mainstream applications.

High Throughput Disk Scheduling with Fair Bandwidth Distribution / Valente, Paolo; Fabio, Checconi. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - STAMPA. - 59:(2010), pp. 1172-1186. [10.1109/TC.2010.105]

High Throughput Disk Scheduling with Fair Bandwidth Distribution

VALENTE, Paolo;
2010

Abstract

Mainstream applications–such as file copy/transfer, Web, DBMS, or video streaming–typically issue synchronous diskrequests. As shown in this paper, this fact may cause work-conserving schedulers to fail both to enforce guarantees and to provide a high disk throughput. A high throughput can be however recovered by just idling the disk for a short time interval after the completion of each request. In contrast, guarantees may still be violated by existing timestamp-based schedulers, because of the rules they use to tag requests.Budget Fair Queueing (BFQ), the new disk scheduler presented in this paper, is an example of how disk idling, combined with properback-shifting of request timestamps, may allow a timestamp-based disk scheduler to preserve both guarantees and a high throughput.Under BFQ each application is always guaranteed–over any time interval and independently of whether it issues synchronous requests–a bounded lag with respect to its reserved fraction of the total number of bytes transferred by the disk device.We show the single-disk performance of our implementation of BFQ in the Linux kernel through experiments with real and emulated mainstream applications.
59
1172
1186
High Throughput Disk Scheduling with Fair Bandwidth Distribution / Valente, Paolo; Fabio, Checconi. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - STAMPA. - 59:(2010), pp. 1172-1186. [10.1109/TC.2010.105]
Valente, Paolo; Fabio, Checconi
File in questo prodotto:
File Dimensione Formato  
valente-tc-2010.pdf

non disponibili

Tipologia: Post-print dell'autore (bozza post referaggio)
Dimensione 3.13 MB
Formato Adobe PDF
3.13 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11380/640275
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 39
  • ???jsp.display-item.citation.isi??? 22
social impact