COA (comprehensive)

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/42

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 10:17 AM on 4/19/25
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

43 Terms

1
New cards

Throughput

A key performance metric defined as Throughput = 1 / max delay, emphasizing efficiency in data processing.

2
New cards

% Increase in Throughput

Computed using the formula (t2 - t1) / t1, where t1 and t2 are throughput values from different phases.

3
New cards

SIMD

  • Single Instruction Multiple Data;

  • A parallel processing method where multiple processing units execute the same instruction on different data.


4
New cards

Latency Ratio

A metric used to measure the performance of cache memory, reflecting the efficiency of data retrieval.

5
New cards

RAM

Random Access Memory; volatile memory that temporarily stores data and loses all information when powered off.

6
New cards

Cache

A memory buffer that accommodates speed differentials, providing faster access rates for frequently used data.

7
New cards

Associative Memory

Also known as content-addressable memory, allows access based on content rather than memory address.

8
New cards

Memory Hierarchies

Organization of memory types such as registers, cache, primary RAM, and secondary disk memory for data management.

9
New cards

PSW (Program Status Word)

An essential component saved in the stack during an interrupt, representing the state of the executing process.

10
New cards

Types of Interrupts

Classified into software interrupts, initiated by specific instructions, and hardware interrupts, triggered by external events.

11
New cards

Polling Method

An efficient method for managing multiple interrupts, allocating resources based on current task needs.

12
New cards

Bit-time

Time interval between adjacent bits.

13
New cards

FIFO buffer

A structure used to implement an instruction pipeline.

14
New cards

Cache hit ratio

Calculated using (T2 - Tavg + T1) / T2, measuring the performance of the cache system.

15
New cards

Daisy chain mechanism

A method where devices are connected using a single request line prioritized by the interrupting device's priority.

16
New cards

Write-back

Method for updating the main memory as soon as a word is removed from the cache.

17
New cards

Interrupt Vector

The starting address sent by the device in vectored interrupts.

18
New cards

2's complement

A mathematical representation for signed integers in binary form.

19
New cards

Data hazards

Occurrences when an instruction reads a register that a previous instruction overwrites in a future cycle.

20
New cards

Microcomputer

A system that includes at least a microprocessor, program memory, data memory, and I/O.

21
New cards

Flip Flop

A circuit used to store one bit of data.

22
New cards

Auxiliary Memory

Slower access units that trade speed for greater storage capacity and data stability.

23
New cards

Cache block size

The size of the data block stored in cache memory, significant for offset calculations.

24
New cards

Register Memory

Memory with the lowest access time in computer architecture.

25
New cards

TRAP

A non-maskable interrupt requiring immediate attention from the processor.

26
New cards

ORG and END

Not considered machine instructions in programming.

27
New cards

RISC architecture

An architecture where memory access is limited to specific instructions like JMP and MOV.

28
New cards

Microprocessor capacity

The maximum addressing capacity determined by its database and address base size.

29
New cards

Excess 3 code

A type of binary-coded decimal (BCD) that is not a weighted code.

30
New cards

Cache Size

Determined by the number of lines and block size, impacting cache performance.

31
New cards

Priority Encoder

Component that processes the priority of devices based on interrupt registers and mask registers.

32
New cards

N instruction pipelining

Time taken is calculated as k + (n - 1) cycles in a pipelined processor.

33
New cards

Instruction Access Time

T2 = access time without cache, Tavg = access time with cache, T1 = access time of memory.

34
New cards

Speeds and Latency

The performance of cache memory often measured in terms of latency ratio.

35
New cards

Bit Representation

K bit field can specify any one of 2^k registers.

36
New cards

Microcomputer Features

Often includes additional components like timers and analog-to-digital converters.

37
New cards

Memory Buffer

Used in cache to accommodate speed differentials between processor and memory.

38
New cards

Circuit Storage Elements

Flip Flops and registers are key components in data storage.

39
New cards

Addressing Capacity

16 bit database and 32 bit address base yield a maximum of 4G addressing.

40
New cards

Memory Leslie

Used to describe characteristics and design considerations in RISC processors.

41
New cards

Cache Performance Measurement

Frequently assessed through metrics like hit ratio and latency ratio.

42
New cards

Volatile Memory

Type of memory that loses its data when the power is turned off.

43
New cards

Programming Concept

Using ORG and END directives for defining the start and end of a program in assembly language.