This preview shows page 1. Sign up to view the full content.
Unformatted text preview: complete code for a simple allocator based on an explicit free list with a block size and successor pointer in each free block. The code is interesting in that it uses unions to eliminate a lot of the complicated pointer arithmetic, but at the expense of a linear-time (rather than constant-time) free operation. Ben Zorn’s Dynamic Storage Allocation Repository at www.cs.colorado.edu/˜zorn/DSA.html is a handy resource. It includes sections on debugging tools for detecting memory-related errors and implementations of malloc/free and garbage collectors. Homework Problems
Homework Problem 10.11 [Category 1]: In the following series of problems, you are to show how the example memory system in Section 10.6.4 translates a virtual address into a physical address and accesses the cache. For the given virtual address, indicate the TLB entry accessed, the physical address, and the cache byte value returned. Indicate whether the TLB misses, whether a page fault occurs, and whether a cache miss occurs. If there is a cache miss, enter “–” for...
View Full Document
This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.
- Spring '10
- The American