Memory Allocation Algorithms
Prior to beginning work on this assignment, read the following sections in your textbook: 7.1 to 7.4 and 7.9 in Chapter 7: Main Memory. Finally, read the Operating System – Memory Management tutorial.
To complete this assignment, consider the following scenario:
- Eight unique processes (which terminate in the following order: 21 KB, 77 KB, 199 KB, 380 KB, 489 K¬B, 212 KB, 139 KB, and 302 KB) must be placed into ten memory partitions organized in the following order: 150 KB, 275 KB, 425 KB, 300 KB, 80 KB, 117 KB, 500 K¬B, 35 KB, 313 KB, and 269 KB.
Explain step by step how each of the dynamic storage allocation algorithms (first-fit, best-fit, and worst-fit) would place the given processes within the given memory partitions. Identify the memory partitions that remain after placing each process. Visually illustrate each algorithm with a chart or diagram. An example diagram was created in Excel, but you may also choose to use a graphics editing software (PowerPoint, Paint, PhotoShop, etc.) or upload a photo of a hand-drawn sketch.
Compare the algorithms and explain which model makes the most efficient use of memory and which model executes the quickest.
The Memory Allocation Algorithms paper
- Must be a minimum of two double-spaced pages (500 words) in length (not including title, reference page, and diagrams) and formatted according to APA style as outlined in the Writing Center.
- Must include a separate title page with the following:
- Title of paper
- Student’s name
- Course name and number
- Instructor’s name
- Date submitted
0 comments