Computers and Technology, 13.07.2021 15:30 19cmulett
The ''Buddy Algorithm'' allocates pages in the power of 2. The request will be rounded up to the next highest power of 2. Give a simple illustration of the algorithm. Suppose, there exists a single contiguous memory of 64 pages. a) Process A requests 7 pages. b) Process B requests 3 pages. c) Process C requests 9 pages. d) Process B returns its request. e) Process D requests 9 pages.
Answers: 3
Another question on Computers and Technology
Computers and Technology, 22.06.2019 14:20
Consider a byte-addressable computer with 16mb of main memory, a cache capable of storing a total of 64kb of data and block size of 32 bytes. (a) how many bits in the memory address? (b) how many blocks are in the cache? (c) specify the format of the memory address, including names and sizes, when the cache is: 1. direct-mapped 2. 4-way set associative 3. fully associative
Answers: 2
Computers and Technology, 22.06.2019 22:30
Alex’s family members live in different parts of the world. they would like to discuss the wedding plans of one of their distant relatives. however, alex wants all the family members to talk to each other simultaneously so that they can make decisions quickly. which mode of internet communication should they use? a. blog b. email c. wiki d. message board e. instant messaging
Answers: 2
Computers and Technology, 23.06.2019 03:30
In vista and windows 7, the appearance and personalization option allows you to change the
Answers: 1
Computers and Technology, 23.06.2019 06:20
What is a point-in-time measurement of system performance?
Answers: 3
You know the right answer?
The ''Buddy Algorithm'' allocates pages in the power of 2. The request will be rounded up to the nex...
Questions
Mathematics, 02.07.2019 12:30
English, 02.07.2019 12:30
Geography, 02.07.2019 12:30
History, 02.07.2019 12:30
Mathematics, 02.07.2019 12:30
Chemistry, 02.07.2019 12:30
Social Studies, 02.07.2019 12:30
Mathematics, 02.07.2019 12:30
