Problem based on banker''s algorithm, Computer Engineering

Assignment Help:

A system contains 10 units of resource class Ru. The resource requirements of three user processes P1, P2 and P3 are as follows

                                                P1                  P2                P3

Maximum requirements          8                     7                   5

Current allocation                   3                     1                   3

Balance requirements            5                     6                   2

New request made                 1                     0                   0

Using Banker's algorithm, determine if the projected allocation state is safe and whether the request of P1 will be granted or not.

From the specified data: Total_alloc=[7] Total_exist=[10]

The projected allocation state is feasible as the total allocation into this does not exceed the number of resource units of Ru. Because P3 is two units short of its maximum requirement and two unallocated unit exits into the system, therefore P3 can complete. It will release the resources allocated to this, i.e., 5 resources. Here P1 can complete as the number of unallocated units of Ru exceeds the units required to satisfy its maximum requirement then P2 can be finished.

Therefore the processes can complete in the sequence P3, P1, and P2. Therefore projected allocation state is safe thus algorithm will grant the request made through P1.


Related Discussions:- Problem based on banker''s algorithm

Genetic algorithms - artificial intelligence, Genetic Algorithms: In s...

Genetic Algorithms: In such a scenario the evolutionary approach to "Artificial Intelligence" is one of the neatest ideas of all. Whether we have tried to mimic the functionin

How putchar function is used within a c program, How putchar function is us...

How putchar function is used within a C Program ? The following program reads each character in the first line of input entered at the terminal's keyboard. It uses putchar to d

Explain dynamic server creation briefly, Explain dynamic server creation br...

Explain dynamic server creation briefly. Dynamic Server Creation: If only one server handles one request at a time, each client should wait while the server fulfils the on

General concepts of links and association, General Concepts of links and as...

General Concepts of links and association A link is a conceptual or physical connection among objects for instance. Mathematically, you can define a link as a tuple which is a

Analysis of parallel algorithms, A generic algorithm is mostly analysed on ...

A generic algorithm is mostly analysed on basis of subsequent parameters: the space complexity (amount of space required) and the time complexity (execution time). Generally we giv

Networking, Nyquist''s sampling theorem says "if you have a signal that is ...

Nyquist''s sampling theorem says "if you have a signal that is perfectly band limited to a bandwidth of f0 then you can collect all the information there is in that signal by sampl

Flowchart, flow chart for ''sin x'' as sum of serie

flow chart for ''sin x'' as sum of serie

Number of addresses in an instruction, Generally the Instruction Set Archit...

Generally the Instruction Set Architecture (ISA) of a processor can be distinguished using five categories:  Operand Storage in the CPU - Where are the operands kept other t

Illustrate about 8259, Illustrate about 8259 8259A adds 8 vectored pri...

Illustrate about 8259 8259A adds 8 vectored priority encoded interrupts to the microprocessor. We can expand it to 64 interrupt requests by using one master 8259A and 8 slave

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd