Block allocation map
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computer file systems, a block allocation map is a data structure used to track disk blocks that are considered "in use". Blocks may also be referred to as allocation units or clusters. CP/M used a block allocation map in its directory. Each directory entry could list 8 or 16 blocks (depending on disk format) that were allocated to a file. If a file used more blocks, additional directory entries would be needed. Thus, a single file could have multiple directory entries. A benefit of this method is the possibility to use sparse files by declaring a large file size but only allocating blocks that are actually used. A detriment of this method is the disk may have free space (unallocated blocks) but data cannot be appended to a file because all directory entries are used.
In computer file systems, a block allocation map is a data structure used to track disk blocks that are considered "in use". Blocks may also be referred to as allocation units or clusters. CP/M used a block allocation map in its directory. Each directory entry could list 8 or 16 blocks (depending on disk format) that were allocated to a file. If a file used more blocks, additional directory entries would be needed. Thus, a single file could have multiple directory entries. A benefit of this method is the possibility to use sparse files by declaring a large file size but only allocating blocks that are actually used. A detriment of this method is the disk may have free space (unallocated blocks) but data cannot be appended to a file because all directory entries are used.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1162662278 under CC BY-SA 4.0; modifications have been made.