31. Short-term scheduling (CPU scheduler) selects from among the processes that are ready to execute and allocates the CPU to one of them. Answer: T F 32. The algorithm of SCAN may cause starvation when schedule the servicing of disk I/O requests. Answer: F 33. If a resource-allocation graph does not have a cycle, while the system also may be in a deadlocked state. Answer: F 34. The mount protocol establishes the initial logical connection between a server and a client. Answer: T F 35. Virtual Memory involves the separation of logical memory as perceived by users from physical memory. T F Answer:

31. Short-term scheduling (CPU scheduler) selects from among the processes that are ready to execute and allocates the CPU to one of them. Answer: T F 32. The algorithm of SCAN may cause starvation when schedule the servicing of disk I/O requests. Answer: F 33. If a resource-allocation graph does not have a cycle, while the system also may be in a deadlocked state. Answer: F 34. The mount protocol establishes the initial logical connection between a server and a client. Answer: T F 35. Virtual Memory involves the separation of logical memory as perceived by users from physical memory. T F Answer:

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 5VE

See similar textbooks

Similar questions

Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
20. . can be prevented by ....... ..... ... Deadlock / Busy waitingk 1 Deadlock / Bounded buffer Starvation / Indefinite blocking Starvation / Priority inversion
Massages exchange between managers is possible in: A) SNMPv2 only B) SNMPv1 & SNMPv2 C) SNMPv2 & SNMPv3 D) SNMPv1 only
n indirect message passing model of IPC, a mailbox can be held in the process address space (or in the kernel). Similarly, in shared-memory model, a shared-memory region resides in the address space of the process. Considering both the facts (that both use process address space), what’s the difference between the indirect message passing and shared memory models?
a. Figure Q3(a) below shows a simplified DPA of a Virtual MP list the FIVE components numbered from (1) till (5). Ins Queue Men Datce bus nternal bus EECE 2314
Suppose a processor sends 40 disk I/Os per second, these requests are exponentially distributed, and the average service time of an older disk is 20 ms. Answer the following questions: a. On average, how utilized is the disk? b. What is the average time spent in the queue? c. What is the average response time for a disk request, including the queuing time and disk service time?
Define active partition
What is the cause of multipathing?
ts Ana sayfa Dersler Gruplar Takvim BAU J1oddng BAUGO BAU Library CMP3001 (1,2) Operating Sys... Genel bakış Planlar Kaynaklar Durum ve izleme Katılımcılar Midterm Soru 1 Round Robin CPU Scheduling can be implemented to include priorty for the processes. Yanıtınız: True False Yanıtı temizle Gönder
A Pregel worker: a) Contacts the master for a set of vertices that have not yet been processed in a given superstep and calls the Compute() method on each vertex. b) Is responsible for a single vertex of a graph, calling the Compute() method on that vertex if it is active. c) Is allocated a single partition and runs a thread for each vertex of a graph that loops calling a Compute() method as long as the vertex is active. d) Runs a thread for each partition of a graph, with each thread calling a Compute() method as it iterates through each active vertex.
Computer Science 9. In a paging system , the logical address is formed of 20 bits. the most significant 8 bits denote the page number, the least significant 12 bits denote the offset. Memory size is 256K bits. a. What is the page size (in bits)? b. What is the maximum number of pages per process? c. How many frames does this system have? d . Give the structure of the page table of a process executing in this system. Assume 2 bits are reserved for attributes. e. How many bits are required for each page table entry? f. If physical memory is upgraded to 1024 K bits, how will your answer to c and e change?
I/O bound program and CPU bound program need to be differentiated by a scheduler. Why?b. Assuming 101 processes are in the queue and 5 millisecond is for every process. What type of algorithm is related to this situation? How long will a process wait at a time? If a process is to be completed in 10 millisecond. Calculate its turn-around time?