give ans with explaination of algorithm. Site S, executes the following three steps to invoke mutual exclusion:Step 1: (Request Critical Section)Requesting = true;C₁ = C₁ + 1;Send REQUEST(C,, i) message to all sites in R₁;Wait until R₂ = 0);Requesting false;Step 2: (Execute Critical Section)Executing = true;Execute CS;Executing false;Step 3: (Release Critical Section)/* Wait until all sites in R, have sent a reply to S, */For every site S in I, (except S.) doBeginEndI= I₁ - {Sk};Send REPLY(C₁, i) message to Sk;R₁= R₁ + (Sk)

execution of given steps to invoke mutual exclusive is in next step:

Site S, executes the following three steps to invoke mutual exclusion: Step 1: (Request Critical Section) Requesting = true; C₁ = C₁ + 1; Send REQUEST(C₁, i) message to all sites in R;; Wait until R, = 0); Requesting = false; Step 2: (Execute Critical Section) Executing = true; Execute CS; Executing = false; Step 3: (Release Critical Section) /* Wait until all sites in R, have sent a reply to S, */ For every site S in I, (except S₁) do Begin End I₁= I₁ - {Sk}; Send REPLY(C,, i) message to Sk; R= R₁ + (Sk)

Site S, executes the following three steps to invoke mutual exclusion: Step 1: (Request Critical Section) Requesting = true; C₁ = C₁ + 1; Send REQUEST(C₁, i) message to all sites in R;; Wait until R, = 0); Requesting = false; Step 2: (Execute Critical Section) Executing = true; Execute CS; Executing = false; Step 3: (Release Critical Section) /* Wait until all sites in R, have sent a reply to S, */ For every site S in I, (except S₁) do Begin End I₁= I₁ - {Sk}; Send REPLY(C,, i) message to Sk; R= R₁ + (Sk)

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

