Scribd
Upload
5 views

ASSIGNMENT question

The document outlines a series of advanced computer architecture assignment questions covering topics such as vector supercomputers, pipeline scheduling, data dependence, hazards, parallel algorithms, and cache coherence. It includes specific tasks such as drawing state transition diagrams, determining throughput, and explaining various computer architectures and algorithms. Additionally, it addresses the scheduling and load balancing problems in multi-processor systems and provides a framework for understanding pipeline execution and its associated hazards.

Uploaded by

gixayew714
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
5 views

ASSIGNMENT question

The document outlines a series of advanced computer architecture assignment questions covering topics such as vector supercomputers, pipeline scheduling, data dependence, hazards, parallel algorithms, and cache coherence. It includes specific tasks such as drawing state transition diagrams, determining throughput, and explaining various computer architectures and algorithms. Additionally, it addresses the scheduling and load balancing problems in multi-processor systems and provides a framework for understanding pipeline execution and its associated hazards.

Uploaded by

gixayew714
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
‘ADVANCE COMPUTER ARCHITECTURE ASSIGNMENT QUESTION What are vector supercomputers? Discuss some vector processor models. 2.Consider the following pipeline reservation table. x x x ‘What are the forbidden latencies and the initial collision vector? i) Draw the state transition diagram for scheduling the pipeline. ii List all simple and greedy cycles. il) Determine the optimal constant latency cycle and minimal average latency. iv) Let the pipeline clock period be T = 10ns. Determine the throughput of this pipeline. 3.Explain the differences among UMA, NUMA, COMA and NORMA computers 4.What is data dependence and control dependence? Write the programs which shows these dependency among data. 5. What are data and control hazards? Describe various methods to resolve these hazards 6. Differentiate between synchronized and asynchronised parallel algorithms 7. Write short notes on following. i) Bernstein's condition i) Degree of parallelism ii) Amdaht's law for a fixed Workload iv) Tomasulo's algorithm v).Remote procedure call 9.WWrite a short note on SIMD multiprocessor 10.€xplain Parallel Algorithms for array processors 11, Discuss the scheduling and load balancing problem for a multi-processor system, Give a suitable example with illustrative diagrams. 12.Write a note on interconnection network 13.Explain instruction pipeline 14,What do you mean by cache coherence. 15.write algorithm for associative search 16, Proving that a k stage pipeline can be at most k times faster than that of a nonpipelined one 17.Explain pipeline hazards 18.Explain how occurrence of branch effects the pipeline execution 19. Explain flynn’'s classification 20,Describe handlers classification

You might also like