Chap1 - PART 1 - Abstraction And Technology Flashcards

1
Q

What is Computer Architecture?

Define it

A

Computer Architecture: is the design of the abstraction/implementation layers that allow us to execute information processing applications efficiently using manufacturing technologies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

List the Order of the Computer Architecture section in the “Abstractions in Modern Computing System”

A

[OS/VM] > [ISA] > [Microarchitecture] > [Register-Transfer level] > [Gates]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Computer Architecture is Constantly Changing!

Explain: Application Requirements:

Explain: Technology Constraints:

A

Application Requirements:

  • This refers to how to improve the architecture
  • Provide revenue to fund development

Technology Constraints:

  • Restrict what can be done efficiently
  • New technologies make new architecture possible

Note that: Architecture provides feedback to guide application and technology research directions!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

List all types of Computer

A
  1. Personal Computer
  2. Super Computers
  3. Embedded Computers
  4. Server Computers
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Describe Personal Computer

A
  • General purpose, variety of software
  • Subject to cost/performance tradeoff [makes sense]
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Describe Supercomputers

A
  • capable of executing High-end scientific and engineering calculations
  • has the highest capability but repressent a small fraction of the overall computer market.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Describe Server Computers

A
  • Network based
  • High capacity, performance, reliability
  • range from small servers to building sized
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe embedded computers

A
  • This is the largest class of computers
  • It is usually hidden as components of systems
  • Stringent power/performance/cost constraints
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Describe PMDS

A

Personal Mobile Device:

  • Small wireless devices that connect to the internet
  • Relies on battery hence portability
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Describe Cloud computing

A

This is a large collections of servers that provide services over the internet

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Describe “Software as a service (SaaS)”

A
  • Delivering software and data as a service over the internet. Eg. Citrix
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Image of the Old Machine Structures

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the Old Conventional Wisdom?

A

Moore’s Law + Dennard Scaling = Faster + Cheaper + Lower-powered general purpose computers per year

Remember it is dumb to compete by designing: Parallel or specialized computers

Because by the time you have finished one design, the next generation of general-purpose will beat you for sure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How many TFLOPS/Chip Google has?

A

They use the Google TPU2: which is a specialized engine for NN training that is deployed in cloud.

It is 45 TFLOPS / chip.

meaning:

Trillion Floating Point Operation Per Second

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Understanding Performance:

Explain the term below:

  • Algorithm
A

This determines the number of operations executed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Understanding Performance:

Explain the term below:

  • Programming language, compiler, architecture
A

This determine the number of machine instructions executed per operation

17
Q

Understanding Performance:

Explain the term below:

  • Processor and Memory System
A

This determine how fast instructions are executed

18
Q

Understanding Performance:

Explain the term below:

  • I/O System (Including OS)
A

This determines how fast I/O operations are executed.

19
Q

What are the 8 great ideas in Computer Architecture?

A
  1. Design for Moore’s Law
  2. Use Abstraction to simplify design
  3. Make the Common Case Fast
  4. Performance via Parallelism
  5. Performance via Pipelining
  6. Performance via Prediction
  7. Hieracrchy of memories
  8. Dependability via Redundancy
20
Q

State the design for Moore’s Law

Gordon Moore

Intel Co-Founder

A

The number of resoruces in an integrated circuit (IC) doubles every 18-24 months

21
Q

Idea #2:

Abstraction

A
22
Q

Idea # 3:

Make the Common Case Fast

A

Making the common case fast will:

  • tend to enchance performance better than optimizing the rare case
  • However, common case is often simplier than the rare one and hence it is easier to enhance.
  • Making the common case fast is known as : Amdahl’s law
23
Q

Idea #4:

Performance via Parallelism

Parallelism != Concurrency

Therefore, explain: Concurrency.

Also explain: Parallelism

Remember Parallelism CANNOT occur in a single core CPU

A

Concurrency:

  • This is the fast switching between operations/programs/applications, giving the impression that these are occuring at the same time. Also natively known as share time.

Parallelism:

  • This is the running of several tasks, or parts of tasks at the same time
24
Q

Idea #5:

Performance via Pipelining

A
  • This is known as extension parallelism.
    • For example, we can imagine the execution of instructions as an assembly line.
    • As soon as the first part of an instruction is done, you then move onto the second part and start the first part of the enxt instruction.
  • Difference between Pipeline and Non-Pipelined
25
Q

Idea #6:

Performance via Prediction

A

This is typical better to ask for forgiveness than to ask for permission scenario:

  • Some cases, this can be faster on average to guess and start workin rather than to wait for the outcome.
    • for example:
26
Q

Idea# 7:

Principle of Locality/Hierarchy of Memories.

Image:

A
27
Q

Idea #8:

Dependability via Redundancy

A

This refers to making systems dependable by including redundant components.

  • Therefore, these components can take over when a failure occurs and to help detect failures.
    • ​eg.
      • Redundant data centers: so that can lose 1 datacenter but Internet service stays online;
      • Redundant disks: so that can lose 1 disk but not lose data (Redundant Arrays of Independent Disks/RAID);
      • Redundant memory bits: so that can lose 1 bit but no data(Error Correcting Code / ECC memory)
28
Q

What is Below your Program?

A
29
Q

List the functions of the System Software below:

  • Compiler
  • Operating System: Service Code
A

Compiler:

  • This translates HLL code to machine code

Operating System: Service Code:

  • Handling input/output
  • Managing Memory and storage
  • Scheduling tasks and sharing resources
30
Q

List the function of the Hardware

A

The hardware handles:

the processor, memory, and I/O controllers.

31
Q

What are the levels of a program code and describe each briefly?

A
  1. High Level Language:
    • Level of abstraction closer to problem domain
    • provides for productivity and portability
  2. Assembly Language
    • Textual representation of instructions
  3. Hardware Representation
    • Binary digits (bits)
    • Encoded instructure and data
32
Q

List the 5 classic components of a computer:

A
  1. Input
  2. Output
  3. Memory
  4. Datapath
  5. Control

Remember: Datapath + Control = Processor sometimes.

33
Q

What does the Input/Output includes?

A

Input/Output:

  • User-interface devices such as Display, Keyboard, Mouse
  • Storage devices: hard disk, CD/DVD, flash
  • Network adapters: for communicating with other computers
34
Q

List the components inside the processor(CPU) and describe its function for each

A

CPU:

Datapath:

  • performs operations on data

Control:

  • Sequences datapath, memory, …etc

Cache memory:

  • Small fast SRAM memory for immediate access to data
35
Q

Image of the Moore’s Law

The Fifth Paradigm

A
36
Q
A