Brainscape's Knowledge GenomeTM

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


See full index

Programming > cse4600 Exam 2 > Flashcards

cse4600 Exam 2 Flashcards

1
Q

What does PF stand for and what does it do?

A

Priority Function; The decision for which process will be allowed to execute

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

What does AR stand for and what does it do?

A

Arbitration Function; When two processes with equal priority are too be scheduled

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

What does DM stand for and what does it do?

A

Dynamic priority Measures; Parameters that change over time

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

Name some system measures that may determine priority level

A 
external priority
total service time
deadline
real-time in the system
memory requirements
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is turnaround time

A

Total time between the submission of the process for execution and the return of the complete output

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

What is waiting time

A

amount of time a job is sitting ideal before the process is used

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

First in First out - Pros and Cons

A 
Pro
- Easy to implement
- Ignores service time
Cons
- Not a great performer
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

First in First out PF

A

P = r, where r is the amount of real time

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

First in First out DM

A

Non - Preemptive

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

First in First out AR

A

random choice among processes arriving at exactly the same time

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

Shortest Job First PF

A

P = -t, where t is the total service time

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

Shortest Job First DM

A

Non - Preemptive

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

Shortest Job First AR

A

either chronological or random among processes with same service time

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

Shortest Remaining Time PF

A

P = - (t - a), where t-a is the remaining time

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

Shortest Remaining Time DM

A

Preemptive

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

Shortest Remaining Time AR

A

chronological or random among processes with same service time

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

Round Robin PF

A

P = 0, all processes have the same priority

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

Round Robin DM

A

preemptive quantum oriented

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

Round Robin AR

A

cyclic

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

Multilevel Priority PF

A

P = e

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

Multilevel Priority DM

A

preemptive if newly arriving process has a higher priority

within each priority queue, scheduling may be preemptive RR or non-preemptive FIFO

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

Multilevel Priority AR

A

cyclic if RR, random/chronological if FIFO

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

Multilevel Feedback PF

A

function of attained service time with different implementations possible

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

Multilevel Feedback DM

A

preemptive or non-preemptive; processes in the same level may use RR or FIFO

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

Multilevel Feedback AR

A

cyclic or random/chronological

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

Rate Monotonic PF

A

P = -d, where d is a fixed period of time that process needs to use the cpu

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

Rate Monotonic DM

A

preemptive

28
Q

Rate Monotonic AR

A

random or chronological

29
Q

Earliest Deadline First PF

A

P = -(d-r%d), where

r is the time since process first entered the system

d is its period

30
Q

Earliest Deadline First DM

A

preemptive and dynamic

31
Q

Earliest Deadline First AR

A

random or chronological

32
Q

What is a time quantum

A

amount of timeshare (timeslice) given to each process, interrupting the job if it is not completed by then

33
Q

What is throughput

A

the number of processes that are completed per time unit

34
Q

What is response time

A

the time it takes to start responding, from the submission of the request until the first response is produced

35
Q

What is turnaround time

A

from the time of submission of a process to the time of completion

36
Q

What is waiting time

A

the sum of the periods spent waiting in the ready queue

37
Q

What is burst time

A

the amount of time the process uses the processor before it is no longer ready

38
Q

What is priority inversion

A

when a low priority process blocks a high priority process from executing because the low priority process is being preempted by a medium process

39
Q

Shortest Job First - Pro

A

provably optimal, results in minimum average waiting time

40
Q

Round Robin - Pro and Con

A

Pro
- better response than SJF
Con
- higher average turnaround

41
Q

What is the equation for schedulability

A

n ( 2^1/n - 1 )

42
Q

Primary use for Earliest Deadline First?

A

For real-time systems

43
Q

When is a schedule feasible?

A

When all deadlines are satisfied

44
Q

What is a method optimal?

A

If it always produces a feasible schedule if one exists

45
Q

Rate Monotonic - Pros

A
  • Simpler implementation

- Predicability for the highest priority

46
Q

Earliest Deadline First - Pros

A
  • Full processor utilizaiton

- Misbehavior during overload conditions

47
Q

For Eventcount, what does await(E, v) do?

A

suspends the calling process if E < v; otherwise it allows the process to proceed

48
Q

For Eventcount, what does advance(E) do?

A

eventcount value E is incremented and next process is admitted for service

49
Q

For Eventcount, what does read(E) do?

A

inspects the current value of E

50
Q

What does a monitors condition variable wait() do?

A

causes the executing process to be suspended on the queue

51
Q

What does a monitors condition variable signal() do?

A

wakes up a process thats waiting on CV

52
Q

What does a monitors condition variable queue() do?

A

true if queue is not empty, false if no process is waiting in the queue

53
Q

For Mesa Semantics the thread that signals

A

keeps the lock

54
Q

For Mesa Semantics the waiting thread

A

waits for the lock

55
Q

For Hoare Semantics the thread that signals

A

gives up the lock and the waiting thread gets the lock

56
Q

T/F: Hoare uses if rather than while

A

True

57
Q

T/F: Mesa uses if rather than while

A

False

58
Q

T/F: Monitors provide mutual exclusion between all procedures between shared data

A

True

59
Q

For a producer/consumer problem why is
P(mutex)
P(full)
incorrect?

A

Because it will set Full variable and mutex variable to -1 and both Producer and Consumer will wait

60
Q

What is a weak reader

A

an arriving writer waits until there are no more active readers

61
Q

What is a strong reader

A

waiting reader has priority over a waiting writer

62
Q

What is writer priority?

A

an arriving reader waits until there are no more active or waiting writers

63
Q

Counting semaphores are used

A

to manage limited resources and corresponding access to them

64
Q

Binary semaphores are usually used

A

to facilitate mutual exclusion

65
Q

P(s) =

A

wait(s) = down(s)

66
Q

V(s) =

A

signal(s) = up(s)

Programming (15 decks)

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