page426.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 37 行

HTML
37 行
字号 
<HTML><HEAD><TITLE>The Fragmentation Problem</TITLE></HEAD><BODY bgcolor="#FFFFFF"> <a href="../index.html" target="_top"><img src="../icons/usins.gif" alt="Logo" align=right></a><b>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</b><br><A NAME="tex2html6081" HREF="page427.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html6079" HREF="page425.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html6075" HREF="page425.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html6083" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <BR><HR><H2><A NAME="SECTION0013310000000000000000">The Fragmentation Problem</A></H2><P>Fragmentation is a phenomenon that occurs in a long-runningprogram that has undergone garbage collection several times.The problem is that objects tend to become spread out in the heap.Live objects end up being separated by many, small unused memory regions.The problem in this situation is that it may become impossible toallocate memory for an object.While there may indeed be sufficient unused memory,the unused memory is not contiguous.Since objects typically occupy consecutive memory locationsit is impossible to allocate storage.<P>The mark-and-sweep algorithm does not address fragmentation.Even after reclaiming the storage from all garbage objects,the heap may still be too fragmented to allocate the required amount of space.The next section presents an alternative to the mark-and-sweep algorithmthat also <em>defragments</em><A NAME=30961>&#160;</A>(or <em>compacts</em><A NAME=30963>&#160;</A>) the heap.<P><HR><A NAME="tex2html6081" HREF="page427.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html6079" HREF="page425.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html6075" HREF="page425.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html6083" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright &#169; 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a>  All rights reserved.</ADDRESS></BODY></HTML>

page426.html - 源码说明

本页面展示了「Data Structures And Algorithms With Object-Oriented Design Patterns In Python (2003) source code and」中的 page426.html 源码文件，采用 HTML 编程语言编写，共 37 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Object-Oriented相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?