MCA IGNOU

Pages (1) : [1]





CS -12 Computer Architecture Dec-2004

Question Paper of CS -12 Computer Architecture Dec-2004

Q.I (a) What is mean by inclusion, coherence, and locality in a memory hierarchy? Explain through diagram and examples.

Q.I (b) What is meant by superscalar processor? Explain the concept of pipelining in superscalar processors with diagram. :

Q.I © Shnv the pipelined execution of successive instructions in two unierpipelined cases and explain each case.

Q-l (d) Derive the speedup execution for S(m, 1) to compare the relative performance of a superscalar processor with that of a scalar base machine with the following assumptions:
(i) Kpipeline stage
(ii) N no. of independent instructions through the pipeline.
(iii) m where m is the missing processor.
Also explain every stageof the derivation.

Q.I (e) What is the purpose of prefetch buffers in instruction pipelining? Discuss various kinds of buffers used.

Q.2 Describe the following in the context of system interconnection architecture, with appropriate diagrams:
(i) Ring and Chorda I Ring

Q.2 (ii) Hypercube

Q.2 (iii) Multistage Networks

Pages: 1 2 3 4 5

CS -12 Computer Architecture June-2004

Question Paper of CS -12 Computer Architecture June-2004

Q.I (a) Analyze the data depedendes among the following statements in a given program fragment:

S1,: Load R,, M(242) / R, r - M(242) /
S2: Load R,, M(240) / R, r- M(240) /
S3;MULTY R3,R1,R2/R3?(R1)x (R2) /
S4: ADDR…R1, R3/R1-(R1)x (R3) /
Ss: STORE M(240), R/M(248)?(R2) /

Draw a dependency graph to show all the three types of dependencies and explain them.

Q.I (b) Consider the main memory of a computer which has 128 blocks, where the size of each block is 16 words. The cache memory has 16-block-frames.
Sketch the fully associative mapping scheme. Also design the address format showing a tag field, block number and word number.

Q.I © What is a hot spot problem? Why does it occur?

Q.I (d) What is the cache coherence problem? Descrive two protocol approaches, with the help of a suitable diagram.

Q.I (e) Explain the applicability and restrictions involved in using Amdahl’s law to estimate the speed-up performance of n processor systems compared with that of a single processor.

Q-I (f) Show the pipelined execution of successive instructions in two underpipclined cases, and explain each case.

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture Dec-2003

Question Paper of CS -12 Computer Architecture Dec-2003

Q.I (a) Analyze the data dependence among the following statements in a given program fragment

Load R1, M (100) /R1, { - M (100)/
Load R2, M (104) /!R2 { - M(104)/
Multi R1, R2 /R1? (r1)* (R2)/
INCR, /R1,?(R1)+1/
Store M (110), R, /M (11) < -(R1,)/

Also

i. Draw a dependence graph to show all the dependence.

ii. Are there any resource dependences if only one copy of each functional unit is a available in the CPU?

Ql(b) What makes the design of pipeline processors challenging? What are exception conditions? Briefly discuss the procedure to be followed when exceptions occur. What are the other issues which complicate the problem?

Ql© Discuss the following terms in the context of the performance of a memory heirarchy:
i) Hit ratio
ii) Memory hierarchy optimization subject to a cost constraint.

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture June-2003

Question Paper of CS -12 Computer Architecture June-2003

Q.1(i) The SPARC architecture can be implemented with two to eight registe windows, for a total 40 to 132 General Purpose Registers in the intege unit. Explain how general purpose Registers (GPRs) are organized ini overlapping windows in each of the following designs:
a) Use 40 GPRs to construct two windows.
b) Use 72 G PRs to construct 4 windows.
c) In what sense is the SPARC considered a scalable architecture?

Q 1 (ii) Answer the following questions:
a) Plot the graph showing the speed-up factor and optimal numbers of pipeline stages for a linear pipeline unit. What ae the pros & cons?
b) What are the differences between string reduction and graph reduction
machines?
c) What are the problems encountered in scaling up a computer to massively parallel systems?
d) What are the cahracteristics of CISC and RISC architectures?

Pages: 1 2 3 4 5 6

CS-12 Computer Architecture Dec-2002

Question Paper of CS-12 Computer Architecture Dec-2002

Ql(i) The SPARC architecture can be implemented with two to eight register windows for a total of 40 to 130 GPRs (General Purposed Registers) in the integer unit. Explain how the following designs.
(a) Use 10 GPRs to construct two windows.
(b) Use 72 registers (GPRs) to construct four windows.
© In what sense is the SPARC considered a scalable architecture?
(d) Explain how to use the overlapped windows for parameter passing between the calling procedure and the called procedure.

Ql(ii) Answer the following question:
(a) Comment on the advantages in using SIMD computers as compared with the use of pipelined supercomputers for vector processing.
(b) Describe the language features of parallelism.
© Describe the basic metrics affecting the scalability of a computer system for a given application.
(d) Make diagrams of mesh and torus interconnection network and describe its characteristics.