Suppose Alice has r and w rights over the file book. Alice wants to copy r rights to book to Bob. a.Assuming there is a copy right c, write a command to do this. b.Now assume the system supports a copy flag; for example, the right r with the copy flag would be written as rc. In this case, write a command to do the copy. c.In the previous part, what happens if the copy flag is not copied? Note:Follow the concept of access control matrix and do not use commands like chmod.
PLEASE FILL OUT CHART Shared session key establishment using a Key Distribution Center (KDC). Using the following table, illustrate how Alice can initiate a secure session with Bob with the help of KDC. Here, KEKs are the long term key establishment keys used to transport the session keys across the network securely. Assume the encryption process to be as follows: Block (LB || RB) is 8 bits; Encryption Key (LK||RK) is 8 bits; Ciphertext = LC|| RC where LC=LB ⊕ RK; and RC=RB ⊕ LK; For example, if plaintext=A7 (Hexa) and Key = 6D; then LC=A ⊕ D = 1010 ⊕ 1101 = 0111 = 7 (Hexa); and RC = 7 ⊕ 6 = 0111 ⊕ 0110 = 0001 = 1 (Hexa); so Ciphertext = 71 (Hexa). To decrypt, it does the reverse operation: Given ciphertext of C=LC||RC, it finds plaintext B=LB||RB, by finding LB=LC ⊕ RK and RB = RC ⊕ LK. Alice KDC Bob KEK: kA = A6 (hexa) KEK: kA = A6 (hexa); kB = D8(hexa); KEK: kB = D8 (hexa); Alice sends a message to KDC requesting a session key between Alice and Bob…
Step 1 Intro Cipher block chaining mode in DES (Date Encryption Standard): It is a type of cipher mode where all the cipher blocks are chained to avoid the replacement of blocks. In this model, all the blocks are chained before encryption; the plaintext in a block is XOR (Exclusive OR) with a cipher text of the previous bloc. Here, the key advantage is that the output present in the cipher text block is not the same as the plaintext block. arrow_forward Step 2 Solution: Cipher feedback mode in DES (Data Encryption Standard): This type of mode is used to encrypt the data by byte-to-byte. It is similar to the cipher block chaining mode, if the encryption process in cipher block chaining is reversed, it is the decryption process of Cipher feedback mode. During the encryption process, one byte is encrypted first and sent out. Then the encryption process is carried out with the next byte. Conclusion: The output stream generated by the encryption process in cipher…
Consider a server that has 20 users, each of which has 50 files in their home directory. Each user should have read and write access to every file in their own home directory. a.If this policy were expressed as a DAC matrix, how many non-empty entries (cells) would the matrix need to have? b. Express this policy as a single if-then sentence, such as might be used in an Attribute-based Access Control (ABAC) system. The sentence should be English, but imagine that it could be translated into a logical constraint.
Q9B- Context- Alice and Bob are members of the same Kerberos realm. They are both currently logged in with active session keys from the Kerberos KDC (key distribution centre). As per the Kerberos standard, the KDC has created unique session keys for both Alice and Bob, and then discarded them once received by the respective users. Alice wants to access a resource owned by Bob and contacts the KDC to request the necessary material. Answer the following questions about this scenario: Q- How can the KDC verify Alice’s identity after discarding her session key?
Two-phase commit assures that all sites agree as to whether a given transaction T commits or aborts. Suppose there are 3 sites. Transaction coordination C1 sends out the message Prepare T, which is received by both C2 and C3. Then C2 and C3 respond with Ready T to C1. Due to some reason, only C2 has the Commit T log record in its stable storage. List all 2PC-related log records on the 3 sites regarding transaction T
For each page replacement policy, what is the total number of page faults occurring for policies OPT, LRU and FIFO. ? Per book, page fault occurring after the frame allocation is initially filled. Resident set size is 3. Time horizon : 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4Page references : 5 4 7 2 4 5 4 1 5 2 5 3 5 2 3 Note: The first page fault occurs at time horizon 3 and involves page 2. We just need one number per policy. OPT algorithm; number of page faults is chpoose correct answer please, 1,2,3,4,5,6,7 LRU algorithm; number of page faults is chpoose correct answer please, 1,2,3,4,5,6,7 FIFO algorithm; number of page faults is chpoose correct answer please, 1,2,3,4,5,6,7
In MS Access, to ensure that a grade must be either A, B, C, D or F, whichvalidation rule should be used?A) ="A" or ="B" or ="C" or ="D" or ="F"B) between A and FC) like "A", "B", "C", "D", "F"D) not in ("A" or "B" or "C" or "D" or "F")E) in ("A", "B", "C", "D", "F")
Two-phase commit assures that all sites agree as to whether a given transaction T commits or aborts.Suppose there are 3 sites. Transaction coordination C1 sends out the message Prepare T, which isreceived by both C2 and C3. Then C2 and C3 respond with Ready T to C1. Due to some reason, onlyC2 has the Commit T log record in its stable storage. Suppose C1 crashes right after the necessary log records from 2are written to stable storage. During recovery, C1 needs to take some actions. List the additional logrecords on C2 and C3, and explain the fate of the transaction T.
q9c- Context- Alice and Bob are members of the same Kerberos realm. They are both currently logged in with active session keys from the Kerberos KDC (key distribution centre). As per the Kerberos standard, the KDC has created unique session keys for both Alice and Bob, and then discarded them once received by the respective users. Alice wants to access a resource owned by Bob and contacts the KDC to request the necessary material. Answer the following questions about this scenario: Q- When Bob receives the service ticket from Alice, why should he trust her and what guarantees the service ticket is genuine and wasn’t forged by Alice?
2. Two-phase commit assures that all sites agree as to whether a given transaction T commits or aborts.Suppose there are 3 sites. Transaction coordination C1 sends out the message Prepare T, which isreceived by both C2 and C3. Then C2 and C3 respond with Ready T to C1. Due to some reason, onlyC2 has the Commit T log record in its stable storage. List all 2PC-related log records on the 3 sitesregarding transaction T.3. Continuing the example of question 2, what’s a possible reason that only one ready T has reached C1?
10. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti ). This is a. Wait-die b. Wait-wound c. Wound-wait d. Wait