Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    P - Scan: A Seminar On

    Uploaded by

    kaushal_bksc
    The document discusses the P-SCAN algorithm for scheduling real-time transactions. [1] P-SCAN assigns priorities to transactions based on their deadlines, with the lowest deadlines receiving the highest priority. [2] Transactions are then served in priority order from highest to lowest. [3] An example is provided to illustrate how P-SCAN would schedule 8 transactions more effectively than previous algorithms like SCAN, EDF, and FD-SCAN by meeting deadlines and maximizing throughput.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    P - Scan: A Seminar On

    Uploaded by

    kaushal_bksc
    27 views16 pages
    The document discusses the P-SCAN algorithm for scheduling real-time transactions. [1] P-SCAN assigns priorities to transactions based on their deadlines, with the lowest deadlines receiving the highest priority. [2] Transactions are then served in priority order from highest to lowest. [3] An example is provided to illustrate how P-SCAN would schedule 8 transactions more effectively than previous algorithms like SCAN, EDF, and FD-SCAN by meeting deadlines and maximizing throughput.

    Original Title

    8.P-SCAN1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the P-SCAN algorithm for scheduling real-time transactions. [1] P-SCAN assigns priorities to transactions based on their deadlines, with the lowest deadlines receiving the highest priority. [2] Transactions are then served in priority order from highest to lowest. [3] An example is provided to illustrate how P-SCAN would schedule 8 transactions more effectively than previous algorithms like SCAN, EDF, and FD-SCAN by meeting deadlines and maximizing throughput.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    27 views16 pages

    P - Scan: A Seminar On

    Uploaded by

    kaushal_bksc
    The document discusses the P-SCAN algorithm for scheduling real-time transactions. [1] P-SCAN assigns priorities to transactions based on their deadlines, with the lowest deadlines receiving the highest priority. [2] Transactions are then served in priority order from highest to lowest. [3] An example is provided to illustrate how P-SCAN would schedule 8 transactions more effectively than previous algorithms like SCAN, EDF, and FD-SCAN by meeting deadlines and maximizing throughput.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 16

    A

    seminar
    on

    P – SCAN

    Presented by Guided by
    Yogesh Rampure Prof. S.Y.Amdani
    Final yr.CSE
    B.N.College of Engg.,Pusad
    CONTENTS
    1. Overview of previous algorithm
    2. Introduction to P-SCAN
    3. What is Priority ?
    4. How priority is decided?
    5. Flow of algorithm
    6. Example
    7. Advantages
    8. Conclusion
    9. References
    •Previous algorithms

    SCAN

    EDF

    FD-SCAN
    •Overview of previous algorithm

    SCAN
    EDF
    FD-SCAN

     violets real time constraints


     less throughput
     large disk head movement
    •Introduction

    • Itis a PRIORITY SCAN.


    • Highest, middle, lowest priority

    • Priority depends on the deadlines

    • Highest priority- low deadline

    • Lowest priority-high deadline


    •How priority is decided?

    • Deadline>= (highest dl+low dl)/2


    lowest priority

    • Deadline<= (highest dl+low dl)/4


    Highest priority

    • Remaining given Middle priority


    Flow of Algorithm:-
    Example:-
    Assumptions:-
    i)Transaction ID
    ii)Released Time
    iii)Block Location
    iv)Block Size
    v)Start Index
    vi)End Index
    vii)Slack Factor=2
    viii)Seek factor=0.3
    Example:-
    Transaction Released Block Block Start End Average Deadline Transfer
    ID Time Location Size Index Index Execution (ri + slack Time
    (ri) (BS) Time(AET) factor * AET) (0.6*BS)
    (1.5*BS)

    T0 0 0 0 0 0 0 0 0

    T1 3 14 3 14 17 4.5 10 1.8

    T2 0 7 2 7 9 3 6 1.2

    T3 4 9 2 9 11 3 9 1.2

    T4 5 20 5 20 25 7.5 20 3

    T5 4 17 3 17 20 4.5 13 1.8

    T6 0 2 1 2 3 1.5 3 0.6

    T7 1 5 1 5 6 1.5 4 0.6

    T8 2 12 2 12 14 3 8 1.2
    D e a d l in e
    25

    20
    20 T0
    T1
    15 T2
    13 T3
    10 T4
    10 9
    8 T5
    6 T6
    5 3 4 T7
    T8
    0
    0
    T0 T1 T2 T3 T4 T5 T6 T7 T8
    •Example(conti…)

    Highest: ((0+20)/4)=5 => (T0,T6,T7)


    Middle: => (T2,T3,T8)
    Lower: ((0+20)/2)=10 => (T1,T4,T5)
    Sequences According to-

    P-SCAN:-
    T0,T6,T7,T2,T8,T3,T1,T5,T4
    P-SCAN=>T0, T6,T7,T2,T8,T3,T1,T5,T4
    •Advantage

     Relatively large throughput


     Relatively large number of hits
     Good for scheduling
    •CONCLUSION

     P-SCAN is very best for scheduling rather than


    previous algorithms
     Relatively large number of hits

     Good for scheduling


    Thank you
    ANY QUERIES???

    You might also like