3.3 Suppose a computer has an atomic swap instruction, defined as follows: Swap (varl, var2): (tmp = varl; varl = var2; var2 = tmp; ) In the above, tmp is an internal register. (a) Using Swap, develop a solution to the critical section problem for n pro- cesses. Do not worry about the eventual entry property. Describe clearly how your solution works and why it is correct. (b) Modify your answer to (a) so that it will perform well on a multiprocessor system with caches. Explain what changes you make (if any) and why. (c) Using Swap, develop a fair solution to the critical section problem-namely, one that also ensures eventual entry to each waiting process. The key is to order the processes, where first-come, first-served is the most obvious ordering. Note that you cannot just use your answer to (a) to implement the atomic action in the ticket algorithm, because you cannot get a fair solution using unfair components. You may assume that each process has a unique identity, say, the integers from 1 to n. Explain your solution, and give convincing arguments why it is correct and fair.

3.3 Suppose a computer has an atomic swap instruction, defined as follows: Swap (varl, var2): (tmp = varl; varl = var2; var2 = tmp; ) In the above, tmp is an internal register. (a) Using Swap, develop a solution to the critical section problem for n pro- cesses. Do not worry about the eventual entry property. Describe clearly how your solution works and why it is correct. (b) Modify your answer to (a) so that it will perform well on a multiprocessor system with caches. Explain what changes you make (if any) and why. (c) Using Swap, develop a fair solution to the critical section problem-namely, one that also ensures eventual entry to each waiting process. The key is to order the processes, where first-come, first-served is the most obvious ordering. Note that you cannot just use your answer to (a) to implement the atomic action in the ticket algorithm, because you cannot get a fair solution using unfair components. You may assume that each process has a unique identity, say, the integers from 1 to n. Explain your solution, and give convincing arguments why it is correct and fair.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

"Type" doesn't specify a variable. Variables have data types. How can this idea explain any variable?
The term "for construct" refers to a type of loop that can iterate over multiple items. So long as there are objects to process, it will continue to operate. Is this a true or false statement?
The term "for construct" refers to a loop in computer programming that processes a list of items. As a direct consequence of this, it continues to operate for as long as there are objects to be processed. Which of these two interpretations of the statement is correct?
Write a game of rock paper scissors, one of the choices will be from the user and the other from the computer (use random) Print results for each game.Play the games in a row until you exit the game. Explain each step as comment.Game rules:Rock crushes scissors, you win.Paper covers rock, you win.Scissors cut paper, you win
In vim, when the cursor is on the first letter of a word, you may capitalise it by typing x and then p.
Q code for design in java a circle image of food is placed in an ellipse shape of cream color when a button is placed 9 times then the ellipse starts rotating and so does the circle shape in it.
The Problems - contains only problems from the last 2 contests Separate Un-Attempted, Attempted and All cards Problem Difficulty Rating - The Featured drop-down menu has different difficulty ranges so you can try problems that best suit your experience. Popular topics and brands Like most users, Chef didn't know that he could add problems to his personal to-do list by clicking the magic "+" symbol in the upper right corner of each problem page. But once he found out about it, he went crazy and added a lot of problems to his to-do list without looking at their difficulty rating. Rajesh is a beginner and ideally should only try to solve problems strictly below 10001000. Given the difficulty rating list of problems in Chef's to-do list, please help him determine how many of these problems Chef should remove from his to-do list so he is left with only problems with a difficulty rating of less than 10001000. Note: Please answer the question in Python only: Input 1 4 999 1000 1001 1002…
16 Type the correct answer in the box. Use numerals instead of words. If necessary, use / for the fraction bar. var num2 = 32; var num1 = 12; var rem=num2 % num1; while(rem> 0) { num2 = num1; num1 = rem; rem =num2 9% num1; document.write(num1): The output of the document.write statement at the end of this block is Reset Next m. All rights reserved. 5896
The Problems - contains only problems from the last 2 contests Separate Un-Attempted, Attempted and All cards Problem Difficulty Rating - The Featured drop-down menu has different difficulty ranges so you can try problems that best suit your experience. Popular topics and brands Like most users, Chef didn't know that he could add problems to his personal to-do list by clicking the magic "+" symbol in the upper right corner of each problem page. But once he found out about it, he went crazy and added a lot of problems to his to-do list without looking at their difficulty rating. Rajesh is a beginner and ideally should only try to solve problems strictly below 10001000. Given the difficulty rating list of problems in Chef's to-do list, please help him determine how many of these problems Chef should remove from his to-do list so he is left with only problems with a difficulty rating of less than 10001000. Note: Please answer the question in Python only: Input 1 4 999 1000 1001 1002…
TRUE-FALSE: Type YES if the given statement is correct. Otherwise, type NO. Analyzing information nowadays is easier than in the past.