Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)

Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

 

Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment.

Determine how much memory each data structure uses (the bitmap will be in terms of n)

 

 

 

Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (2¹5 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. A. Determine how much memory each data structure uses (the bitmap will be in terms of n) B. Determine what the break-even point is for the bitmap and linked-list methods. "Break-even" means the value of n for which they use the same amount of memory.
Transcribed Image Text:Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (2¹5 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. A. Determine how much memory each data structure uses (the bitmap will be in terms of n) B. Determine what the break-even point is for the bitmap and linked-list methods. "Break-even" means the value of n for which they use the same amount of memory.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Hash Table
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS