CS350_Crossword

3. Searching in which elements should be in sorted order.
4. This memory is placed between CPU and Main memory.
6. sender and receiver do not wait for each other while transferring the message.
8. This law is used to compute the speed up of parallel computation.
10. Multiple instructions can be executed on same data.
13. In this computing several computers collaboratively solve a problem.
14. Invalidate and update are protocols about Cache ______________.
16. Special processor for graphics operations.
19. All processors are not same.
20. In this tree network, more connections are used near the root.
21. In this method a process is divided in to several stages.
23. In this computing instructions are concurrently executed.
25. In this coupling method, all processors share a global memory.

1. Data transfer rate.
2. sender and receiver to wait for each other while transferring the message.
5. Every processor can access the memory location with same speed.
7. All processors are same.
9. Delay in reading/writing.
11. Another name of bin sort.
12. It can be a perfect shuffle network.
15. Every processor can access the memory location with different speed.
17. In this class of PRAM,multiple read and write accesses to a common memory location are allowed.
18. This computing is traditional.
22. In this machine instructions are executed parallely.
24. In this coupling method, each processor has its own local memory.