There are 4 sites in a distributed system, S1, S2, S3 and S4. Currently S1 possesses the idle token. The contents of the RN arrays of S1, S2, S3 and S4 are respectively as follows - RN₁ = [2 0 0 0], RN2 = [2 0 0 0], RN3 = [2 0 0 0], RN4 = [2 0 0 0]. The contents of the token array LN is LN = [2 0 0 0]. The queue Q is currently empty. Now, S3 wants to enter CS. S3 enters CS and while S3 is executing CS, S4 wants to enter CS. Apply the Suzuki-Kasami's broadcast algorithm and describe the steps using which S3 and S4 send REQUEST messages, how the contents of the RN and LN arrays as well as the queue Q are changed, the token is dispatched to the requesting sites, the requesting sites enter CS and after finishing execution exit the CS. Note that you have to write the steps of the algorithm as applicable to the given scenario and simply drawing and annotating a diagram will fetch NO MARKS.

There are 4 sites in a distributed system, S1, S2, S3 and S4. Currently S1 possesses the idle token. The contents of the RN arrays of S1, S2, S3 and S4 are respectively as follows - RN₁ = [2 0 0 0], RN2 = [2 0 0 0], RN3 = [2 0 0 0], RN4 = [2 0 0 0]. The contents of the token array LN is LN = [2 0 0 0]. The queue Q is currently empty. Now, S3 wants to enter CS. S3 enters CS and while S3 is executing CS, S4 wants to enter CS. Apply the Suzuki-Kasami's broadcast algorithm and describe the steps using which S3 and S4 send REQUEST messages, how the contents of the RN and LN arrays as well as the queue Q are changed, the token is dispatched to the requesting sites, the requesting sites enter CS and after finishing execution exit the CS. Note that you have to write the steps of the algorithm as applicable to the given scenario and simply drawing and annotating a diagram will fetch NO MARKS.

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

Round-Robin (RR): Write a Java program to implement a Round-Robin (RR) scheduling algorithm with quantum q that will be entered by user. Your program should first prompts the user to input a list of process ID, arrival time, and burst time (in ms) for each process to be run on the CPU. The list is terminated by 0 0 0 for the process ID, arrival time, and burst time. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the RR scheduling algorithm. Also print the turnaround, response, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
Write a device driver for a character device which implements a simple way of message passing. The kernel maintains a list of messages. To limit memory usage, we impose a limit of 4KB = 4*1024 bytes for each message and also impose a limit of the total number of messages stored in the kernel, which is 1000. Your device driver should perform the following operations: * When the module is loaded, the device is created. An empty list of messages is created as well. * Removing the module deallocates all messages, removes the list of messages and removes the device. * Reading from the device returns one message, and removes this message from the kernel list. If the list of messages is empty, the reader returns -EAGAIN. * Writing to the device stores the message in kernel space and adds it to the list if the message is below the maximum size, and the limit of the number of all messages stored in the kernel wouldn't be surpassed with this message. If the message is too big, -EINVAL is…
2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered…
Asap
Write a script using PHP that takes a link from the user and parses through its associated web page to print a list of every link embedded on that site. This program must work recursively, so for each link that gets printed, the program should automatically take each of those links as a new input and do the same for them until there are no more links left. If the same link exists twice on the same page, or if it exists on more than one page, the program should ignore all duplicate instances of the link.
Sudoku is a popular logic puzzle that uses a 9 by 9 array of squares that are organized into 3 by 3 subarrays. The puzzle solver must fill in the squares with the digits 1 to 9 such that no digit is repeated in any row, any column, or any of the nine 3 by 3 subgroups of squares. Initially, some squares are filled in already and cannot be changed. For example, the following might be a starting configuration for a Sudoku puzzle: Create a class SudokuPuzzle.java Download SudokuPuzzle.java that has the attributes • board—a 9 by 9 array of integers that represents the current state of the puzzle, where 0 indicates a blank square • start—a 9 by 9 array of boolean values that indicates which squares in board are given values that cannot be changed and the following methods: • SudokuPuzzle—a constructor that creates an empty puzzle • toString—returns a string representation of the puzzle that can be printed • addInitial(row, col, value)—sets the given square to the given value as an…
Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int…
Encryption methods, such as the Caesar Cipher encryption, allow us to encrypt and decrypt text using a special key. Another method of encrypting text / passwords is called hashing. Hashing uses special algorithms to 'scramble' the text, which is tougher to be hacked. The hash function can take numbers, letters, and symbols as input, then the function applies one of the special algorithms to output the scrambled text. The longer the output string is, the harder to hack the hashed data. The difference between hashing and the Caesar Cipher encryption is that one cannot 'decrypt' a hashed data to its original text. Since a hashed data cannot be decrypted, a user must enter the original text, which will be hashed by the program. Then the program compares the hashed value with the hashed data stored previously for the original text. A salt is used, at times, to create a random sequence that is added to the original text before using the hashing algorithm. This can help prevent the Brute…
Shortest-Remaining-Time-First (Preemptive SJF): Write a Java program to implement a Shortest-Remaining-Time-First (Preemptive SJF) scheduling algorithm. Your program should first prompts the user to input a list of process ID, arrival time, and burst time (in ms) for each process to be run on the CPU. The list is terminated by 0 0 0 for the process ID, arrival time, and burst time. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the RR scheduling algorithm. Also print the turnaround, response, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
Abstract: the main purpose of this experiment is build real time system using PPI 8255 to control devices connected to. Problem description: assume that there are two devices are connected to port A and two sensors are connected to port B of PPI 8255. They work according to the following table Devices (DID2) 01 10 Sensors (S1S2) 00 01 10 11 11 00 Write a program to control these two devices according to the values of sensors. Each group should submit a zip file which contains the following files Code file: (assembly language code) - Simulation file Report (pdf file) (details of every single step in the code, also what have you learned from this experiment)
To solve the problem of mismatch between the speeds of computer and printer, we usually use a buffer. Computer writes data to the buffer, and then printers get data from buffer. Which data structure could be used to implement the buffer? (A) Stack (B) Queue
1- True or False : Switching time should be high for faster execution. 2-What is the protocol that used to solve the priority inversion problem.