The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Les tampons du système de fichiers fournissent de l'espace mémoire pour les données transférées vers et depuis le disque et agissent comme des caches pour les blocs récemment utilisés, et le gestionnaire de tampon lit généralement les blocs de données à l'avance pour minimiser le nombre d'accès au disque. Cependant, si plusieurs fichiers multimédia avec des taux de consommation différents sont accédés simultanément à partir du système de fichiers dans lequel la stratégie de remplacement de tampon LRU est utilisée, les blocs de lecture anticipée du fichier à faible débit sont déchargés de la mémoire pour être utilisés pour charger un bloc de données d'un fichier à faible débit. fichier à haut débit de données, ils doivent donc être rechargés en mémoire à partir du disque lorsque ces blocs sont réellement référencés. Cet article propose et implémente un nouveau schéma de gestion de cache tampon pour un système de fichiers multimédia et analyse les performances du schéma proposé en modifiant le noyau du système de fichiers de FreeBSD. Dans ce schéma proposé, dans un premier temps, certains tampons sont alloués à chaque fichier multimédia ouvert, de manière privée, puis ces tampons sont réutilisés pour d'autres blocs de données de ce fichier lorsqu'ils sont chargés depuis le disque. De plus, le nombre de tampons privés alloués au fichier est ajusté dynamiquement en fonction de son débit de données. Un système de contrôle d'admission est également proposé pour empêcher l'ouverture d'un nouveau fichier qui pourrait provoquer des surcharges dans le système de fichiers. Les résultats expérimentaux comparant le schéma proposé avec le FreeBSD original et un modèle simple basé sur CTL montrent que le schéma de gestion de tampon proposé pourrait prendre en charge la lecture en temps réel de plusieurs fichiers multimédias avec différents débits de données simultanément sans l'aide d'un CPU et d'une planification de disque en temps réel.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Jongho NANG, Sungkwan HEO, "An Efficient Buffer Management Scheme for Multimedia File System" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 6, pp. 1225-1236, June 2000, doi: .
Abstract: File system buffers provide memory space for data being transferred to and from disk and act as caches for the recently used blocks, and the buffer manager usually reads ahead data blocks to minimize the number of disk accesses. However, if several multimedia files with different consumption rates are accessed simultaneously from the file system in which LRU buffer replacement strategy is used, the read-ahead blocks of the low rate file are unloaded from memory to be used for loading a data block of a high data rate file, therefore they should be reloaded again into memory from disk when these blocks are actually referenced. This paper proposes and implements a new buffer cache management scheme for a multimedia file system and analyzes the performance of the proposed scheme by modifying the file system kernel of FreeBSD. In this proposed scheme, initially, some buffers are allocated to each opened multimedia file, privately, then these buffers are reused for other data blocks of that file when they are loaded from the disk. Moreover, the number of private buffers allocated for the file is dynamically adjusted according to its data rate. An admission control scheme is also proposed to prevent opening of a new file which may cause overloads in the file system. Experimental results comparing proposed scheme with the original FreeBSD and a simple CTL-based model show that the proposed buffer management scheme could support the realtime play back of several multimedia files with various data rates concurrently without helps of a realtime CPU and disk scheduling.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_6_1225/_p
Copier
@ARTICLE{e83-d_6_1225,
author={Jongho NANG, Sungkwan HEO, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient Buffer Management Scheme for Multimedia File System},
year={2000},
volume={E83-D},
number={6},
pages={1225-1236},
abstract={File system buffers provide memory space for data being transferred to and from disk and act as caches for the recently used blocks, and the buffer manager usually reads ahead data blocks to minimize the number of disk accesses. However, if several multimedia files with different consumption rates are accessed simultaneously from the file system in which LRU buffer replacement strategy is used, the read-ahead blocks of the low rate file are unloaded from memory to be used for loading a data block of a high data rate file, therefore they should be reloaded again into memory from disk when these blocks are actually referenced. This paper proposes and implements a new buffer cache management scheme for a multimedia file system and analyzes the performance of the proposed scheme by modifying the file system kernel of FreeBSD. In this proposed scheme, initially, some buffers are allocated to each opened multimedia file, privately, then these buffers are reused for other data blocks of that file when they are loaded from the disk. Moreover, the number of private buffers allocated for the file is dynamically adjusted according to its data rate. An admission control scheme is also proposed to prevent opening of a new file which may cause overloads in the file system. Experimental results comparing proposed scheme with the original FreeBSD and a simple CTL-based model show that the proposed buffer management scheme could support the realtime play back of several multimedia files with various data rates concurrently without helps of a realtime CPU and disk scheduling.},
keywords={},
doi={},
ISSN={},
month={June},}
Copier
TY - JOUR
TI - An Efficient Buffer Management Scheme for Multimedia File System
T2 - IEICE TRANSACTIONS on Information
SP - 1225
EP - 1236
AU - Jongho NANG
AU - Sungkwan HEO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2000
AB - File system buffers provide memory space for data being transferred to and from disk and act as caches for the recently used blocks, and the buffer manager usually reads ahead data blocks to minimize the number of disk accesses. However, if several multimedia files with different consumption rates are accessed simultaneously from the file system in which LRU buffer replacement strategy is used, the read-ahead blocks of the low rate file are unloaded from memory to be used for loading a data block of a high data rate file, therefore they should be reloaded again into memory from disk when these blocks are actually referenced. This paper proposes and implements a new buffer cache management scheme for a multimedia file system and analyzes the performance of the proposed scheme by modifying the file system kernel of FreeBSD. In this proposed scheme, initially, some buffers are allocated to each opened multimedia file, privately, then these buffers are reused for other data blocks of that file when they are loaded from the disk. Moreover, the number of private buffers allocated for the file is dynamically adjusted according to its data rate. An admission control scheme is also proposed to prevent opening of a new file which may cause overloads in the file system. Experimental results comparing proposed scheme with the original FreeBSD and a simple CTL-based model show that the proposed buffer management scheme could support the realtime play back of several multimedia files with various data rates concurrently without helps of a realtime CPU and disk scheduling.
ER -