Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

MIDTERMS 2ND YEAR 2ND SEM > ITEC 95(SIR ROWEE) > Flashcards

ITEC 95(SIR ROWEE) Flashcards

1
Q

Advantages of Modeling & Simulation

A

Allows for testing hypothetical scenarios without actual implementation.

  • Can minimize risks and optimize performance.
  • Provides a cost-effective solution for solving complex problems.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Limitations of Modeling & Simulation

A

Models may not accurately capture real-world behavior.

  • Can be time-consuming and require expertise to create.
  • Data availability and quality can greatly affect the accuracy of the simulation.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

: One of the significant advantages of modeling and simulation is that it allows for extensive testing without the need for a physical prototype.

A

Testing

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

Modeling and simulation can also make upgrading an existing system or process more efficient.

A

Upgrading:

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

Another benefit of modeling and simulation is the ability to identify constraints in a system.

A

Identifying constraints:

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

Modeling and simulation can also be useful for diagnosing problems in a system.

A

Diagnostics:

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

Modeling and simulation can handle complex systems and processes that would be difficult to analyze using traditional methods.

A

Complexity:

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

One potential disadvantage of modeling and simulation is that it may not accurately represent the real-world system. This can result in false positives or false negatives during testing.

A

Testing:

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

Another disadvantage is that the simulation may not accurately predict the impact of changes on the system. This can result in unexpected consequences when the changes are made in the physical system.

A

Upgrading

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

Modeling and simulation may also fail to identify constraints that are not included in the model.

A

Identifying constraints

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

Similarly, modeling and simulation may miss problems that are not included in the model.

A

Diagnostics:

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

Modeling and simulation can also be time-consuming and require significant computational resources, particularly for complex systems.

A

Complexity

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

Modeling and simulation can have ethical implications, such as the use of virtual animal testing instead of real-life testing.

A

Ethical Considerations

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

Transparency and accountability are important in the use and development of simulations.

A

Ethical Considerations

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

Advancements in technology such as artificial intelligence and machine learning can improve the accuracy and efficiency of simulation.

A

Future of Modeling & Simulation

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

More widespread use in fields such as urban planning and climate change modeling.

A

Future of Modeling & Simulation

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

Here are some examples of ethical considerations in modeling and simulation:

A

Data privacy
Bias and discrimination
Safety and reliability
Intellectual property
Transparency and accountability

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

The use of modeling and simulation is increasing in many fields, and there is a growing demand for professionals with expertise in this area.

A

Career Opportunities

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

Deciding which process/thread should occupy the resource (CPU, disk, etc)

A

Process Scheduling

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

Switch CPU from one process to another
Performed by scheduler

A

Context Switch

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

Need hardware support

A

Context Switch

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

When should the scheduler be called?

A

A new process is admitted
The running process exits
The running process is blocked
I/O interrupt (some processes will be ready)
Clock interrupt (every 10 milliseconds)

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

The running process keeps the CPU until it voluntarily gives up the CPU
process exits
switches to blocked state
Transition 3 is only voluntar

A

Non-preemptive scheduling:

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

The running process can be interrupted and must release the CPU (can be forced to give up CPU)

A

Preemptive scheduling

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

(equitable shares of CPU)

A

Fairness

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

highest priority first)

A

Priority

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

make best use of equipment)

A

Efficiency

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

(can’t take advantage of the system)

A

Encouraging good behavior

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

degrade gracefully

A

Support for heavy loads

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

interactive, real-time, multi-media

A

Adapting to different environments

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

: keep resources as busy as possible

A

Efficiency

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

of processes that complete in unit time

A

Throughput:

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

Total amount of time spent by the process waiting in ready queue

A

Waiting Time

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

Amount of time spent by the process waiting in ready queue before it starts executing

A

Initial Waiting Time

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

amount of time from when a job is admitted until it completes

A

Response Time

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

Assign CPU proportionally to given application weight

A

Proportionality:

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

Proportionality:

A

Meeting Deadlines

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

Scheduling should load balance between I/O bound and CPU-bound processes
Ideal would be to run all equipment at 100% utilization but that would not necessarily be good for response time

A

Process Mix

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

Process that requests the CPU FIRST is allocated the CPU FIRST.
Also called _____
Used in Batch Systems
Implementation

A

First Come First Serve (FCFS)

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

Is it Preemptive or Non-preemptive?

A

NON-PREEMPTIVE

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

Problems with FCFS

A

