CS6801
CS6801
QUESTION BANK
PART – A:
3. What are the factors to increase the operation frequency of the processor?
11. Draw neat diagram for structural model of centralized share-memory multiprocessor.
15. What are the characteristics of the performance due to write update and write invalidate
protocols?
20. Write a mathematical formula for speedup and efficiency of parallel program.
PART – B:
PART – A:
7. Define oversubscription.
PART – B:
3. Explain briefly about data structures plays vital role in part of performance with an example.
10. Write short note on mutexes, semaphore, spin lock and reader-writer locks.
12. Write a short note on signals, events, message queues and names pipes.
PART – A:
8. How to enable consistency between two threads temporary view and memory?
10. What are the ICVs stored values affect loop regions?
11. What are the ICVs stored values affect program execution?
21. How does the run-time system know how many threads to create?
PART –B:
2. Explain briefly about internal control variables and array sections in directives.
3. Describe briefly about parallel construct and canonical loop form in directives.
PART – A:
5. What are the functions in MPI to initiate and terminate a computation, identify processes, and
send and receive message.
12. What are the features of blocking and non-blocking in point-to-point communication?
PART – B:
3. Describe briefly about libraries for groups of processes and virtual topologies.
4. Describe briefly about libraries for attribute caching and context of communication.
PART – A:
7. What is graph?
12. What are the global variables for recursive depth first search?
15. What are the reasons for parameter threads_in_cond_wait used in tree search?
16. What are the modes of message passing interfaces for send and its functions?
17. Brief about my_avail_tour_count fuctions.
PART – B:
5. Explain in detail about recursive and non-recursive depth-first search with example.
7. Explain briefly about tree search with static and dynamic partitioning.