Chapter 18 Flashcards

1
Q

how we can change nice value of priority

A

By nice command

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

Does round robin algorithm suits for time sharing system

A

Yes

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

What are 2 methods for algorithm evaluation

A
  1. Analytic Evaluation

2. Implementation

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

What is Analytic Evaluation

A

The algorithm and some system workload are used to produce a formula which gives the performance of the algorithm for that workload.

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

What are 3 ways in analytic evaluation

A
  1. Deterministic modeling (compare workloads for algorithms)
  2. Simulation
  3. Queuing models (use mathematical formulas)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is Implementation

A

Implement all these algorithms in real system and give these systems to actual users to see response.

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

What is queuing modeling

A

Computer system viewed as a network of queues and servers: ready queue, I/O queue, event queues, CPUs, I/O device controllers, etc.

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

What is simulation

A

Programming model for the computer system

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

What is shared data serialization

A

If there are multiple process want to access same data, we make sure only one process access data at one time.

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

What is bounded-buffer problem (producer and consumer problem)

A

Bounded buffer problem, which is also called producer consumer problem, is one of the classic problems of synchronization.
A producer tries to insert data into an empty slot of the buffer. A consumer tries to remove data from a filled slot in the buffer. As you might have guessed by now, those two processes won’t produce the expected output if they are being executed concurrently.
There needs to be a way to make the producer and consumer work in an independent manner.

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

What is the solution of bounded-buffer problem

A

One of the solution is use of counter variable that keep records how much slots are in use. Counter variable is shared variable. Which slots are being in use, will tell an in variable that keep record of index value of that slot.

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

What is race condition

A

It is related to synchronization problem. the situation where several processes access and manipulate shared data concurrently, the final value of the data depends on which process finishes last.

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

What is critical section

A

A piece of code in a cooperating process in which the process may try to access shared data (e.g. variable, database, file etc)

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

What is critical section problem

A

Serialize executions of critical sections in coorporating processes

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

What are 3 solutions of critical problem

A
  • Software based solutions
  • Hardware based solutions
  • Operating system based solutions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the structure of solutions of critical problem

A

It has 2 parts

  1. Entry section
  2. Exit section