Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Mark-compact_algorithm> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Mark-compact_algorithm abstract "In computer science, a mark-compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark-compact algorithms can be regarded as a combination of the mark-sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler.".
- Mark-compact_algorithm thumbnail Table-based_heap_compaction_flattened.svg?width=300.
- Mark-compact_algorithm wikiPageID "9854002".
- Mark-compact_algorithm wikiPageLength "5016".
- Mark-compact_algorithm wikiPageOutDegree "17".
- Mark-compact_algorithm wikiPageRevisionID "592444121".
- Mark-compact_algorithm wikiPageWikiLink Algorithm.
- Mark-compact_algorithm wikiPageWikiLink Big_O_notation.
- Mark-compact_algorithm wikiPageWikiLink Category:Automatic_memory_management.
- Mark-compact_algorithm wikiPageWikiLink Category:Memory_management_algorithms.
- Mark-compact_algorithm wikiPageWikiLink Cheneys_algorithm.
- Mark-compact_algorithm wikiPageWikiLink Common_Language_Runtime.
- Mark-compact_algorithm wikiPageWikiLink Comparison_sort.
- Mark-compact_algorithm wikiPageWikiLink Computer_science.
- Mark-compact_algorithm wikiPageWikiLink File:Table-based_heap_compaction_flattened.svg.
- Mark-compact_algorithm wikiPageWikiLink Fragmentation_(computer).
- Mark-compact_algorithm wikiPageWikiLink Fragmentation_(computing).
- Mark-compact_algorithm wikiPageWikiLink Garbage_collection_(computer_science).
- Mark-compact_algorithm wikiPageWikiLink Glasgow_Haskell_Compiler.
- Mark-compact_algorithm wikiPageWikiLink LISP2.
- Mark-compact_algorithm wikiPageWikiLink LISP_2.
- Mark-compact_algorithm wikiPageWikiLink Mark-sweep_algorithm.
- Mark-compact_algorithm wikiPageWikiLink Microsoft.
- Mark-compact_algorithm wikiPageWikiLink Unreachable_memory.
- Mark-compact_algorithm wikiPageWikiLinkText "Mark-compact algorithm".
- Mark-compact_algorithm hasPhotoCollection Mark-compact_algorithm.
- Mark-compact_algorithm wikiPageUsesTemplate Template:Memory_management_navbox.
- Mark-compact_algorithm wikiPageUsesTemplate Template:Reflist.
- Mark-compact_algorithm wikiPageUsesTemplate Template:Use_dmy_dates.
- Mark-compact_algorithm subject Category:Automatic_memory_management.
- Mark-compact_algorithm subject Category:Memory_management_algorithms.
- Mark-compact_algorithm hypernym Algorithm.
- Mark-compact_algorithm type Software.
- Mark-compact_algorithm type Algorithm.
- Mark-compact_algorithm comment "In computer science, a mark-compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark-compact algorithms can be regarded as a combination of the mark-sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler.".
- Mark-compact_algorithm label "Mark-compact algorithm".
- Mark-compact_algorithm sameAs Algorytm_mark-compact.
- Mark-compact_algorithm sameAs m.02ptxng.
- Mark-compact_algorithm sameAs Q603745.
- Mark-compact_algorithm sameAs Q603745.
- Mark-compact_algorithm wasDerivedFrom Mark-compact_algorithm?oldid=592444121.
- Mark-compact_algorithm depiction Table-based_heap_compaction_flattened.svg.
- Mark-compact_algorithm isPrimaryTopicOf Mark-compact_algorithm.
