Cooperating Processes: Select all of the following statements that are true. The bounded buffer solution to the producer-consumer problem discussed in class allows at most BUFFERSIZE-1 items in the buffer at the same time. Ordinary (unnamed) pipes provide a solution for unidirectional communication between related processes. A process is not able to create a pipe to itself. A solution for inter-process communication always relies on approaches for message passing. A process is cooperating if it can affect or be affected by the other processes executing in the system. At the Unix command level, it is possible to use pipes to channel the output of one command into another.

In a printing queue, there are a few documents that are still waiting to be printed. To get the documents running, the person in charge of printing executes a series of random activities. Which type of scheduling is best for the aforementioned circumstance, and why?

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.

3. I/O Management: Disk Arm Scheduling & RAIDa. It is known that a disk drive has 256 cylinders, with cylinder numbers starting from 0 and ending at 255. The position of the needle on the disk drive currently stops at 128. It is also known that the needle always “goes to the cylinder with the smaller number first”. The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. From the 3 choices of algorithms below, which one is the best algorithm? Make each image and determine the seektime.i. SCANii. C-SCANiii. FIFO

Multi-tasking can not be achieved with a single processor machine.  True  False       2. Async/Await is best for network bound operations while multi-threading and parallel programming is best for CPU-bound operations.  True  False     3. The following is a characteristic of an async method:The name of an async method, by convention, ends with an "Async" suffix.  True  False   4. Using asynchronous code for network bound operations can speed up the time needed to contact the server and get the data back.  True  False     5. Asynchronous programming has been there for a long time but has tremendously been improved by the simplified approach of async programming in C# 5 through the introduction of:  The Task class  True  False

me remaining: 00:09:34 Computer Science Create a MPI version of the program below that uses a striped decomposition. Each process is responsible for some number of columns of the square and also maintains two columns of ghost cells to mirror the columns on the neighboring processes. The ghost cells are needed in order to update the cells along the process boundary. At each time step, a ghost cell exchange takes place, then the update takes place.   #include <stdlib.h> #include <assert.h> #include "anim.h"   const int n = 200; // number of discrete points including endpoints int nstep = 200000; // number of time steps int wstep = 400; // time between writes to file const double m = 100.0; // initial temperature of rod interior const int h0 = n/2 - 2, h1 = n/2 + 2; // endpoints of heat source const double k = 0.2; // diffusivity constant char * filename = "diff2d.anim"; // name of file to create double ** u, ** u_new; // two copies of the temperature function ANIM_File…

Wireless sensor networks (WSNs) are an example of a network that may facilitate communication. Sensing nodes in WSNS communicate with one another and a central hub. The computing resources and storage space of a sensor node are limited. Think of an algorithm that can be solved by separating it into smaller chunks. To solve these subproblems at separate sensor nodes, would you prefer use divide and conquer or dynamic programming? Please be brief in your writing.

Concurrent Processes / Monitors select which is true options: a CV (condition variable) queues in a monitor store suspended processes waiting on the corresponding condition.      b The "Signal and Wait" approach (Hoare semantics) leads to more efficient implementation and reduces the number of context switches. c Two or more processes can be active in the same monitor simultaneously. d When the "Signal and Continue"-approach (Mesa semantics) is applied, the signaling process P continues executing.  e The monitor-based solution to the Dining-Philosophers problem discussed in class is restricted to 5 philosophers.