Chapter Ten - Operating SystemsINCOMPLETE Flashcards
1
Q
application software?
A
- written to solve problems in the REAL WORLD
2
Q
system software?
A
- programs that manage COMPUTER SYSTEM and INTERACTS w/ HARDWARE
3
Q
operating system?
A
- system software that manages computer RESOURCES and provides an INTERFACE for SYSTEM INTERACTION.
4
Q
multiprogramming?
A
- keeping MULTIPLE PROGRAMS in MAIN MEMORY at the same time
5
Q
memory management?
A
- OS keeps track of WHICH PROGRAMS are in MEMORY and WHERE in memory. (because of multiprogramming)
6
Q
process?
A
- program in EXECUTION
7
Q
process management?
A
- keeping TRACK of PROCESS and INTERMEDIATE states.
8
Q
CPU scheduling?
A
- determines WHICH PROCESS in memory is EXECUTED by the CPU at any given point.
9
Q
timesharing?
A
- allows MULTIPLE USERS to INTERACT w/ a COMPUTER at the SAME TIME.
10
Q
virtual machine?
A
- ILLUSION of each user having their own computer when they are in fact sharing the same MAINFRAME.
11
Q
mainframe?
A
- single, large MULTIUSER COMPUTER
12
Q
dumb terminal?
A
- MONITOR + KEYBOARD
13
Q
real-time system?
A
- system that must guarantee MINIMUM RESPONSE TIME to user.
14
Q
response time?
A
- DELAY b/w receiving STIMULUS and producing a RESPONSE
15
Q
logical address?
A
- value that specifies a location for the program but is NOT actually in the MAIN MEMORY (before a program is compiled into the main memory, it uses these addresses for its data and code…)
16
Q
physical address?
A
- actual address in the MAIN MEMORY
17
Q
address binding
A
- LOGICAL ADDRESS to PHYSICAL ADDRESS
18
Q
base register?
A
- holds the BEGINNING ADDRESS of the current PARTITION (see image 344)
19
Q
bounds register?
A
- holds the LENGTH of the current PARTITION
20
Q
paged memory technique?
frames?
page?
page-map table
A
- main memory divided into FRAMES and process is divided into PAGES
- FRAME: fixed-size blocks of storage
- PAGE: divided process in PMT
- used by OS to keep track of page/frame relationships
21
Q
demand paging?
A
- PAGES are brought into MEMORY ON DEMAND (not all parts of a program actually have to be in memory at the same time)
22
Q
page swap?
A
- (demand paging) bringing in a PAGE from SECONDARY MEMORY
23
Q
virtual memory? (STOPPED CHEAT SHEET HERE)
A
- illusion that there is NO RESTRICTION to PROGRAM SIZE because an entire process need not be in MEMORY at same time
24
Q
thrashing?
A
- excessive page swapping (bad for CPU)
25
process states?
- new state(e.g. login), ready state(waiting for CPU), running state(fetching and executing), waiting state, terminated state...
26
process control block (PCB)?
-
27
context switch?
-
28
nonpreemptive vs preemptive scheduling?
-
29
turnaround time?
-
30
time slice?
-
