Computer

Computer
Name of the Science
Science Department
Department
Department
: CS ClassII:BSc
II BScCTCT Odd Semester
OddOdd
Semester 2017
Sem 2017
2017 - 18
–-18
18

Course: Data Structures Sub Code: 33A

Google Classroom: owxkn59 Programme: BSc CT

Unit: II Hour : 2

Dynamic Storage Management

Faculty: S. Malathi

Data Structures UnitUnit II – Session

II – Session 8 8 Dynamic Storage Management
Doubly Linked List 1
 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Snap Talk / News Feed

Data Structures Unit II – Session 8 Dynamic Storage Management 2

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Lecture - Content
• Review of Pervious topic
• Preview Questions
• Storage Management – Introduction
• Example
• Allocation Strategy
• First Fit - Procedure
• Diagrammatic Explanation
• Conclusion
Data Structures Unit II – Session 8 Dynamic Storage Management 3
 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Review of Previous Topic

• Dynamic Linked List

Data Structures Unit II – Session 8 Dynamic Storage Management 4

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Preview Questions
• What do you mean by Dynamic?
• Storage Management means _______.
• Define multiprocessing environment.

Data Structures Unit II – Session 8 Dynamic Storage Management 5

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Introduction
• Multiprocessing computer environment.
• OS may require various memories.
• 60k for one program
• 100k for other program
• 300k for another program
• Reside at the same time

Data Structures Unit II – Session 8 Dynamic Storage Management 6

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

• OS allocate - block of contiguous storage - right size

• Program Execution complete – frees the memory
• Assume – start with 1,00,000 words of memory and
five programs
– P1 = 10,000
– P2 = 15,000
– P3 = 6,000
– P4 = 8,000
– P5 = 20,000 respectively

Data Structures Unit II – Session 8 Dynamic Storage Management 7

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

p1 p2 p3 p4 p5 Free space

1 10k 25k 31k 39k 59k 1 lakh

Data Structures Unit II – Session 8 Dynamic Storage Management 8

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

p1 Free p3 Free p5 Free space

1 10k 25k 31k 39k 59k 1 lakh

Data Structures Unit II – Session 8 Dynamic Storage Management 9

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Allocation Strategy
• Best Fit
• First Fit

Data Structures Unit II – Session 8 Dynamic Storage Management 10

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

AV
0 15000 8000 41000 0

Data Structures Unit II – Session 8 Dynamic Storage Management 11

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

First Fit Strategy

Procedure FF(n, p)
P  LINK(AV); q  AV
While p = 0 do
If SIZE(p) > n then [SIZE(p)  SIZE(p)-n
If SIZE(p) = 0 then LINK(q )  LINK(p)
Else p  p + SIZE(p)
Return]
q  p;
P  LINK(P)
End
End FF
Data Structures Unit II – Session 8 Dynamic Storage Management 12
 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Available space list when adjacent free blocks are not

combined

0 6000 15000 8000 41000 0

Data Structures Unit II – Session 8 Dynamic Storage Management 13

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Available space list when adjacent free blocks are

combined

0 29000 41000 0

Data Structures Unit II – Session 8 Dynamic Storage Management 14

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Conclusion
• Keywords: Storage Management, Best Fit, First
Fit, Available List (AV).
• Summary:
– Memory allocation for different programs
– Allocation Stragtegy
– Storage Pool when memory frees

Data Structures Unit II – Session 8 Dynamic Storage Management 15

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Quiz

• Allocation Strategy

• When program releases memory what

happens to the block of memory

• FF strategy

Data Structures Unit II – Session 8 Dynamic Storage Management 16

 ComputerScience
Computer Science Department
Department II BSc
II BScCTCT Odd Odd
Semester 2017
Sem 2017 - 18
– 18

Thank You

Data Structures Unit II – Session 8 Dynamic Storage Management 17