Scribd Logo
Upload

Welcome to Scribd!

  • Lecture 12 - CPU Scheduling Practice Problems

    Uploaded by

    Lavish Gurjar
    2 views9 pages
    The document discusses CPU scheduling techniques for multiprocessor systems. It covers symmetric multiprocessing where each processor can independently schedule processes, either from a shared ready queue or separate per-processor queues. Load balancing approaches like push and pull migration are described to distribute processes evenly across processors. The document also mentions affinity settings that influence whether processes are strictly bound or can migrate between cores, and how multicore chip designs have increased the number of logical processors.

    Original Description:

    Original Title

    Lecture 12_CPU scheduling practice problems

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses CPU scheduling techniques for multiprocessor systems. It covers symmetric multiprocessing where each processor can independently schedule processes, either from a shared ready queue or separate per-processor queues. Load balancing approaches like push and pull migration are described to distribute processes evenly across processors. The document also mentions affinity settings that influence whether processes are strictly bound or can migrate between cores, and how multicore chip designs have increased the number of logical processors.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views9 pages

    Lecture 12 - CPU Scheduling Practice Problems

    Uploaded by

    Lavish Gurjar
    The document discusses CPU scheduling techniques for multiprocessor systems. It covers symmetric multiprocessing where each processor can independently schedule processes, either from a shared ready queue or separate per-processor queues. Load balancing approaches like push and pull migration are described to distribute processes evenly across processors. The document also mentions affinity settings that influence whether processes are strictly bound or can migrate between cores, and how multicore chip designs have increased the number of logical processors.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 9

    Operating System Concepts

    Lecture 12: Practice problems on CPU scheduling

    Dr Avani Vyas
    SRTF
    SRTF
    Thread Scheduling
    Contention Scope

    • Process Contention Scope (PCS)

    • System Contention Scope (SCS)


    Multiprocessor Scheduling

    • Load sharing is possible.

    • Approaches to Multi-Processor Scheduling

    • Asymmetric multiprocessing

    • Master processor handles scheduling

    • Symmetric multiprocessing

    • Each processor is self scheduling

    • Either each processor can take process from ready queue.

    • Or, each processor can have its own ready queue.


    Symmetric Multiprocessing
    Processor a nity

    • Soft a nity

    • Hard a nity
    ffi
    ffi
    ffi
    Symmetric
    Load balancing

    • Push migration

    • A speci c task periodically checks load

    • Pull migration

    • An idle processor pulls a waiting task.


    fi
    Multicore Processors

    • Many recent hardware designs have implemented multithreaded processor


    cores

    • dual-threaded, dual-core system means four logical processors.

    You might also like