1. Given the following information
Job List Memory Requested
J1 740K
J2 500K
J3 700K
Memory List
Memory Block Size
Block1 650K
Block2 850K
Block3 700K
A. Use the best fit algorithm to allocate the memory blocks to those arriving jobs.
B. Allocate the memory blocks to the arriving jobs.
A.
| Memory Block | Memory Size | Job Number | Job Size | Status | Internal Fragmentation |
| Block1 Block2 Block3 | 650K 850K 700K | Job2 Job1 Job3 | 500K 740K 700K | Busy Busy Busy | 150K 60K 0K |
| | Total Available:2,200K | | Total Used: 1950K | | |
| Memory Block | Memory Size | Job Number | Job Size | Status | Internal Fragmentation |
| Block 1 Block 2 Block 3 | 650 K 850 K 700 K | Job 2 Job 1 Job 3 | 500 K 740 K 700 K | Busy Busy Busy | 150 K 60 K 0 K |
| | Total Avail:2,200K | | Total Used: 1950K | | |
B.
V 2.
1. Given the following information
Job List
Job Number Memory Requested
J1 700K
J2 500K
J3 740K
Memory List
Memory Block Size
Block1 610K
Block2 850K
Block3 700K
A. Use the best fit algorithm to allocate the memory blocks to the 3 arriving jobs.
B. Use the first fit algorithm to allocate the memory blocks to the three arriving jobs
| Memory Block | Memory Size | Job Number | Job Size | Status | Internal Fragmentation |
| Block 1 Block 2 Block 3 | 610 K 850 K 700 K | Job 2 Job 3 Job 1 | 500 K 740 K 700 K | Busy Busy Busy | 110 K 110 K 0 K |
| | Total Avail:2,160 K | | Total Used: 1,940 K | | |
| Memory Block | Memory Size | Job Number | Job Size | Status | Internal Fragmentation |
| Block 1 Block 2 Block 3 | 610 K 850 K 700 K | Job 2 Job 1 | 500 K 500 K | Busy Busy Free | 110 K 110 K |
| | Total Avail:2,160 K | | Total Used: 1,940 K | | |
No comments:
Post a Comment