the size of a finite buffer be 10 messages and variable N representing the number of messages currently available in the buffer i) how many semaphores are needed to execute multiple procedures and consumers concurrently and explain why? ii) if N=5 what will happen to a consumer upon a semawait() call iii) if N=10 what will happen to a consumer upon a semawait() call iv) if N=0 will you allow the consumer to access the buffer? What will

the size of a finite buffer be 10 messages and variable N representing the number of messages currently available in the buffer i) how many semaphores are needed to execute multiple procedures and consumers concurrently and explain why? ii) if N=5 what will happen to a consumer upon a semawait() call iii) if N=10 what will happen to a consumer upon a semawait() call iv) if N=0 will you allow the consumer to access the buffer? What will

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

Consider the schedule below. Here, R(*) and W(*) stand for 'Read' and Write’, respectively. T1, T2, T3, T4 and T5 represent five transactions and ti represents a time slot. ti t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 t12 t13 t14 t15 t16 ti17 t18 T1 R(A) R(B) W(A) W(B) T2 R(C) W(C) T3 R(B) R(C) W(B) W(C) T4 R(D) W(D) R(A) W(A) T5 R(C) R(A) W(C) W(A) Each transaction begins at the time slot of its first Read and commits right after its last Write (same time slot). Regarding the following questions, give and justify your answers. 1) Assume a checkpoint is made between ts and t6, what should be done to the five transactions when the crash happens between t15 and t16. 2) Is the transaction schedule conflict serializable? Give the precedence graph to justify your answer.
For the script below, answer the following questions: Line 1 a = [12 17 -45 53 47]; Line 2 N=5 Line 3 for m=1:N if ( m==1 ) disp (a (m) ) elseif ( (m==3) | (m>=4) ) disp ( a (m-1) ) Line 4 Line 5 Line 6 Line 7 Line 8 else Line 9 disp ( a (3)) Line 10 end Line 11 end a) What does the semicolon at the end of Line 1 do? b) Explain what Line 4 does c) Write the outputs from the code in the table below (The code may not have 9 outputs) Output 1 Output 2 Output 3 |Output 4 Output 5 Output 6 Output 7 Output 8 Output 9
The CSM Tech organization has a substantial web presence with several publicly accessible web and application servers. You have DNS servers that handle Internet queries for all your publicly accessible resources. However, after doing some statistical analysis on your public DNS servers, you find that your servers are handling recursive lookups for clients that are not within your organization. Your public DNS servers should handle recursive queries only for your internal clients, but the servers should handle iterative (nonrecursive) queries from external sources. What do you recommend? What are the commands needed to implement the solution?
When there is a stalemate, those processes should be terminated, with the following results:
Based on the inference rules, the following statement is if ssn -> ename and ssn->address, then ssn -> {ename, address} True False
The CSM Tech organization has a substantial web presence with several publicly accessible web and application servers. You have DNS servers that handle Internet queries for all your publicly accessible resources. However, after doing some statistics analysis on your public DNS servers, you find that your servers are handling recursive lookups for clients that are not within your organization. Your public DNS servers should handle recursive queries only for your internal clients, but the servers should handle iterative (nonrecursive) queries from external sources. What do you recommend? What are the commands needed to implement the solution?
Q3: Find the best path through trellis diagram shown below that is closet to the received data sequence 11 01 10 00 LEGEND States States TRELLIS DIAGRAM States L00 010- 10 10 11 131 Time Time
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectively
A straightforward technique of avoiding deadlock is to avoid the occurrence of..............
For the following scenario for a point of sale system, draw the following: • A mail order company that distributes CDs and tapes at discount prices to record club members (tells the purpose of the system). • When an order processing clerk receives an order form, she verifies that the sender is a club member by checking the MEMBER FILE. If the sender is not a member, the clerk returns the order along with a membership application form. • If the customer is a member, the clerk verifies the order item data by checking the ITEM FILE. Then the clerk enters the order data and saves it to the DAILY ORDERS FILE. • At the same time, the clerk also prints an invoice and shipping list for each order, which are forwarded to the ORDER FULFILLMENT DEPARTMENT for processing there. Answer:
A large retail company keeps sales data local to the individual branches where sales transactions were performed. To compute overall sales statistics, the company wants to avoid sending the full sales data set to a central server. Instead, only aggregated sales information (sum, average, minimum, variance, median, maximum) is sent from each branch to the central site. Which of the following statements are correct? a) The overall sum can be derived from the sums per branch. b) The overall average can be derived from the averages per branch. c) The overall minimum can be derived from the minimums per branch. d) The overall variance can be derived from the variances per branch. e) The overall median can be derived from the medians per branch. f) The overall maximum can be derived from the maximums per branch.
Given that you have submitted many requests to a server, each with its own id (or unique identification) and priority (or priority).Requests = [(id1, p1), (id2, p2), ……, (idn, pn)], where p1 > p2 > …. > pn. Provide the best algorithm or pseudocode for dealing with all of the requests.