Brainscape's Knowledge GenomeTM

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


See full index

CS 332-102 > Ch. 10 PPT > Flashcards

Ch. 10 PPT Flashcards

1
Q

What is a loosely coupled/distributed/clustered system?

A

One that has a collection of relatively autonomous systems, each with its own main memory and I/0

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

What is a functionally specialized processor?

A

There is a master processor that directs specialized processors

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

What is a tightly coupled multiprocessor?

A

One that consists of a set of processors that share main memory and are under the integrated control of an OS

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

What is independent parallelism?

A

There is no explicit synchronization among processes; processes are independent. Used in time-sharing systems

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

What is coarse/very coarse grained parallelism?

A

There os synchronization among processes, but at a very gross level.

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

What is medium grained parallelism?

A

A single application can effectively be implemented as a collection of threads within a single process. Requires coordination

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

What is fine grained parallelism?

A

A complex use of parallelism that transcends threads. It’s specialized and fragmented with many approaches

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

What are parallelism design issues?

A

The dispatching of a process, use of multiprogramming on individual processors, and the assignment of processes to processors.

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

What is bad of assignment of processes to processors?

A

One might be idle while another has a backlog

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

What is an approach to processes to processors?

A

Master/slave, or peers

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

What is a master?

A

Something that is responsible for scheduling

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

What is a slave?

A

Something that sends requests to the master

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

What is good about master/slave?

A

Simple and requires little enhancement to a uniprocessor OS

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

What is bad about master/slave?

A

The master failing brings down the whole system, master can bottleneck

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

What is peer architecture?

A

The kernel can execute on any processor and each processor does self scheduling. Can complicate the OS

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

What are the approaches to thread scheduling?

A

Load sharing, dedicated processor, dynamic scheduling, and gang scheduling

17
Q

What is load sharing?

A

Processes are not assigned to a particular processor. Process switching can cause bottlenecking when switching threads

18
Q

What is gang scheduling?

A

Simultaneous scheduling of the threads that make up a process

19
Q

What is thread dedicated processor assignment?

A

All threads execute on the same processor for a particular process. There is no multiprogramming of processors

20
Q

What is dynamic thread scheduling?

A

Changing the number of threads in the process periodically

21
Q

What is cooperative resource sharing?

A

Threads have access to the same set of main memory locations

22
Q

What is resource contention?

A

Threads compete for cache memory locations

23
Q

What is a hard real time task?

A

One that must meet a deadline

24
Q

What is a soft real time task?

A

One that has a deadline, but it is not mandatory. Scheduling will occur regardless

25
Q

What is an aperiodic task?

A

One that has a deadline and/or a constraint start/stop time

26
Q

What is determinism?

A

How long an OS delays before acknowledging an interrupt

27
Q

What is responsiveness?

A

How long after an interrupt is acknowledged it takes the OS to service the interrupt

28
Q

What is user control?

A

Allowing the user to have fine-grained control over hard and soft tasks, and the priorities of each

29
Q

What is reliability?

A

Important for real time systems, avoiding catastrophic consequences that can lead to losses

30
Q

What is fail soft operation?

A

Trying to preserve as much capability and data as possible when a system fails

31
Q

What is deadline scheduling?

A

Scheduling based more upon deadlines and importance rather than efficiency in real time systems

32
Q

What is priority inversion?

A

When something occurs that forces a high priority task to wait for a low priority one

33
Q

What is thread mitigation?

A

Reassigning threads to the same processor once they’re ready again for the sake of the cache.

CS 332-102 (11 decks)

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