Notes - MIECT
Sistemas De Operação
Notes - MIECT
Sistemas De Operação
  • Sistemas de Operação
  • Processes in Unix/Linux
    • Process
    • Multiprocessing vs. Multiprogramming
    • Processes in Unix
    • Execution of a C/C++ program
  • Introduction to operating systems
    • Global view
    • Evolution of computational systems
    • Key topics
  • Semaphores and Shared memory
    • Concepts
    • Semaphores
    • Shared memory
    • Unix IPC primitives
  • Threads, mutexes and condition variables in Unix/Linux
    • Threads
      • In linux
    • Monitors
    • Unix IPC primitives
  • Processes
    • Process
      • Diagrams
    • Process control table
    • Context switching
    • Threads
  • Processor Scheduling
    • Processor Scheduler
    • Short-term processor scheduler
    • Scheduling algorithms
    • Scheduling criteria
    • Priorities
    • Scheduling policies
      • In Linux
  • Interprocess communication
    • Concepts
    • Philosopher dinner
    • Access primitives
      • Software solutions
      • Hardware solutions
    • Semaphores
    • Monitors
    • Message-passing
    • Unix IPC primitives
  • Deadlock
    • Introduction
    • Philosopher dinner - Solution 1
      • Deadlock prevention
    • Philosopher dinner - Solution 2
      • Deadlock prevention
    • Philosopher dinner - Solution 3
      • Deadlock prevention
    • Philosopher dinner - Solution 4
    • Deadlock avoidance
    • Deadlock detection
  • Memory management
    • Introduction
    • Address space
    • Contiguous memory allocation
    • Memory partitioning
    • Virtual memory system
    • Paging
    • Segmentation
    • Combining segmentation and paging
    • Page replacement
      • Policies
    • Working set
    • Thrashing
    • Demand paging vs. preparing
Powered by GitBook
On this page
  • User-oriented scheduling criteria
  • Turnaround time
  • Waiting time
  • Response time
  • Deadlines
  • Predictability
  • System-oriented scheduling criteria
  • Fairness
  • Throughput
  • Processor utilization
  • Enforcing priorities
  1. Processor Scheduling

Scheduling criteria

User-oriented scheduling criteria

Turnaround time

Interval of time between the submission of a process/job and its completion (includes actual execution time plus time spent waiting for resources, including the processor).

  • the appropriate measure for a batch job.

  • should be minimized.

Waiting time

Sum of periods spent by a process waiting in the ready state.

  • should be minimized.

Response time

Time from the submission of a request until the response begins to be received.

  • appropriate measure for an interactive process.

  • should be minimized.

  • but also the number of interactive processes with acceptable response time should also be maximized.

Deadlines

Time of completion of a process.

  • percentage of deadlines met should be maximized, even subordinating other goals.

Predictability

How response is affected by the load on the system.

  • A given job should run in about the same amount of time and at about the same cost regardless of the load on the system.

System-oriented scheduling criteria

Fairness

Equality of treatment.

  • In the absence of guidance, processes should be treated the same, and no process should suffer starvation.

Throughput

Number of processes completed per unit of time.

  • measures the amount of work being performed by the system.

  • should be maximized.

  • depends on the average lengths of processes but also on the scheduling policy.

Processor utilization

Percentage of time that the processor is busy.

  • should be maximized (especially in expensive shared systems).

Enforcing priorities

Higher-priority processes should be favoured.

As referred to before, it is impossible to satisfy all criteria simultaneously.

PreviousScheduling algorithmsNextPriorities

Last updated 2 years ago