OS CPU

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/56

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 7:57 PM on 8/26/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

57 Terms

1
New cards

the operating system works closely with?

processor, processes, and threads

2
New cards

Processor

executes instructions

3
New cards

Thread

performs a sequence of instructions within a process

4
New cards

allows multiple tasks to make progress during overlapping periods

Concurrency

5
New cards

A processor

also known as the Central Processing Unit (CPU), is the hardware component that executes instructions from computer programs.

6
New cards

Why the Processor Is Important

Without a processor, software programs cannot execute instructions. Applications such as browsers, games, operating systems, and office software all depend on processor resources

7
New cards

instruction cycle.

The CPU generally processes instructions through

8
New cards

Fetch

The processor retrieves an instruction from memory.

9
New cards

Decode

The processor determines what the instruction means and what operation must be performed

10
New cards

Execute

The processor performs the required operation.

11
New cards

Store

The result is stored in a register or memory.

12
New cards

Arithmetic Logic Unit

performs arithmetic and logical operations

13
New cards

Control Unit (CU)

coordinates the activities of the processor

14
New cards

Registers

are very small and very fast storage locations inside the processor

15
New cards

Program Counter (PC)

Contains the address of the next instruction.

16
New cards

Instruction Register (IR)

Contains the instruction currently being processed.

17
New cards

General-Purpose Registers

Store temporary data used during computation

18
New cards

Registers

are faster than ordinary RAM because they are located directly within the processor

19
New cards

Cache memory

is high-speed memory used to store frequently accessed data and instructions.

Common cache levels include

20
New cards

L1 Cache

⦁ Very fast

⦁ Small capacity

⦁ Closest to the CPU core

21
New cards

L2 Cache

⦁ Larger than L1

⦁ Slightly slower

22
New cards

L3 Cache

⦁ Larger than L1 and L2

⦁ Often shared among CPU

23
New cards

If frequently used information is already in cache, the CPU can access it faster instead of retrieving it from slower main memory.

Cache Is Important

24
New cards

CPU core

is an individual processing unit within a processor

25
New cards

Clock speed

indicates how quickly a processor's clock operates.

26
New cards

quad-core

processor has four processing cores

This allows multiple threads to potentially execute simultaneously.

27
New cards

More CPU cores

Having BLANK does not automatically make every program faster. The software must be designed to take advantage of multiple cores.

28
New cards

⦁ MHz – megahertz

⦁ GHz – gigahertz

Clock speed is commonly measured in:

29
New cards

process

is a program that is currently executing

30
New cards

Process Control Block (PCB).

The operating system maintains information about processes through a structure commonly

31
New cards

When the operating system switches between processes, it needs to save and restore information about each process. The PCB helps the operating system manage this information

Why PCB Is Important

32
New cards

New

The process is being created.

33
New cards

Ready

The process is waiting for CPU time.

34
New cards

Running

The process is currently being executed by the CPU.

35
New cards

Waiting/Blocked

The process is waiting for an event or resource.

36
New cards

Terminated

The process has finished execution.

37
New cards

Basic Flow

New

↓

Ready

↓

Running

↓

Terminated

38
New cards

thread

is the smallest unit of execution that can be scheduled by an operating system

39
New cards

Why Threads Are Used

allow an application to perform different activities without requiring a separate process for every activity

40
New cards

single-threaded process

has one thread of execution.

41
New cards

multithreaded process

contains multiple threads.

42
New cards

Responsiveness

The application can continue responding while another thread performs a background task.

43
New cards

Resource Sharing

Threads within the same process can share memory and resources.

44
New cards

Economy

Creating threads generally requires fewer resources than creating separate processes.

45
New cards

Scalability

Multithreaded applications can take advantage of multiple CPU cores.

46
New cards

Complexity

Programs become more difficult to design and debug.

47
New cards

Deadlocks

Threads may become permanently blocked.


48
New cards

Race Conditions


Threads may interfere with shared data.


49
New cards

Synchronization Overhead


Locks and other synchronization mechanisms can reduce performance if used excessively.


50
New cards


User-level threads

are managed by a user-level thread library or runtime environment

51
New cards

Advantages of User-level threads

⦁ Fast thread management

⦁ Lower overhead

⦁ Flexible implementation

52
New cards

disadvantages of User-level threads

⦁ Limited kernel awareness

⦁ Blocking behavior can be problematic in some models

⦁ Parallel execution depends on the underlying threading model

53
New cards

Kernel-level threads

are managed directly by the operating system kernel.

The operating system can schedule individual threads.

54
New cards

Advantages Kernel-Level Threads

⦁ Better support for multicore systems

⦁ Individual threads can be scheduled

⦁ A blocked thread does not necessarily block other threads

55
New cards

Disadvantages Kernel-level threads

⦁ More operating-system overhead

⦁ Thread management can be more expensive

56
New cards

Concurrency

to manage multiple tasks during overlapping periods of time.

Concurrency does not necessarily mean that tasks execute at exactly the same moment

57
New cards

Parallelism

means executing multiple tasks at the same time using multiple processing resources.