Content deleted Content added
Assessment: Guild of Copy Editors: class=C, importance=Low; Computing: class=C, software=y, software-importance=Mid, java=y, java-importance=Mid; Computer science: class=C (assisted) |
m Maintain {{WPBS}}: 3 WikiProject templates. Keep majority rating "C" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computing}}, {{WikiProject Computer science}}. Tag: |
||
(11 intermediate revisions by 9 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=C|1=
{{WikiProject Guild of Copy Editors
{{WikiProject Computing
{{WikiProject Computer science
}}
{{Broken anchors|links=
* <nowiki>[[heuristic#Computer science|heuristic]]</nowiki> The anchor (#Computer science) has been [[Special:Diff/586304924|deleted by other users]] before. <!-- {"title":"Computer science","appear":{"revid":7686561,"parentid":7659453,"timestamp":"2004-11-19T21:34:47Z","replaced_anchors":{"Computer Science":"Computer science"},"removed_section_titles":["Computer Science"],"added_section_titles":["Computer science"]},"disappear":{"revid":586304924,"parentid":586304859,"timestamp":"2013-12-16T07:35:26Z","removed_section_titles":["Computer science","Engineering"],"added_section_titles":[]}} -->
}}
==compaction==
Line 42 ⟶ 44:
** [[English language|English]] text is often stored with one [[Character (computing)|character]] in each 8-bit [[byte]]. Although in standard [[ASCII]] encoding the [[MSB|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? [[User:PJTraill|PJTraill]] ([[User talk:PJTraill|talk]]) 10:35, 4 November 2017 (UTC)
: One approach to avoid external fragmentation is to move surviving objects such that they are stored contiguously in memory. This is possible only for programming languages where each pointer is well-defined and where all pointers can found. Then this could be done using a garbage collector that is free to move objects. Alternatively, you can work with allocations of fixed memory units where objects are not necessarily stored contiguously in memory (see [https://dl.acm.org/doi/pdf/10.1145/354880.354883]). This, however, requires compiler support. --[[User:AFBorchert|AFBorchert]] ([[User talk:AFBorchert|talk]]) 11:33, 17 December 2020 (UTC)
== 'File slack' and 'slack space' ==
[[File slack]] and [[slack space]] both redirect to [[Fragmentation (computing)#Internal fragmentation]], but these terms do not appear anywhere in the target article. – [[User:Tea2min|Tea2min]] ([[User talk:Tea2min|talk]]) 08:21, 9 July 2018 (UTC)
== File system fragmentation ==
I didn't want to attempt major surgery to this article, but there already is an article [[File system fragmentation]] that talks about problems with external storage. I would suggest that this article concentrate on main storage fragmentation and eliminate (or merge) the material on file system frag. [[User:Peter Flass|Peter Flass]] ([[User talk:Peter Flass|talk]]) 15:45, 15 July 2021 (UTC)
== India Education Program course assignment ==
[[File:Wikipedia-Ambassador-Program-Logo.png|50px]] This article was the subject of an educational assignment at College Of Engineering Pune supported by [[Wikipedia:Education program/Ambassadors|Wikipedia Ambassadors]] through the [[Wikipedia:India Education Program|India Education Program]] during the 2011 Q3 term. Further details are available [[Wikipedia:India Education Program/Courses/Fall 2011/Data Structures and Algorithms|on the course page]].[[Category:India Education Program student projects, 2011 Q3|{{PAGENAME}}]] [[Category:India Education Program student projects]]
{{small|The above message was substituted from {{tlc|IEP assignment}} by [[User:PrimeBOT|PrimeBOT]] ([[User talk:PrimeBOT|talk]]) on 20:04, 1 February 2023 (UTC)}}
|