I/O Multiplexing: The idea of I/O multiplexing is to use “select” function to ask kernel to suspend process. It returns control to application only after one or more I/O events had occurred. It denotes waiting for a set of descriptors that is ready for reading. The “select” function would manipulate sets of type “fd_set”, that denotes descriptor sets. It takes two inputs: a descriptor set called “read set” and cardinality of read set. It blocks until at least one descriptor in read set is ready for reading. A descriptor “k” is ready for reading if and only if a request to read 1 byte from that descriptor would not block. The “fd_set” is been modified that points to argument “fdset” to indicate subset of read set called “ready set”. The value returned by function indicates cardinality of ready set.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 12.34HW

Program Plan Intro

I/O Multiplexing:

The idea of I/O multiplexing is to use “select” function to ask kernel to suspend process.

It returns control to application only after one or more I/O events had occurred.

It denotes waiting for a set of descriptors that is ready for reading.

The “select” function would manipulate sets of type “fd_set”, that denotes descriptor sets.

It takes two inputs: a descriptor set called “read set” and cardinality of read set.

It blocks until at least one descriptor in read set is ready for reading.

A descriptor “k” is ready for reading if and only if a request to read 1 byte from that descriptor would not block.

The “fd_set” is been modified that points to argument “fdset” to indicate subset of read set called “ready set”.

The value returned by function indicates cardinality of ready set.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Determine the difference between parallelism and pipelining.

Q: One way to handle parameter conversion in RPC systems is to have each machine send parameters in its native representation, with the other one doing the translation, if need be. The native system could be indicated by a code in the first byte. However, since locating the first byte in the first word is pre- cisely the problem, can this actually work?

Refer to the code below determine whether this code is correct, and if not, correct any mistakes. Find the speedups and efficiencies of the parallel odd-even transposition. Does the program obtain linear speedups? Is it scalable? Is it strongly scalable? Is it weakly scalable? After correcting the mistakes, execute the code in CUDA or OpenMP and measure any performance improvement in terms of speedups and scalability. Process Pi evenprocess =(i%2 ==2); evenphase = 1; for(step =0; step < n; step++,evenphase = !evenphase) { if((evenphase && evenprocess) || (!evenphase && !evenprocess) { send (&a, Pi+1); recv (&x, Pi+1); if (x<a) a =x; } else { recv (&x, Pi-1); send (&a, Pi-1); if (x > a) a = x; } }