Page Frame Allocation: Difference between revisions
Jump to navigation
Jump to search
| [unchecked revision] | [unchecked revision] |
Content deleted Content added
mNo edit summary |
Added an idea for a second level bitmap. |
||
| Line 10: | Line 10: | ||
* a dword comparison can test up to 32 bits at once and thus speed up allocs |
* a dword comparison can test up to 32 bits at once and thus speed up allocs |
||
* keeping a pointer to the last allocated bit may improve the performance of the next search (keeping information about the fact all the previous bytes were searched unsuccessfully) |
* keeping a pointer to the last allocated bit may improve the performance of the next search (keeping information about the fact all the previous bytes were searched unsuccessfully) |
||
* you could use a bitmap of the bitmap - instead of searching 128KB you search 512 Bytes then 256 Bytes (for example). You will have to keep the second level up to date though. It should be faster to search and then if none found set second level to false than to check every time you alloc. |
|||
===Stack/List of pages=== |
===Stack/List of pages=== |
||