Pages: 1 2 3 4 5 6

CS-12 Computer Architecture June - 2002

Question Paper of CS-12 Computer Architecture June - 2002

Ql(i) Consider the execution of the following code segment.
Use Bernstein’s condition to detect the maximum parallelism embedded in this code. Justify the portion that can be executed is parallel and the remaining portion that must be executed sequentially.

S1,:A = B + C
S2,: C = D + E
S3:F = G + E
S4: C = A + F
S5: M - G + G
S6:A = L + C
S7: A = E+A

(ii) Draw a dependence graph to show all the dependences for the above code segment.
(iii) Answer the following questions:

(a) Distinguish between single threaded and multithreaded processor architecture.
(b) What difficulties will arise when a computer is scaled to become a-massively-parallel processing (MPP) system.
© Explain the differences between super scalar and very large instruction word (VLIW) architectures in terms of hardware and s/w requirements.
(d) Describe the advantages and shortcomings of daisy chaining scheme for bus arbitration in a multiprocessor system.
(e) Plot the graph showing the speedup factors and optimal number of pipeline stages for a linear pipeline unit. What are the pros and cons?

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture Dec -2001

Question Paper of CS -12 Computer Architecture Dec -2001

Q.I (i) What are the design parameters for pipeline processors? Discuss them briefly with examples.
(ii) Discuss the structure of super scalar pipelines and the factors causing pipeline stalling.
(iii) Consider the execution of an object code with 2,00,000 instructions on a 40 MHz processor. The program consists of four major types of instructions. The instruction mix and the number of cycles (CPI) needed for each instruction type are given below based on the result of a program
trace experiment:

Instruction type CPI Instruction Mix

Arithmetic and logic 1 60%
Load/store with cache hit 2 18%
Branch 4 12%
Memory reference with 8 10%
cache misses

(a) Calculate the average CPI when the program is executed on a uni processor with the above trace results.
(b) Calculate the corresponding MIPS rate based on the CPI obtained in part (a).
(iv) What is the architectural distinction between RISC and CISC processors? Explain the concept of overlapping register windows in the SPARC architecture diagrammatically.

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture June -2001

h1>Question Paper of CS -12 Computer Architecture June -2001

Q.I (i) Consider a cache (M(1) and memory (M2) hierarchy with the following characteristics: M1,: 16 K words, 50 ns access time
M2: 1 M words, 400 ns access time
Assume 8 words cache blocks and a set size of 256 words with set associative mapping.
(a) Show the mapping between M2 and M1,.

(b) Calculate the effective memory access time with a cache hit ratio of h = 0.95.

a) Number of Blocks per set
256 /8 =32 blocks
Cache has
16k /256= 214 / 28
= 26
= 64 sets

No. of Blocks in memory
=1MB/8
_ 1024x1024 / 8

__1048576 / 8

= 131072

Image no.1

b)Teff = h1.t1.+(1-h)t2
= .95t1,=(l-.95)t2
=.95x50+ .05x400
= 47.5+20
= 67.5 n.sec.

(ii) Answer the following questions with reference to processors and memory hierarchy: (a) Explain the relationship between the integer unit and the floating point unit in most RISC processors with scalar or Superscalar organization.
(b) Explain the difference between superscalar and VL1W architectures in terms of H/W and SAW requirements-
© What are the design tradeoffs between a large register file and a large D-cache?
(iii) Define five important characteristics of parallel algorithms, which are machine implemental.

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture Jan -2001

Question Paper of CS -12 Computer Architecture Jan -2001

Q.I (i) The execution times (in seconds) of four programs on three computers are given below:
Execution Time (in seconds)

Program ComputerA ComputerB Computer C

P1 1 10 20
P2 1000 100 40
P3 500 1000 50
P4 100 500 100

Assume that 100,000,000 instructions were executed in each of the four programs. Calculate the MIPS rating of each program on each of the three machines. Based on these ratings. Can you draw a clear conclusion regarding the relative performance of the three computers?

(ii) Answer the following questions:
(a) What causes a processor pipeline to be under pipelined?
(b) What are the factors limiting the degree of superscalar design?
© Compare the instruction set architecture in RISC and CISC processors in terms of instruction formats and addressing modes.
(d) Factors affecting cache hit ratio.

Pages: 1 2 3 4 5 6

CS-12 Computer ArchitectureDec-2000

Question Paper of CS-12 Computer ArchitectureDec-2000

Q.I (i) Consider a catch (M1,) and memory (M2:) hierarchy with the following characteristics: M1: 16 K words, 50 ns access time
M2: 1 M words, 400 ns access time

Assume eight word cache blocks and a set size of 256 word with set-associative mapping

Show the mapping between M2 and M1.
Calculate the effective memory access time with a catch bit ratio of h = 0.95.
(ii) What causes a processor pipeline to be underpipelined?
(iii) What is meant by a hierarchical bus system for multiprocessing system?

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture June -2000

