Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 9.19HW
1.
Program Plan Intro
Memory Management
Memory management decodes virtual addresses using a lookup table stored in main memory and the information is managed by the
Garbage Collector
Garbage collector frees allocated blocks automatically which is not used longer by the program. This is also known as dynamic storage allocator.
2.
Program Plan Intro
Memory Management
Memory management decodes virtual addresses using a lookup table stored in main memory and the information is managed by the operating system.
Garbage Collector
Garbage collector frees allocated blocks automatically which is not used longer by the program. This is also known as dynamic storage allocator.
3.
Program Plan Intro
Memory Management
Memory management decodes virtual addresses using a lookup table stored in main memory and the information is managed by the operating system.
Garbage Collector
Garbage collector frees allocated blocks automatically which is not used longer by the program. This is also known as dynamic storage allocator.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a C program to simulate producer-consumer problem using semaphores.
TASK:
DESCRIPTION
Producer-consumer problem, is a common paradigm for cooperating processes. A producer process produces information that is consumed by a consumer process. One solution to the producer-consumer problem uses shared memory. To allow producer and consumer processes to run concurrently, there must be available a buffer of items that can be filled by the producer and emptied by the consumer. This buffer will reside in a region of memory that is shared by the producer and consumer processes. A producer can produce one item while the consumer is consuming another item. The producer and consumer must be synchronized, so that the consumer does not try to consume an item that has not yet been produced.
Assume that a memory module contains three holes of 10MB each. A sequence of 14
requests for 1MB each will be processed (See the diagram below). For each of the memory
allocation methods listed below, draw a diagram representing how memory is allocated and
determine the sizes of the remaining holes after all 14 requests have been satisfied.
First fit
Next fit
C. Best fit
d.
a.
b.
Worst fit
Hint - For the Next fit, the following allocation starts with the hole following the previous allocation
10 Mb
10 Mb
10 Mb
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Chapter 9 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 9.2 - Prob. 9.1PPCh. 9.3 - Prob. 9.2PPCh. 9.6 - Prob. 9.3PPCh. 9.6 - Prob. 9.4PPCh. 9.8 - Practice Problem 9.5 (solution page 882) Write a C...Ch. 9.9 - Prob. 9.6PPCh. 9.9 - Prob. 9.7PPCh. 9.9 - Prob. 9.8PPCh. 9.9 - Prob. 9.9PPCh. 9.9 - Prob. 9.10PP
Ch. 9 - Prob. 9.11HWCh. 9 - Repeat Problem 9.11 for the following address....Ch. 9 - Repeat Problem 9.11 for the following address....Ch. 9 - Given an input file hello.txt that consists of the...Ch. 9 - Determine the block sizes and header values that...Ch. 9 - Prob. 9.16HWCh. 9 - Prob. 9.17HWCh. 9 - Prob. 9.18HWCh. 9 - Prob. 9.19HWCh. 9 - Write your own version of malloc and free, and...
Knowledge Booster
Similar questions
- There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you double the number of sectors per block, then you double the number of blocks on the disk. b)…arrow_forwardThere are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you divide tracks into half as many blocks, then you double the read time for a block.…arrow_forwardTwo main techniques are used for memory management in modern computers and operating systems, as described in this module's readings: paging and segmentation. Sometimes they are combined in a segmentation with paging scheme. Design a memory management scheme for a 50 bit computer architecture, using paging, segmentation or both, as described in this module's readings. Your post should include a clear translation scheme from a 50 bit logical address to a 50 bit physical address including a picture that shows how this translation takes place. In particular, each field of the logical address must be clearly depicted and its length in bits must be specified. The proposed scheme must be at least somewhat realistic; for this reason, simple paging and simple segmentation schemes are automatically disqualified, due to the impossible requirements imposed on the implementation in this case (50 bits addresses)arrow_forward
- Operating sys :In the following producer and consumer problem using semaphores, explain with an example (semaphore values), how a producer sends a signal to a consumer, so that the consumer does not have to check the buffer all the time. /*program, Producer/Consumer */ semaphore n = 0; /* no of items in the buffer */ semaphore s = 1; /* ME semaphore */ void Producer () { while(TRUE) { produce(); wait(s); append(); signal(s); signal(n); } } void Consumer () { while(TRUE) { wait(n); wait(s); take(); signal(s); consume(); } }arrow_forwardProgram binaries in many systems are typically structured as follows. Code is stored starting with a small fixed virtual address such as 0. The code segment is followed by the data segment that is used for storing the program variables. When the program starts executing, the stack is allocated at the other end of the virtual address space and is allowed to grow towards lower virtual addresses. What is the significance of the above structure on the following schemes: a. contiguous-memory allocation b. pure segmentation c. pure pagingarrow_forwardDesign a memory map to work with 8085 Microprocessor to have 8K byte ROM and 2K byte RAM. ROM should start from memory location 0000H and RAM immediately follows it. Use exhaustive decoding scheme?arrow_forward
- Question 5 Multiple Choice: We have been assigned the task of selecting an interface language for a disk controller that must count disk reads. In particular, the controller must count how many reads have occurred since the last write to the disk and confirm that the count of reads does not exceed 1,000,000. Two proposals have been made. Method C uses C++ while Method R uses regular expressions. Then I would use Method C because Method R would translate into a finite automaton with at least 1,000,000 states. I cannot use Method C because it is not able to keep track of the count of reads. I would use Method C because Method R cannot keep track of the count of reads. I cannot use Method R because regular expressions cannot represent integers.arrow_forwardConsider the free memory layout shown below (the blocks are ordered from top to bottom). To the right, draw to the what the free memory layouts would be after satisfying requests for (in order) memory blocks of size 55K, 210K, 381K, and 395K. Draw one memory layout for the best-fit algorithm, and one for first-fit. 500K 300K 200K 300Karrow_forwardProblem DescriptionThe Tower of Hanoi ProblemTower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game(1) Only one disk may be moved at a time.(2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks.Starting state Goal stateP1 P2 P3 P1 P2 P32RequirementsIn this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python.Two state space search algorithms: (1) a blind…arrow_forward
- Note: Write a bash script to simulate producer-consumer problem using semaphores. Producer-consumer problem is a common paradigm for cooperating processes. A producer process produces information that is consumed by a consumer process. One solution to the producer-consumer problem uses shared memory. To allow producer and consumer processes to run concurrently, there must be available a buffer of items that can be filled by the producer and emptied by the consumer. This buffer will reside in a region of memory that is shared by the producer and consumer processes. A producer can produce one item while the consumer is consuming another item. The producer and consumer must be synchronized, so that the consumer does not try to consume an item that has not yet been produced.arrow_forwardThe Tower of Hanoi Problem Tower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game (1) Only one disk may be moved at a time. (2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks. starting sate p1 to goal state p3 Requirements In this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python. Two state space search algorithms: (1) a blind search (depth-first…arrow_forwardWhen translating conditionals or loops, the generated low-level code contains jumps. For the CPU to be able to execute a jump, the target of a jump must be a valid memory address. However, code generators typically generate jumps to symbolic addresses (labels). For example: beq exit Answer the following questions about symbolic addresses. i. What are the advantages of using symbolic addresses? ii. Which programs are responsible for translating such symbolic addresses to actual memory addresses? iii. How do code generators create symbolic addresses?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,