0% found this document useful (0 votes)
201 views7 pages

Computer Architecture Concepts and Performance

The document discusses various computer architecture concepts including memory systems, arithmetic and basic processing units, input/output organization, pipelining, and parallel processing. It provides questions related to these topics and asks for explanations of concepts like registers, addressing modes, caches, DRAM organization, arithmetic operations, control units, pipelining, vector and array processors.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
201 views7 pages

Computer Architecture Concepts and Performance

The document discusses various computer architecture concepts including memory systems, arithmetic and basic processing units, input/output organization, pipelining, and parallel processing. It provides questions related to these topics and asks for explanations of concepts like registers, addressing modes, caches, DRAM organization, arithmetic operations, control units, pipelining, vector and array processors.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Model 1

[Link] the help of diagram explain Basic Operational Concepts of computer. Explain the
steps in detail. Or
Draw and explain the connection between memory and processor with the respective register
[Link] to measure the performance of a computer? Explain
Or
What is performance measurement? Explain the overall SPEC rating for the computer in a
program suite
[Link] Big Endian and Little Endian method of byte addressing with proper example
4. What are various factors that affect the performance of the system? A program contains
1000 instructions. Out of that 25% instructions require 4 clock cycles, 40% instructions
require 5 clock cycles and remaining require 3 clock cycles for execution. Find the total time
required to execute the program running in a 1 GHz machine.
6. Define addressing Modes. Explain the types of addressing modes with example.[10 marks]
[Link] R1 and R2 of a computer contain the decimal values 1200 and 4600. What is the
effective address of the memory operand in each of the following instructions? [8 marks]
(i) Load 20[R1],R5
(ii) Move #3000,R5
(iii) Store R5,30[R1,R2]
(iv) Add –(R2),R5
[Link] how the below expression will be executed in one address, two address and three
address processors in an accumulator organization C=A-B [8marks]
[Link] how the below expression will be executed in one address, two address and three
address processors in an accumulator organization C=A-B [8marks]
10. Show how the below expression will be executed in one address, two address and three
address processors in an accumulator organization C=(A*B)+(C*D) [8marks]
[Link] the fallowing (i) Processor clock (ii) Basic performance Equation (iii) Memory
operation
12. Explain the fallowing (i)Register transfer Notation (ii)Assembly language Notation
13. Define and discuss about straight-line sequencing and instruction execution
[Link] the instruction execution for adding ‘n’ numbers using Straight line
sequencing and branching
Model 2-Input/Output Organization
[Link] a program that reads one line from the keyboard, stores it in memory buffer, and
echoes it back to the display in an I/O interface
[Link] the scenario when the interrupts are enabled.
[Link] neat sketches, explain various methods for handling multiple interrupts requests raised
by multiple devices
[Link] is an interrupt? What are interrupt service routines and what are vectored interrupts?
Explain with example
[Link] how the I/O devices should be organized in a priority structures,
[Link] Exception, describe the different kinds of exceptions
[Link] the DMA and its implementation and show how the data is transferred between
memory and I/O devices using DMA controller.

8. What is DMA bus Arbitration? Briefly explain different bus arbitration techniques.

[Link] synchronous Bus and Asynchronous bus with neat timing diagrams.
Module-3-Memory system
1. Explain internal organization of 16 Megabit DRAM chip configured as 2M*8 cells
Also explain how it can be made to work fast in fast page mode.
2. Explain the working of 16-megabyteDRAM chip configured as 1M x 16 memory
chip.
3. Discuss the internal organization of a 1K x 1 memory chip
4. Explain the read and write operations of a static RAM cell and CMOS cell
5. Differentiate between SRAM and DRAM giving 5 key differences.(With a cell
diagram).
6. With a block diagram, explain the organization of 8M x 32 memory using 512 K x 8
memory chips
7. Explain synchronous DRAM with a neat diagram.
8. With figure analyse the memory hierarchy in terms of speed cost and size
9. What is cache? With block diagram explain Direct, Associative and set-associative
mapping between cache and main memory.
10. Briefly explain any four non-volatile memory concepts(ROM, PROM, EPROM,
EEPROM, Flash)

