Talk:Fragmentation (computing)
![]() | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
|
compaction
I have just gone through the article and i was really wondering how would if i insert a setion
about compaction (it removes external fragmentation by moving all allocated blocks to one end and free blocks to other) below the external fragmentation?
I mean when you disscuss the issue of external fragmentation you should write about how it can be removed. Prashantgonarkar (talk) 03:39, 14 October 2011 (UTC)
Terms Used
I have just read through this article and was wondering whether file fragmentation is actually a "phenonemon" or is there a reasonable explanation for why it occurs?
83.104.81.241 (talk) 16:28, 7 May 2009 (UTC)
- The 'Data fragmentation' section tries to explain it. See the File system fragmentation article if that was unclear. -- intgr [talk] 17:32, 7 May 2009 (UTC)
Internal Fragmentation
I recently reverted an edit that turned the Internal Fragmentation section into the text below. This text might have some useful contributions, but it's nowhere near good enough to replace the existing text yet.
Allocation either including reduntant information or data which are not going to be used. The term "internal" means that the unusable storage is inside the allocated region but is not being used.
Purpose and advantages:
- Usually provides increased efficiency or simplicity.
Disadvantages:
- More difficult to reclaim than other forms of fragmentation.
- Usually the best way to remove it is with a design change. For example, in dynamic memory allocation, memory pools drastically cut internal fragmentation by spreading the space overhead over a larger number of objects.
Examples:
- In many file systems, files always start at the beginning of a sector (simplifies organization, easier growth of files). Any space left over between the last byte of the file and the first byte of the next sector is a form of internal fragmentation called file slack or slack space.
- Examples of use of metadata:
- Program allocates a single byte of data is often allocated many additional bytes for metadata and alignment.
- Examples of use of reserved (often unused) resources:
- IP addresses can only be reserved in blocks of certain sizes (thus many IPs are reserved but not actively used). This is contributing to the IPv4 address shortage.
- English text is often stored with one character in each 8-bit byte. Although in standard ASCII encoding the most significant bit of each byte is always zero.
External fragmentation a weakness of “certain” algorithms?
“It (external fragmentation) is a weakness of certain storage allocation algorithms, when they fail to order memory used by programs efficiently” – surely it is a weakness of all general purpose algorithms, and any that fails to adequately anticipate sequence of (de)allocation operations? If so, this should be changed – or am I missing something? PJTraill (talk) 10:35, 4 November 2017 (UTC)
- All unassessed articles
- WikiProject templates with unknown parameters
- Articles copy edited by the Guild of Copy Editors
- C-Class Computing articles
- Mid-importance Computing articles
- C-Class software articles
- Mid-importance software articles
- C-Class software articles of Mid-importance
- All Software articles
- C-Class Computer science articles
- Mid-importance Computer science articles
- C-Class Java articles
- Mid-importance Java articles
- All Computing articles
- WikiProject Computer science articles