Non-preemptive
Does not minimize AWT
Cannot utilize resources in parallel

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

Usually preemptive
Time is sliced into quanta (time intervals)
Scheduling decision is also made at the beginning of each quantum
Performance Criteria
Average response time
Average initial waiting time
Average waiting time
Fairness (or proportional resource allocation)
Representative algorithms:
Round-robin
Priority-based

A

Interactive Scheduling Algorithms

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

One of the oldest, simplest, most commonly used scheduling algorithm
Select process/thread from ready queue in a round-robin fashion (take turns)

A

Round-robin

44
Q

Schedule the job with the shortest computation time first
Scheduling in Batch Systems
Two types:
Non-preemptive
Preemptive
Optimal if all jobs are available simultaneously: Gives the best possible AWT (average waiting time)

A

Shortest Job First (SJF)

45
Q

Shortest job runs first.
A job that arrives and is shorter than the running job will preempt it

A

Preemptive SJF

46
Q

A job may keep getting preempted by shorter ones

A

Starvation

47
Q

A Problem with Preemptive SJF

A

STARVATION

48
Q

Examples include Air Combat Training Simulation
System, Tactical Air Crew Combat Training System,
ZAP Missile Launch, Integrated Air Defense
Systems.
- Used to train soldiers in a simulated environment
that replicates real-life scenarios.
- Helps improve decision-making skills and
situational awareness of soldiers

A

Simulation for Training

49
Q
  • Examples include Full Body Vasculature Silicone
    Model, Vital Sign Simulation, CFD Simulation.
  • Used to train medical professionals and students
    in a safe and controlled environment.
  • Helps improve skills and knowledge in diagnosis,
    treatment, and surgery.
A

Simulation for Health and
Medicine

50
Q
  • Examples include Multi-physics simulation in ski
    manufacturing, simulation for fuel injector design
    and spray.
  • Used to design and improve engineering systems
    and products.
  • Helps predict system behavior, optimize product
    performance, and reduce costs and production
    time
A

Simulation for Engineering

51
Q
  • Simulations in education are somewhat like
    training simulations. They focus on specific
    tasks.
  • a more recent use of simulation in education
    include animated narrative vignettes (ANV). ANVs
    are cartoon-like video narratives of hypothetical
    and reality-based stories involving classroom
    teaching and learning
A

Simulation in Education

52
Q

Discuss how modeling and simulation
are used in the telecommunications
industry to design and optimize
networks, predict and prevent failures,
and improve performance.

A

Simulation in
Telecommunications:

53
Q

Discuss how modeling and simulation
are used in business to make decisions,
forecast trends, and optimize
processes

A

Simulation in Business:

54
Q

Discuss how modeling and
simulation are used in training and
support for various industries,
such as healthcare and aviation

A

Simulation in Training and
Support:

55
Q

Provides a safe and controlled environment for
training and experimentation.
- Helps improve decision-making skills, knowledge,
and performance in various fields.
- Reduces costs and production time by optimizing
product design and performance

A

Benefits of Modeling and
Simulation

56
Q
  • Allows for testing hypothetical scenarios without actual implementation.
  • Can minimize risks and optimize performance.
  • Provides a cost-effective solution for solving complex problems
A

Advantages of Modeling &
Simulation

57
Q
  • Models may not accurately capture real-world
    behavior.
  • Can be time-consuming and require expertise to
    create.
  • Data availability and quality can greatly affect the
    accuracy of the simulation.
A

Limitations of Modeling &
Simulation

58
Q

TT=

A

CT-AT

59
Q

WT=

A

TT-BT

60
Q

CT=

A

AT+BT

61
Q

CPU UTILIZATION=

A

(TOTAL CT/TOTAL ELAPSED TIME)*100%

62
Q

Usually preemptive

Time is sliced into quanta (time intervals)

Scheduling decision is also made at the beginning of each quantum

Performance Criteria

Average response time

Average initial waiting time

Average waiting time

Fairness (or proportional resource allocation)

Representative algorithms:

Round-robin

Priority-based

A

Interactive Scheduling
Algorithms

63
Q

One of the oldest, simplest, most commonly used
scheduling algorithm

Select process/thread from ready queue in a
round-robin fashion (take turns)

A

Round-robin

64
Q

70-80% of jobs block within time-slice

A

Heuristic:

65
Q

10-100 ms (depends on job priority)

A

Typical time-slice

66
Q

Too many context switches (overheads)

Inefficient CPU utilization

A

Time slice too small

67
Q