[Link] a neat diagram, explain the internal organization of 16x8 memory chip (10 marks)page
2-3
2. What is cache? With block diagram explain Direct, Associative and set-associative
mapping between cache and main memory. (10 Marks)(pages-16 to 21)
3. Differentiate between SRAM and DRAM giving 5 key differences.(With a cell
diagram).(6 marks)(page no-24)
4. Describe the working of static RAM memories (5 marks)(page4-5)
[Link] the operation of a CMOS memory cell.(6 marks) page4-5)
[Link] a neat figure, explain the organization of a 2Mx32 memory module using 512Kx8 static
memory chip.(8 marks)(page no-8-9)
7. Explain the internal structure of synchronous DRAM with diagram(8 marks)page7-8
8. Analyze how data are written into Read only memories (ROM). Discuss different types of
Read Only Memories (10 marks)page no-11-13
[Link] the working mechanism of asynchronous DRAM(6 marks) page no-5
10. Discuss the internal organization of a 1K x 1 memory chip
11. With a neat figure, explain the internal organization of 2MX8 dynamic memory chip. (8
marks) page-5-6
12. With figure analyse the memory hierarchy in terms of speed cost and size(6 marks)page
13-14)
13. Explain synchronous DRAM with a neat diagram.
14. What is virtual memory? Explain simple method of translating virtual address into
physical address.
15. Define the following:
a. Memory Latency
b. Memory bandwidth
c. Hit rate d. Miss-penalty
Model 4-Airthmetic and basic processing Unit

[Link] the fallowing operation on the 5-bit signed numbers using 2’s complement
representation system:
i. (-10) + (-13)
ii. (-10) - (+4)
iii. (-3)+(-8)
iv. (-10) – (+7)

[Link] -5 from -7 using Two’s complement subtraction.


3. Perform the addition and subtraction of signed number.
i. +4 and -6
ii. -5 and -2
iii. +7 and -3
iv. +2 and +3

4. Explain 4 bit carry-look ahead adder with a neat diagram (10 marks)
Or
In a carry look ahead addition, explain the generate Gi and propagate Pi functions for stage i.
Using this design explain 4 bit carry look ahead adder(10 marks)

[Link] the multiplication of positive numbers +13 and +11 using sequential multiplication
method .(10 marks)

6. Explain sequential multiplication method with a neat diagram.( 8 marks)


Or
Explain sequential multiplication method algorithm. Apply sequential multiplication method
to
[Link] the working of single bus organization of data path. (7 marks)

[Link] the sequence of control steps to execute the instruction Add(R3),R1 on single bus
architecture. (8 marks).

9. Draw and explain multiple bus(three bus) organization.. Explain its advantages (10 marks)

10. write and explain the control sequence for execution of an unconditional branch
instruction.(10 marks)

11. What is the purpose of control unit ? with neat sketches explain the organization of
hardwired control unit in detail (10 marks)
Model 5-Pipeline Processing
[Link] Flynn’s classification in detail?(5 marks)[page no 301]
[Link] pipeline. Explain with example and content of register table in pipeline.[page no-
302,303,304][10 marks]

[Link] certain scientific computations it is necessary to perform the arithmetic operation (Ai+Bi)(
Ci+Di)with a stream of numbers. specify a pipeline configuration to carryout this task. List the
contents of all registers in the pipeline for i=1 through 6.
4. Draw a space-time diagram for a six-segment pipeline showing the time it takes to process
eight tasks.

5. Determine the number of clock cycles that it takes to process 200 tasks in a six-segment
pipeline
6. The non pipeline system takes 50 ns to process a task . the same task can be processed in a
six – segment pipeline with clock cycle of 10ns . Determine the speedup ratio of the pipeline
for 100ns task . what is the maximum speedup that can be achieved?

[Link] arithmetic pipeline with four segments example. [page no 307-309]


[Link] is pipelining? Explain the five stages Instruction pipeline with timing diagram(10
marks)[page no 311
Or
Explain basic idea of instruction pipelining(10 marks)
Or
What is pipelining? Explain the 4 stages pipeline with its Instruction execution steps and
hardware organization(10 marks)
[Link] pipeline for calculating an inner product in vector processing.
9. With diagram, Explain attached array processor with host computer.
[Link] SIMD array processor organization with a neat diagram.
11. differentiate b/w vector processing and array processors.

Common questions

Powered by AI

Flynn's taxonomy classifies parallel computing architectures based on data streams and instruction streams processed concurrently into four categories: SISD (Single Instruction stream, Single Data stream), SIMD (Single Instruction stream, Multiple Data streams), MISD (Multiple Instruction streams, Single Data stream), and MIMD (Multiple Instruction streams, Multiple Data streams). These classifications help in understanding the structural design of computer architectures; for instance, SIMD is used in vector processing where a single instruction operates on multiple data points, while MIMD supports multiprocessor systems applying different instructions on different data streams concurrently .

SRAM (Static RAM) and DRAM (Dynamic RAM) differ mainly in their design and applications. SRAM uses flip-flop circuits for each bit and retains data as long as power is supplied, offering faster access times and higher speed, making it suitable for cache memory. DRAM stores bits as charges in capacitors, requires periodic refreshing, and provides larger storage capacity at a lower cost but with slower access times, making it ideal for main memory. These structural differences influence their uses, with SRAM being used where speed and reliability are critical, and DRAM where larger volume storage at lower cost is desired .

The basic operational concepts of a computer revolve around the central processing unit (CPU), memory, and the input/output system. The CPU performs arithmetic and logic operations and controls other operations. The memory stores data and instructions. The interaction between the processor and memory occurs through the use of registers, which serve as temporary storage for data being processed. Each register has a unique identifier and can hold a specific size of data. The connection involves data transfer between CPU registers, such as through the use of control signals and buses that connect CPU, memory and I/O devices. This connection can be explained with a diagram illustrating the processor, its registers, the system buses, and the memory unit .

Big Endian and Little Endian are two methods of storing multibyte data-types in computer memory. Big Endian stores the most significant byte first, at the lowest address, which aligns with how humans typically read numbers. Little Endian stores the least significant byte first, making it easier for systems to incrementally read the bytes in increasing order of significance. The choice between these affects firmware and software design, especially in systems that rely on binary data exchange between computers, as a mismatch can lead to misinterpretation of data .

A CMOS memory cell stores data using a combination of transistors that form a bistable latch circuit. Its primary advantage is its low power consumption because it only draws significant power during switching between states, making it energy-efficient for static operations. Compared to DRAM, which requires periodic refreshing and higher power for capacitive charge retention, CMOS offers faster access times without the need for constant refreshing, which is beneficial in high-speed circuitry like processor cache .

Synchronous buses utilize a common clock signal to coordinate communication between different components connected to the bus. This ensures that data transfers occur at regular intervals, allowing for predictable performance and simplified control. Asynchronous buses, on the other hand, do not rely on shared timing signals, instead using handshaking and request-acknowledge signals to manage data transfers, which can result in less predictable but more flexible timing, accommodating devices of varied speeds. Synchronous buses offer higher throughput due to reduced overhead, while asynchronous buses provide greater versatility for connecting diverse devices .

Pipelining is a technique where multiple instruction phases are overlapped in processing to increase throughput. It divides instruction execution into separate stages, allowing different instructions to be processed at each stage simultaneously. This approach mimics assembly line work, improving instruction throughput at the cost of increased complexity in instruction handling and potential hazards like data dependencies. It implies faster processing but necessitates sophisticated control logic to optimize the instruction flow and handle stalls or branching efficiently .

Addressing modes provide the rules for interpreting or modifying the address field(s) in the instructions before the operand is executed. This functionality is crucial as it determines how the processor should access the data it requires. Common types of addressing modes include immediate, direct, indirect, register, and indexed. Each mode serves different purposes such as simplifying the implementation of loops, pointers, or arrays in programming languages. For example, the direct addressing mode specifies the effective address of the operand directly within the instruction, while indirect addressing uses the address of a pointer to the operand .

Cache memory is a smaller, faster type of volatile memory that stores copies of frequently accessed data from main memory to reduce average time to access data. Direct mapping assigns each block of main memory to a specific location in cache, making it simple but prone to collisions. Associative mapping allows any block to be loaded into any cache line, offering greater flexibility but requiring complex search mechanisms. Set-associative mapping is a compromise, dividing cache into sets and mapping each block to any location within a set, balancing simplicity and efficiency .

Performance measurement is critical in computing because it provides insights into how effectively a computer can execute processes and handle system tasks. Metrics such as instruction throughput, latency, and execution speed are used to quantify system performance. The SPEC rating is a standardized set of benchmarks that assess computing performance using realistic workload tests, presenting a composite numerical value that facilitates comparison between different systems. This benchmarking helps in understanding potential efficiency and optimizations for various software applications, thereby guiding purchasing or upgrading decisions .

You might also like