Question Paper of CS -12 Computer Architecture June -2000

Q.I A low level memory system has eight virtual pages on a disk to be mapped into 4 page frames in the main memory. A certain program generated the following page trace:

1,0,2,2,1,7,6,7,0,1,2,0,3,0

(a) Show the successive virtual pages residing in the 4 page frames with respect to above page trace using the LRU replacement policy. Compute the hit ratio in the main memory. Assume the page frames are initially empty.

(b) Repeat part (a) for the circular FIFO page replacement policy.

© In the following program, all 5 instructions are to be executed in minimum time. Assume that all are integer operands already loaded with working registers. No memory reference is needed for the operand fetch operation. Also all intermediate or final results are written back to working registers without conflicts.

P1, : X< -(A+B) * (A-B)
P2: Y<-(C+D) * (C-D)
P3} : Z<-X+Y
P4: A<-ExF
Ps: B<-(X-F) * A

(i) Use the minimum number of working registers to rewrite the above program using plus, minus, multiplication and divide exclusively. Assume a fixed instruction format with 3 register field: two for sources and one for destination.

(ii) Perform a flow analysis of the assembly language obtained in part(i) to reveal all data dependence with a data dependence graph.

Pages: 1 2 3 4 5 6

CS -12 Computer Architecture Dec -1999

Question Paper of CS -12 Computer Architecture Dec -1999

Q.I (i) Draw a table showing performance factors versus system attributes and explain them.
(ii) A 50 MHz processor was used to execute a benchmark program with the following instruction and clock cycles counts.
Instruction type Instruction count Clock cycles count.
Integer Arithmetic 45000 1
Data transfer 32000 2
Floating point 15000 2
Control transfer 8000 2

Determine the effective CPI, MIPS rate and execution time for this program.

(iii) What cause a processor pipeline to be underpipelined?
(iv) What are the factors limiting the degree of superscalar design?
(v) Illustrate a diagram showing asynchronous bus timing using a four edge handshaking (interlocking) with variable length signals for different speed devices.

Pages: 1 2 3 4 5 6



Courses Offered by IGNOU

School of Computer and Information Sciences (SOCIS)
Master of Computer Applications (MCA)
Bachelor of Computer Applications (BCA)
Bachelor of Information Technology (BIT)
Advanced Diploma in Information Technology (ADIT)
Certificate in Computing (CIC)

School of Humanities
M.A.English (MEG)
M.A.Hindi (MHD)
BA English
BA Hindi
Postgraduate Diploma in Radio Prasran (PGDRP)
Postgraduate Diploma in Translation (PGDT)
Diploma in Creative Writing in English (DCE)
Postgraduate Certificate in Television Writing (PGCTW)
Postgraduate Certificate in Copyediting and Proofreading (PGCCP)
Certificate in the Teaching of English (CTE)

School of Education
Doctor of Philosophy (Ph.D.) (Phase-I)
Post Graduate Diploma in Higher Education (PGDHE)
Bachelor of Education (B.Ed)
Diploma in Primary Education (DPE)
CIG
Certificate in Primary Education (CPE)
Master of Arts (Education)
Post Graduate Diploma in Educational Technology (PGDET)
Post Graduate Diploma in School Leadership and Management (PGDSLM)

School of Continuing Education
Bachelor in Social Work (BSW)
Postgraduate Diploma in Rural Development (PGDRD)
Diploma in HIV & Family Education (DAFE)
Certificate in HIV & Family Education (CAFÉ)
Certificate Programme in Rural Development (CRD)
Elective in Rural Development
Diploma in Nutrition and Health Education (DNHE)
Diploma in Early Childhood Care and Education (DECE)
Certificate in Food and Nutrition (CFN)
Certificate Programme in Nutrition and Childcare (CNCC)
Application Oriented Courses for BDP
Postgraduate Diploma in Journalism and Mass Communication (PGDJMC)
Post Graduate Diploma in Audio Programme Production (PGDAPP)
Certificate in Food Safety (CFS)
M.A. in Rural Development, M.A.(RD)
Master's of Science Degree in Dietetics and Food Service Management {MSc. (DFSM) }
Application Oriented Courses for BDP

School of Health Sciences
Post Basic Bachelor of Sciences in Nursing
Post Graduate Diploma in Maternal & Child Health
Post Graduate Diploma in Hospital and Health Management
Post Graduate Certificate in Rural Surgery
Post Graduate Diploma in Geriatric Medicine
Certificate in Health and Environment
Certificate in Health Care Waste Management
Post Graduate Diploma in Community Cardiology

School of Sciences
Bachelor of Science (B.Sc.) Programme
Certficate Programme Teaching of Primary School Mathematics (CTPM)
Certificate Programme in Laboratory Techniques (CPLT)
Post Graduate Diploma in Intellectal Property Rights (PGDIPR)
Post Graduate Diploma in Environment and Sustainable Devlopment
Appreciation Course On Environment
Awareness Course On Intellectual Property Rights
Programme Under Development


Other Resources