FIFO behavior

Poor initial waiting time

A

Time slice too large

68
Q

Schedule the job with the shortest
computation time first

Scheduling in Batch Systems

A

Shortest Job First (SJF)

69
Q

TWO TYPES OF SJF:

A

Non-preemptive

Preemptive

70
Q

Shortest job runs first.

A job that arrives and is shorter than the
running job will preempt it

A

Preemptive SJF

71
Q

A Problem with Preemptive
SJF

A

Starvation

72
Q

A job may keep getting preempted by shorter ones

A

Starvation

73
Q

time it takes for the dispatcher
to stop one process and start another running

A

Dispatch latency

74
Q

Selects from among the processes in memory that are
ready to execute, and allocates the CPU to one of them

A

CPU Scheduler

75
Q

gives control of the CPU to the
process selected by the scheduler; this involves:

A

Dispatcher module

76
Q

keep the CPU as busy as
possible

A

CPU utilization

77
Q

of processes that complete their
execution per time unit

A

Throughput

78
Q

amount of time to execute a
particular process

A

Turnaround time

79
Q

amount of time a process has
been waiting in the ready queue

A

Waiting time

80
Q

amount of time it takes from
when a request was submitted until the first
response is produced, not output (for
time-sharing environment)

A

Response time

81
Q

Associate with each process the length of its next
CPU burst. Use these lengths to schedule the
process with the shortest time.

A

Shortest-Job-First (SJF) Scheduling

82
Q

gives minimum average waiting
time for a given set of processes

A

SJF is optimal

83
Q

A priority number (integer) is associated with each process

A

Priority Scheduling

84
Q

The CPU is allocated to the process with the highest
priority (smallest integer ≡ highest priority)

A

Priority Scheduling

85
Q

low priority processes may never
execute

A

Starvation

86
Q

as time progresses increase the priority
of the process

A

Aging

87
Q

Each process gets a small unit of CPU time (time
quantum), usually 10-100 milliseconds. After this time
has elapsed, the process is preempted and added to the end
of the ready queue.

A

Round Robin (RR)

88
Q

Ready queue is partitioned into separate queues:

foreground (interactive)

background (batch)

Each queue has its own scheduling algorithm:

foreground – RR

background – FCFS

Scheduling must be done between the queues:

Fixed priority scheduling; (i.e., serve all from foreground then
from background). Possibility of starvation.

Time slice – each queue gets a certain amount of CPU time which
it can schedule amongst its processes; i.e., 80% to foreground in
RR

20% to background in FCFS

A

Multilevel Queue

89
Q

A process can move between the various queues; aging can be
implemented this way.

Multilevel-feedback-queue scheduler defined by the following
parameters:

A

Multilevel Feedback Queue

90
Q

Distinction between user-level and kernel-level threads

A
91
Q

Many-to-one and many-to-many models, thread library schedules user-level
threads to run on LWP

Known as process-contention scope (PCS) since scheduling
competition is within the process

A

Thread Scheduling

92
Q

Kernel thread scheduled onto available CPU is system-contention scope
(SCS) – competition among all threads in system

A

Thread Scheduling

93
Q

competition among all threads in system

A

system-contention scope
(SCS)

94
Q

API allows specifying either PCS or SCS during thread creation

A

Pthread Scheduling

95
Q

CPU scheduling more complex when multiple CPUs are available

A

Multiple-Processor Scheduling

96
Q

only one processor accesses the system data
structures, alleviating the need for data sharing

A

Asymmetric multiprocessing

97
Q

each processor is self-scheduling, all
processes in common ready queue, or each has its own private queue of
ready processes

A

Symmetric multiprocessing (SMP)

98
Q

process has affinity for processor on which it is
currently running

A

Processor affinity

99
Q

Recent trend to place multiple processor cores on same physical chip

A

Multicore Processors

100
Q

Faster and consume less power

A

Multicore Processors

101
Q

Multiple threads per core also growing

Takes advantage of memory stall to make progress on another thread
while memory retrieve happens

A

Multicore Processors

102
Q

Constant order O(1) scheduling time

A

Linux Scheduling

103
Q

Two priority ranges: time-sharing and real-time

A

Linux Scheduling

104
Q

Real-time range from 0 to 99 and nice value from 100 to 140

A

Linux Scheduling

105
Q

takes a particular predetermined workload and
defines the performance of each algorithm for that workload

A

Deterministic modeling

MIDTERMS 2ND YEAR 2ND SEM (11 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions