addition to the cost of the communication, the packing and unpacking is very                            .

Related MCQs

• Each node of the tree has an                              , that is, the cost of the partial tour.
• could possibly lead to a least-cost solution.
• Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a                .
• A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
• Parallel programs: Which speedup could be achieved according to Amdahl´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?
• A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is                   
• Here, w1 and w2 have shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?
• them in this case and returning the result to a single process.
• user program and buffersize is its size in bytes.
• takes the data in data to be packed and packs it into