Maekawa''s algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM13158958

Maekawa's Algorithm is used to achieve mutual exclusion for 13 sites. Suppose the sites are labeled 1, 2, ..., 13. Find the request sets R1, R2, ... , R13. Suppose sites 1, 6, 12 want to enter a critical section ( CS ) and they have sent requests in the order 1, 6, 12. The following sequence of events have occurred in the order listed: 1. The requests of site 1 have arrived at site 2, and site 3. Its request to site 4 is on the way. 2. The requests of site 6 have arrived at site 9, and site 12. Its request to site 2 is on the way. 23. The requests of site 12 have arrived at site 4, and site 7 and 8. Draw a diagram to show which sites have been locked and locked by whom. Suppose the transit requests have arrived at their destinations. At this point can any site enter the CS? Why? If not, how do the sites resolve the problem?

Reference no: EM13158958

Questions Cloud

Similarities between the luddites : Are there similarities between the Luddites of the 19th century and the neo-Luddites of today? What objections do they have against technology? Is our technology "dumbing us down"?
Amount of the liability on balance sheet : Compute the amount of the liability that should appear on the December 31, 2011, balance sheet.
What determines the destiny of the pyruvate : What determines the 'destiny' of the pyruvate produced in glycolysis? What are the products and the final by products of anaerobic respiration in yeasts? What are the final products and final by products of anaerobic respiration in humans?
Explain ammonia can react with oxygen : At high temperatures, ammonia can react with oxygen according to the following unbalanced reaction: NH3 + O2 ---> NO + H2O If 5.76 moles of NH3 react with 12.2 moles of oxygen
Maekawa''s algorithm : Maekawa's Algorithm is used to achieve mutual exclusion for 13 sites. Suppose the sites are labeled 1, 2, ..., 13. Find the request sets R1, R2, ... , R13. Suppose sites 1, 6, 12 want to enter a critical section ( CS ) and they have sent requests in ..
Explain how bacteria can make one mrna molecule : An operon with one regulatory region and three protein?coding genes will have how many promoters? Related: Explain how bacteria can make one mRNA molecule that contains the code for several proteins.
Duffman concludes that the total amount of money spent : In the small town of Springfield, Duffman observes that the price of beer has fallen. Duffman concludes that the total amount of money spent buying beer has to fall since the price of beer is lower.
Explain how combustion is related to cell respiration : Explain how combustion is related to cell respiration. Explain how the cardiovascular and respiratory systems are connected to cell respiration.
Political and religious beliefs and institutions : What political and religious beliefs and institutions gave Hebrew civilization its unique character and account for its important legacy to Western civilization?

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Create a solution algorithm using pseudocode

Algorithm that will receive two integer items from a terminal operator, and display to the screen their sum, difference, product and quotient.

  Describe why algorithm runs in linear time-adjacency matrix

Rreached from every other vertex. Describe why your algorithm runs in linear time (O(V2) on an adjacency matrix; O(E+V) on an adjacency list).

  Design randomized algorithm for solving decoding problem

The Viterbi algorithm is a deterministic algorithm for solving the Decoding problem. Design a randomized algorithm for solving the Decoding problem.

  Question about key encryption

Assume Alice wishes to send an e-mail to Bob. Bob has a public private key pair, Alice has Bob's certificate. But Alice does not have a public, private key pair.

  Computing time complexity of procedure

What is the time complexity of the procedure? If A[l .. r] = [24, 30, 09, 46, 15, 19, 29, 86,78], what is the output?

  Perform page trace analysis by fifo page removal algorithm

Using the FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks (*). Then compute the failure and success ratios.

  Explain the fifo structure of the queue

Explain the FIFO structure of the queue Explain how you would implement the queue data structure in its simplest form. Illustrate your answer fully with the necessary sample code

  Question about damaged database

Suppose if you were one of the users of a damaged database, discuss how would you be affected by such a failure and what measures could you take to prevent it?

  Explaining instruction format of operation code field

Operation code field, a mode field, to specify one of seven addressing modes, a register address field to specify one of 60 processor registers, and memory address. Specify instruction format and number of bits in each field if the instruction ..

  Data systems and design

Suppose if you have a program with a housekeep() module, a mainloop() module, and a finishup() module, when is the second input record usually read?

  Creating code for a class called arrayqsn

Create all the code for a class called ArrayQsn. This class will contain 2-techniques. The first technique runningSumMean accepts an array of ints as a parameter, and will return the mean of the values as a double.

  Explaining elementary operations used in algorithm

How many elementary operations are used in algorithm given below? The elementary operations are comparison operations (such as > and

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