slides01 Flashcards

1
Q

CPU dealing with I/O and memory

A
  • CPU to memory at high speeds
  • CPU to I/O at low speeds
  • I/O needs to be asynchronous and interrupt-driven so memory can deal with other tasks and not wait for it
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Steps in interrupt processing (6)

A
  1. device pulls interrupt request line; sensed by CPU after executing current instruction
  2. CPU detects interrupt, reads interrupt number and jumps to ISR (interrupt service routine) after saving current state
  3. CPU processes interrupt by running ISR
  4. CPU clears interrupt
  5. completes execution of ISR
  6. restores previous state and resumes computing
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

DMA (direct memory access)

A
  • once setup, CPU not involved in data transfers
  • used for bulk transfers
  • interrupt per block
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

storage hierarchy

A
  1. registers
  2. cache
  3. main memory
  4. nonvolatile memory
  5. hard-disk drives
  6. optical disk
  7. magnetic tapes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

dual mode operation

A
  • kernel is supervisor mode and the rest is in user mode
  • the kernel is part of the OS; applications need to defer to OS/kernel for certain high-privilege operations
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

advantages of dual mode operation

A
  • OS protected from errant user/program
  • errant users protected from each other
  • allows a method to manage privileged execution
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

normal vs privileged instructions

A
  • normal: in both user and kernel modes, execution proceeds
  • privileged: execution proceeds in kernel mode and user mode traps into OS
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

why can’t users manage interrupts?

A
  • program can be written to turn off all interrupts; no way for OS to regain control of CPU
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

computing systems performance

A
  • measurable through execution time of an application ie. want to minimize execution time to improve effectiveness
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Amdhal’s law

A
  • maximum potential improvement to the performance of a system is limited by portion of system that cannot be improved
    FORMULA
  • speedup = Told/Tnew
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

cluster computing

A
  • cheap way of obtaining high performance - using multiple machines
  • latency is not optimal -> takes longer to send message from one machine to another
  • high performance for applications that send few but large messages
How well did you know this?
1
Not at all
2
3
4
5
Perfectly