OS Organization Chapter 9: Uni-processor Scheduling

Home > Preview

The flashcards below were created by user geschw66 on FreezingBlue Flashcards.


  1. Short-term Scheduling: which algorithm is described by: Select the process with the shortest expected processing time and do not preempt the process.
    Shortest Process Next (SPN)
  2. Short-term Scheduling: which algorithm is described by: Use time slicing to limit any running process to a short burst of processor time, and rotate among all ready
    processes.
    Round Robin (RR)
  3. Short-term Scheduling: which algorithm is described by: Select the process that has been waiting the longest for service.
    First Come First Served (FCFS).
  4. Short-term Scheduling: which algorithm is described by: Select the process with the shortest expected remaining process time. a process may be preempted when another process becomes ready.
    Shortest remaining  time (SRT)
  5. Short-term Scheduling: which algorithm is described by: Base the scheduling decision on an estimate of the normalized turn around time.
    Highest Response Ratio Next (HRRN)
  6. Short-term Scheduling: which algorithm is described by: Establish  a set of scheduling queues and allocate processes to queues based on execution history and other criteria.
    Feedback
  7. Three types of scheduling decisions that the OS must make are:
    • Long-term scheduling
    • Short-term scheduling
    • Medium-term scheduling
  8. Short-term scheduling is concerned with determining:
    which ready process will be executed next by the processor.
  9. Long-term scheduling is concerned with determining:
    when new processes are admitted to the system.
  10. Medium-term scheduling is concerned with:
    the swapping function and determines when a program is brought partially or fully into main memory so that it may be executed.
  11. Short term scheduling criteria: Turnaround time:
    This is the interval of time between the submission of a process and its completion
  12. Short term scheduling criteria: Response time:
    For an interactive process, this is the time from the submission of a request until the response begins.
  13. Short term scheduling criteria: Deadlines:
    When process completion deadlines can be specified, the scheduling discipline should subordinate other goals to that of maximizing the percentage of deadlines met.
  14. List scheduling criteria that is User Oriented, and Performance Related
    • Turnaround time
    • Response time
    • Deadlines
  15. List scheduling criteria that is User Oriented, and has other orientation.
    Predictability
  16. List scheduling criteria that is both System Oriented and Performance Related
    • Throughput
    • Processor utnilization
  17. Short term scheduling criteria:Throughput:
    The scheduling policy should attempt to maximize the number of processes completed per unit of time
  18. Short term scheduling criteria:Processor Utilization
    This is the perentage of time that the processor is busy.
  19. List the scheduling criteria that is System Oriented, and has other orientations
    • Fairness
    • Enforcing priorities
    • Balancing resources
  20. Short term scheduling criteria:Fairness:
    In the absence of guidance from the user or other system-supplied guidance, processes should be treated the same and no process should suffer from starvation.
  21. Short term scheduling criteria: Enforcing priorities:
    When processes are assigned priorities, the scheduling policy should favor higher priority processes.
  22. Short term scheduling criteria:Balancing resources:
    The scheduling policy should keep the resources of the system busy. Processes that underutilized stressed resources should be favored.
  23. Scheduling Algorithms: the ____ function determines which process, among ready processes is selected next for the execution.

    A. Priority
    B. Timing
    C. FCRC
    D. Selection
    E. None of the above
    D. Selection
    (this multiple choice question has been scrambled)

Card Set Information

Author:
geschw66
ID:
319985
Filename:
OS Organization Chapter 9: Uni-processor Scheduling
Updated:
2016-05-10 18:54:35
Tags:
OS Organization Computer Science
Folders:

Description:
CSE422 OS Organization class Spring 2016 at WUSTL.
Show Answers:

Home > Flashcards > Print Preview