問題一覧
1
any pre-existing hardware
environment, a piece of software that is designed to run within it, and
any associated facilities used with it.
Computing Platform
2
Punch cards and machine language programming.
(1945–55) Vacuum Tubes
3
is an abstraction of a running program. It enables doing several things at the same time. support the ability to have (pseudo) concurrent operation
Process
4
an activity of some kind
Process
5
is something that
may be stored on disk, not doing
anything
Program
6
This rapid switching back and forth is called
Multiprogramming
7
All the runnable software on the computer, sometimes including the
operating system, is organized into a number of
Sequential Process
8
a new process is created by having an existing
process execute a
Process Creation
9
Process Termination:
Which of these are voluntary?
Normal Exit, Error Exit
10
Process Termination:
Which of these are involuntary?
Fatal Error, Killed by another process
11
Process States:
actually using the CPU at that instant
Running
12
Process States:
runnable; temporarily stopped to let another process run
Ready
13
Process States:
unable to run until some external event happens
Blocked
14
process-structured operating system handles
interrupts and scheduling.
Lowest Layer
15
sequential processes.
Above Layer
16
One entry per process.
Contains important information
about the process’ state.
Information that must be saved
when the process is switched
from running to ready or blocked
state so that it can be restarted
later.
Process Table
17
Skeleton of what the lowest level of the operating system does when
an interrupt occurs.
Interrupt Handling and Scheduling
18
CPU utilization as a function of the number of processes in memory.
Modelling of Multiprogramming
19
In many applications, multiple activities are going on at once.
Give the ability for the parallel entities to share an address
space and all of its data.
Threads
20
reads incoming requests for work from the
network and chooses an idle (i.e., blocked) worker thread to
hand the request
Dispatcher
21
the situation of allowing multiple threads in the
same process
Multithreading
22
Processes frequently need to
communicate with other
processes:
To pass information from process
to another
To enable proper sequencing
when dependencies are present
Inter-process Communication (IPC)
23
Two or more processes are
reading or writing some shared
data and the final result depends
on who runs precisely when
Race Conditions
24
No two processes may be simultaneously inside their critical regions.
Mutual Exclusion (mutex)
25
No assumptions may be made about speeds or the number of CPUs.
No Assumption
26
No process running outside its critical region may block other processes.
Progress
27
No process should have to wait forever to enter its critical region
No Starvation
28
the part of the program where shared variables are
accessed
Critical Region
29
two processes strictly alternate in entering their critical regions
It is not really a serious candidate as a solution because it violates condition
Strict Alternation
30
Classical IPC Problems:
Models access to a bounded buffer.
Producer won't try to add data
into the buffer if it's full.
Producer Consumer Problem
31
Classical IPC Problems:
Models processes competing for
exclusive access to a limited
number of resources such as I/O
devices
Dining Philosophers Problem
32
Classical IPC Problems:
Models access to a database.
Two readers can read at once.
A writer should not wait longer
than needed.
Readers Writers Problem
33
What are the units of execution?
Processes
34
How are those units of execution represented?
Process Control Blocks (PCBs)
35
How are processes created?
CreateProcess (Windows), fork/exec (Unix)
36
How does a process move from one state to another?
Scheduling, I/O, creation, termination
37
What are the possible execution states of a process?
Running, ready, waiting
38
How is work scheduled in the CPU?
Process states, process queues, context switches
39
A multiprogramming system with three jobs in memory
ICs and Multiprogramming
40
A set of disciplines that describes a computer system by specifying its parts and their relations provides physical environment
Hardware Architecture
41
A collection of software that manages computer hardware resources and provides common services for computer programs. Is an essential component of the system software in a computer system.
Operating Systems
42
IBM first mainframes introduced.
Less expensive DEC minicomputers introduced.
1959 to present
43
Introduction of IBM PC.
Proliferation in 80s, 90s resulted in growth of personal software.
1981 to present
44
Desktop clients networked to servers, with processing work split between clients and servers.
Network may be two-tiered or multitiered (N-tiered).
1983 to present
45
Move toward integrating disparate networks, applications using Internet standards and enterprise applications.
1992 to present
46
computing power and software applications supplied over the Internet or other network.
2000 to present
47
-First thread interacts with the user.
-Second thread handles reformatting in the background.
-Third thread handles the disk backups.
Thread Usage - A Word Processor
48
-The first column lists some items shared by all threads in a process.
-The second one lists some items private to each thread.
Thread Usage - A Multithreaded Web Server
49
processes spend most of their time computing.
CPU-Bound
50
processes spend most of their time waiting for I/O
I/O Bound
51
Choosing which process to run next, when two or more of them are simultaneously in the ready state.
Scheduling
52
Categories of Scheduling Algorithms:
• Periodic tasks – payroll, bills, interest calculation (at banks)
• No users impatiently waiting
• Possible to run for long time periods for each process without switching
Batch
53
• For environments with ________ users – personal computing, servers
• One process cannot be hogging the CPU and denying service to the others
Interactive
54
Only programs that are intended to further the application at hand.
Processes may not run for long and usually do their work and block quickly.
Real-time
55
The running process keeps the CPU until it voluntarily gives up the CPU.
Non-preemptive scheduling
56
The running process can be interrupted and must release the CPU.
Preemptive Scheduling
57
“Real-world” scheduling of people in lines (e.g., supermarket)
A single queue of ready jobs
First-Come, First-Served (FCFS)
58
Choose the job with the smallest expected duration first.
Shortest Job First (SJF)
59
One of the oldest, simplest, most commonly used scheduling algorithms.
Round-Robin Scheduling
60
Scheduling algorithms can be combined.
Multiple-level feedback queues (MLFQ)
61
Not all processes are equally important.
Priority Scheduling
62
Each job has an arrival time and a deadline to finish.
Earliest Deadline First (EDF)
63
Scheduler is the module that gets invoked when a context switch needs to happen.
Scheduling Summary
64
interfaces transfer multiple bits at the same time.
They usually require buses of data - transmitting across eight, sixteen, or more wires.
Parallel Communication
65
is the process of sending/receiving data in one bit at a time.
Serial Communication
66
is a set of devices (often referred to as nodes) connected by communication links.
Network
67
can be a computer or any other device capable of sending and/or receiving data generated by other nodes on the network.
Node
68
can be a cable, air, optical fiber, or any medium which can transport a signal carrying information.
Link
69
arrangement of the cables, network devices, and end systems.
Physical Topology
70
how the network devices appear connected to network users
Logical Topology
71
measure of the data rate in bits per second (b/s) of a given link.
Speed
72
general expense for purchasing of network components as well as installation and maintenance of the network.
Cost
73
indicates how protected the network is, including the
information that is transmitted over the network.
Security
74
refers to the likelihood that the network is available for use when it is required.
Availability
75
indicates how easily the network can accommodate more users and data transmission requirements as they increase.
Scalability
76
indicates the dependability of the components that make up the network including the routers, switches, PCs, and servers; often measured as MTBF (mean time bw failures).
Reliability
77
single transmitter and receiver.
Point to Point
78
multiple recipients of single transmission
Multipoint
79
unicast, mulitcast, broadcast
Types of Transmission:
Unicast, Multicast, Broadcast
80
Connecting 5 station
Mesh
81
Connecting 4 station
Star
82
3 Station
Bus
83
6 Station
Ring
84
Star backbone w 3 bus networks
Hybrid
85
Short distances.
Designed to provide local interconnectivity.
LAN
86
Long distances.
Provide connectivity over large areas.
WAN
87
Network organized around an individual person within a single building
PAN
88
Provide connectivity over areas such as a city, a campus
MAN
89
are logical units of information created by processes.
File Systems
90
Punch Cards
1725
91
Punched Tape
1846
92
Selectron Tubes
1946
93
Magnetic Tape
1950s
94
Cassette
1963
95
The magnetic drum and Hard disk drive
1960s
96
The floppy disk
1969
97
Compact disk
1979
98
DVD
1995
99
Blue-ray and Usb Drive
2000
100
Cloud
2000s
ART APP
ART APP
dulsetnet · 54問 · 1年前ART APP
ART APP
54問 • 1年前NET1
NET1
dulsetnet · 79問 · 2年前NET1
NET1
79問 • 2年前DB1
DB1
dulsetnet · 108問 · 2年前DB1
DB1
108問 • 2年前NET1
NET1
dulsetnet · 79問 · 2年前NET1
NET1
79問 • 2年前PT2
PT2
dulsetnet · 111問 · 2年前PT2
PT2
111問 • 2年前PT2
PT2
dulsetnet · 38問 · 2年前PT2
PT2
38問 • 2年前DB1
DB1
dulsetnet · 108問 · 2年前DB1
DB1
108問 • 2年前NET1
NET1
dulsetnet · 79問 · 2年前NET1
NET1
79問 • 2年前DB1
DB1
dulsetnet · 108問 · 2年前DB1
DB1
108問 • 2年前HCI
HCI
dulsetnet · 12問 · 1年前HCI
HCI
12問 • 1年前IPT
IPT
dulsetnet · 86問 · 1年前IPT
IPT
86問 • 1年前ETHICS
ETHICS
dulsetnet · 98問 · 1年前ETHICS
ETHICS
98問 • 1年前ART APPRECIATION
ART APPRECIATION
dulsetnet · 81問 · 1年前ART APPRECIATION
ART APPRECIATION
81問 • 1年前SAM41A
SAM41A
dulsetnet · 49問 · 1年前SAM41A
SAM41A
49問 • 1年前SIP
SIP
dulsetnet · 79問 · 1年前SIP
SIP
79問 • 1年前問題一覧
1
any pre-existing hardware
environment, a piece of software that is designed to run within it, and
any associated facilities used with it.
Computing Platform
2
Punch cards and machine language programming.
(1945–55) Vacuum Tubes
3
is an abstraction of a running program. It enables doing several things at the same time. support the ability to have (pseudo) concurrent operation
Process
4
an activity of some kind
Process
5
is something that
may be stored on disk, not doing
anything
Program
6
This rapid switching back and forth is called
Multiprogramming
7
All the runnable software on the computer, sometimes including the
operating system, is organized into a number of
Sequential Process
8
a new process is created by having an existing
process execute a
Process Creation
9
Process Termination:
Which of these are voluntary?
Normal Exit, Error Exit
10
Process Termination:
Which of these are involuntary?
Fatal Error, Killed by another process
11
Process States:
actually using the CPU at that instant
Running
12
Process States:
runnable; temporarily stopped to let another process run
Ready
13
Process States:
unable to run until some external event happens
Blocked
14
process-structured operating system handles
interrupts and scheduling.
Lowest Layer
15
sequential processes.
Above Layer
16
One entry per process.
Contains important information
about the process’ state.
Information that must be saved
when the process is switched
from running to ready or blocked
state so that it can be restarted
later.
Process Table
17
Skeleton of what the lowest level of the operating system does when
an interrupt occurs.
Interrupt Handling and Scheduling
18
CPU utilization as a function of the number of processes in memory.
Modelling of Multiprogramming
19
In many applications, multiple activities are going on at once.
Give the ability for the parallel entities to share an address
space and all of its data.
Threads
20
reads incoming requests for work from the
network and chooses an idle (i.e., blocked) worker thread to
hand the request
Dispatcher
21
the situation of allowing multiple threads in the
same process
Multithreading
22
Processes frequently need to
communicate with other
processes:
To pass information from process
to another
To enable proper sequencing
when dependencies are present
Inter-process Communication (IPC)
23
Two or more processes are
reading or writing some shared
data and the final result depends
on who runs precisely when
Race Conditions
24
No two processes may be simultaneously inside their critical regions.
Mutual Exclusion (mutex)
25
No assumptions may be made about speeds or the number of CPUs.
No Assumption
26
No process running outside its critical region may block other processes.
Progress
27
No process should have to wait forever to enter its critical region
No Starvation
28
the part of the program where shared variables are
accessed
Critical Region
29
two processes strictly alternate in entering their critical regions
It is not really a serious candidate as a solution because it violates condition
Strict Alternation
30
Classical IPC Problems:
Models access to a bounded buffer.
Producer won't try to add data
into the buffer if it's full.
Producer Consumer Problem
31
Classical IPC Problems:
Models processes competing for
exclusive access to a limited
number of resources such as I/O
devices
Dining Philosophers Problem
32
Classical IPC Problems:
Models access to a database.
Two readers can read at once.
A writer should not wait longer
than needed.
Readers Writers Problem
33
What are the units of execution?
Processes
34
How are those units of execution represented?
Process Control Blocks (PCBs)
35
How are processes created?
CreateProcess (Windows), fork/exec (Unix)
36
How does a process move from one state to another?
Scheduling, I/O, creation, termination
37
What are the possible execution states of a process?
Running, ready, waiting
38
How is work scheduled in the CPU?
Process states, process queues, context switches
39
A multiprogramming system with three jobs in memory
ICs and Multiprogramming
40
A set of disciplines that describes a computer system by specifying its parts and their relations provides physical environment
Hardware Architecture
41
A collection of software that manages computer hardware resources and provides common services for computer programs. Is an essential component of the system software in a computer system.
Operating Systems
42
IBM first mainframes introduced.
Less expensive DEC minicomputers introduced.
1959 to present
43
Introduction of IBM PC.
Proliferation in 80s, 90s resulted in growth of personal software.
1981 to present
44
Desktop clients networked to servers, with processing work split between clients and servers.
Network may be two-tiered or multitiered (N-tiered).
1983 to present
45
Move toward integrating disparate networks, applications using Internet standards and enterprise applications.
1992 to present
46
computing power and software applications supplied over the Internet or other network.
2000 to present
47
-First thread interacts with the user.
-Second thread handles reformatting in the background.
-Third thread handles the disk backups.
Thread Usage - A Word Processor
48
-The first column lists some items shared by all threads in a process.
-The second one lists some items private to each thread.
Thread Usage - A Multithreaded Web Server
49
processes spend most of their time computing.
CPU-Bound
50
processes spend most of their time waiting for I/O
I/O Bound
51
Choosing which process to run next, when two or more of them are simultaneously in the ready state.
Scheduling
52
Categories of Scheduling Algorithms:
• Periodic tasks – payroll, bills, interest calculation (at banks)
• No users impatiently waiting
• Possible to run for long time periods for each process without switching
Batch
53
• For environments with ________ users – personal computing, servers
• One process cannot be hogging the CPU and denying service to the others
Interactive
54
Only programs that are intended to further the application at hand.
Processes may not run for long and usually do their work and block quickly.
Real-time
55
The running process keeps the CPU until it voluntarily gives up the CPU.
Non-preemptive scheduling
56
The running process can be interrupted and must release the CPU.
Preemptive Scheduling
57
“Real-world” scheduling of people in lines (e.g., supermarket)
A single queue of ready jobs
First-Come, First-Served (FCFS)
58
Choose the job with the smallest expected duration first.
Shortest Job First (SJF)
59
One of the oldest, simplest, most commonly used scheduling algorithms.
Round-Robin Scheduling
60
Scheduling algorithms can be combined.
Multiple-level feedback queues (MLFQ)
61
Not all processes are equally important.
Priority Scheduling
62
Each job has an arrival time and a deadline to finish.
Earliest Deadline First (EDF)
63
Scheduler is the module that gets invoked when a context switch needs to happen.
Scheduling Summary
64
interfaces transfer multiple bits at the same time.
They usually require buses of data - transmitting across eight, sixteen, or more wires.
Parallel Communication
65
is the process of sending/receiving data in one bit at a time.
Serial Communication
66
is a set of devices (often referred to as nodes) connected by communication links.
Network
67
can be a computer or any other device capable of sending and/or receiving data generated by other nodes on the network.
Node
68
can be a cable, air, optical fiber, or any medium which can transport a signal carrying information.
Link
69
arrangement of the cables, network devices, and end systems.
Physical Topology
70
how the network devices appear connected to network users
Logical Topology
71
measure of the data rate in bits per second (b/s) of a given link.
Speed
72
general expense for purchasing of network components as well as installation and maintenance of the network.
Cost
73
indicates how protected the network is, including the
information that is transmitted over the network.
Security
74
refers to the likelihood that the network is available for use when it is required.
Availability
75
indicates how easily the network can accommodate more users and data transmission requirements as they increase.
Scalability
76
indicates the dependability of the components that make up the network including the routers, switches, PCs, and servers; often measured as MTBF (mean time bw failures).
Reliability
77
single transmitter and receiver.
Point to Point
78
multiple recipients of single transmission
Multipoint
79
unicast, mulitcast, broadcast
Types of Transmission:
Unicast, Multicast, Broadcast
80
Connecting 5 station
Mesh
81
Connecting 4 station
Star
82
3 Station
Bus
83
6 Station
Ring
84
Star backbone w 3 bus networks
Hybrid
85
Short distances.
Designed to provide local interconnectivity.
LAN
86
Long distances.
Provide connectivity over large areas.
WAN
87
Network organized around an individual person within a single building
PAN
88
Provide connectivity over areas such as a city, a campus
MAN
89
are logical units of information created by processes.
File Systems
90
Punch Cards
1725
91
Punched Tape
1846
92
Selectron Tubes
1946
93
Magnetic Tape
1950s
94
Cassette
1963
95
The magnetic drum and Hard disk drive
1960s
96
The floppy disk
1969
97
Compact disk
1979
98
DVD
1995
99
Blue-ray and Usb Drive
2000
100
Cloud
2000s