Computer Systems: A Programmer's Perspective Plus Mastering Engineering With Pearson Etext -- Access Card Package (3rd Edition)
Computer Systems: A Programmer's Perspective Plus Mastering Engineering With Pearson Etext -- Access Card Package (3rd Edition)
3rd Edition
ISBN: 9780134123837
Author: Randal E. Bryant, David R. O'Hallaron
Publisher: PEARSON
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 9, Problem 9.17HW

Explanation of Solution

Perform Next-fit search instead of First-fit search:

In the “Section 9.9.12 (mm.c)”, remove the lines that starts from “/* $begin mmfirstfit */” and ends with “return NULL; /* No fit */”.

Add the following highlighted code to the “Section 9.9.12 (mm.c)”. The modified “mm.c” file is as follows:

/* Global variables */

static char *heap_listp = 0;  /* Pointer to first block */

// Rover for Next fit

static char *rover;

/* Function prototypes for internal helper routines */

static void *extend_heap(size_t words);

heap_listp += (2 * WSIZE);

/* $end mminit */

// Assign heap_listp to rover

rover = heap_listp;

/* $begin mminit */

/* Extend the empty heap with a free block of CHUNKSIZE bytes */

bp = PREV_BLKP(bp);

}

/* $end mmfree */

// If condition to check the rover is not representing the free block

if ((rover > (char *)bp) && (rover < NEXT_BLKP(bp)))

// Assign bp to rover

rover = bp;

/* $begin mmfree */

return bp;

}

{

/* Next fit search instead of first fit search*/

// Assign rover to the character pointer oldrover

char *oldrover = rover;

/* Finding next fit using for loop */

// For loop to search from rover to the end of the list

for (; GET_SIZE(HDRP(rover)) > 0; rover = NEXT_BLKP(rover))

// If condition to check allocation and size of rover

if (!GET_ALLOC(HDRP(rover)) && (asize <= GET_SIZE(HDRP(rover))))

// Return rover

return rover;

// For loop to search from start of list to old rover

for (rover = heap_listp; rover < oldrover; rover = NEXT_BLKP(rover))

// If condition to check allocation and size of rover

if (!GET_ALLOC(HDRP(rover)) && (asize <= GET_SIZE(HDRP(rover))))

// Return rover

return rover;

// Otherwise return null

return NULL;

}

/* $end mmfirstfit */

Filename: main.c

// Include libraries

#include <stdio.h>

#include <stdlib.h>

#include <assert.h>

// Include required header files

#include "csapp...

Blurred answer
Students have asked these similar questions
I need help in construct a matlab code to find the voltage, the currents, and the watts based on that circuit.
Objective Implement Bottom-Up Iterative MergeSort and analyze its efficiency compared to recursive MergeSort. Unlike the recursive approach, which involves multiple function calls and stack overhead, the bottom-up version sorts iteratively by merging small subarrays first, reducing recursion depth and improving performance. Task 1. Implement Bottom-Up Iterative MergeSort о Start with single-element subarrays and iteratively merge them into larger sorted sections. Use a loop-based merging process instead of recursion. ○ Implement an efficient in-place merging strategy if possible. 2. Performance Analysis Compare execution time with recursive MergeSort on random, nearly sorted, and reversed datasets. ○ Measure and plot time complexity vs. input size. O Submission Explain why the iterative version reduces function call overhead and when it performs better. • Code implementation with comments. • A short report (1-2 pages) comparing performance. • Graph of execution time vs. input size for…
Given a shared data set, we allow multiple readers to read at the same time, and only one single writer can access the shared data at the same time. In the lecture slides, a solution is given. However, the problem is that the write cannot write forever, if there are always at least one reader. How to ensure that the writer can eventually write? Propose your solution by using semaphores and implemented in Python from threading import Thread, Semaphore from time import sleep from sys import stdout class Reader(Thread): def__init__(self, name): self.n=name; Thread.__init__(self) defrun(self): globalnr, nw, dr, dw whileTrue: # ⟨await nw == 0 then nr += 1⟩ e.acquire() ifnw>0: #if nw > 0 or dw > 0 : dr+=1; e.release(); r.acquire() nr+=1 ifdr>0: dr-=1; r.release() else: e.release() # read data stdout.write(self.n+' reading\n') sleep(1) # ⟨nr -= 1⟩ e.acquire() nr-=1 ifnr==0anddw>0: dw-=1 ; w.release() else: e.release() class Writer(Thread): def__init__(self, name):…
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage