Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Lecture 23

    Uploaded by

    YASH KAMRA
    The document discusses the readers-writers problem, where multiple readers can access a shared data set simultaneously, but only one writer can access it at a time. It involves semaphores to control access to the data. Readers use a semaphore to indicate they are reading and check if any writers are currently writing. Writers must acquire exclusive access using another semaphore before writing. There can be variations in priority and avoiding starvation of waiting processes.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Lecture 23

    Uploaded by

    YASH KAMRA
    13 views7 pages
    The document discusses the readers-writers problem, where multiple readers can access a shared data set simultaneously, but only one writer can access it at a time. It involves semaphores to control access to the data. Readers use a semaphore to indicate they are reading and check if any writers are currently writing. Writers must acquire exclusive access using another semaphore before writing. There can be variations in priority and avoiding starvation of waiting processes.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the readers-writers problem, where multiple readers can access a shared data set simultaneously, but only one writer can access it at a time. It involves semaphores to control access to the data. Readers use a semaphore to indicate they are reading and check if any writers are currently writing. Writers must acquire exclusive access using another semaphore before writing. There can be variations in priority and avoiding starvation of waiting processes.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    13 views7 pages

    Lecture 23

    Uploaded by

    YASH KAMRA
    The document discusses the readers-writers problem, where multiple readers can access a shared data set simultaneously, but only one writer can access it at a time. It involves semaphores to control access to the data. Readers use a semaphore to indicate they are reading and check if any writers are currently writing. Writers must acquire exclusive access using another semaphore before writing. There can be variations in priority and avoiding starvation of waiting processes.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 7

    Readers-Writers Problem

     A data set is shared among a number of concurrent processes


     Readers – only read the data set; they do not perform any updates
     Writers – can both read and write
     Problem – allow multiple readers to read at the same time
     Only one single writer can access the shared data at the same
    time
     Several variations of how readers and writers are considered – all
    involve some form of priorities
     Shared Data
     Data set
     Semaphore rw_mutex initialized to 1 (common to both readers &
    writers, it provides mutual exclusion for writers, it is also used by
    first or last reader that enters or exits the CS, it is not used by
    readers who enter or exit while other readers are in their CS)
     Semaphore mutex initialized to 1 (ensures mutual exclusion
    when read_count is updated )
     Integer read_count initialized to 0 (how many processes are
    reading/number of readers)

    Operating System Concepts – 9th Edition 5.1 Silberschatz, Galvin and Gagne
    Readers-Writers Problem (Cont.)

     The structure of a writer process

    do {
    wait(rw_mutex);
    ...
    /* writing is performed */
    ...
    signal(rw_mutex);
    } while (true);

    Operating System Concepts – 9th Edition 5.2 Silberschatz, Galvin and Gagne
    Readers-Writers Problem (Cont.)
     The structure of a reader process
    do {
    wait(mutex);
    read_count++;
    if (read_count == 1)
    wait(rw_mutex);
    signal(mutex);
    ...
    /* reading is performed */
    ...
    wait(mutex);
    read count--;
    if (read_count == 0)
    signal(rw_mutex);
    signal(mutex);
    } while (true);

    Operating System Concepts – 9th Edition 5.3 Silberschatz, Galvin and Gagne
    Readers-Writers Problem Variations
     First variation – no reader kept waiting unless
    writer has permission to use shared object
     Second variation – once writer is ready, it
    performs the write ASAP
     Both may have starvation leading to even
    more variations
     Problem is solved on some systems by kernel
    providing reader-writer locks
     Reader-writer lock in read mode: Multiple
    processes are permitted concurrently
     Reader-writer lock in write mode: Only one
    process may acquire the lock for writing

    Operating System Concepts – 9th Edition 5.4 Silberschatz, Galvin and Gagne
    Dining-Philosophers Problem

     Philosophers spend their lives alternating thinking and


    eating
     Don’t interact with their neighbors, occasionally try to
    pick up 2 chopsticks (one at a time) to eat from bowl
     Need both to eat, then release both when done
     In the case of 5 philosophers
     Shared data
     Bowl of rice (data set)
     Semaphore chopstick [5] initialized to 1

    Operating System Concepts – 9th Edition 5.5 Silberschatz, Galvin and Gagne
    Dining-Philosophers Problem Algorithm
     The structure of Philosopher i:
    do {
    wait (chopstick[i] );
    wait (chopStick[ (i + 1) % 5] );

    // eat

    signal (chopstick[i] );
    signal (chopstick[ (i + 1) % 5] );

    // think

    } while (TRUE);
     What is the problem with this algorithm?

    Operating System Concepts – 9th Edition 5.6 Silberschatz, Galvin and Gagne
    Dining-Philosophers Problem Algorithm (Cont.)

     Deadlock handling
     Allow at most 4 philosophers to be sitting
    simultaneously at the table.
     Allow a philosopher to pick up the forks
    only if both are available (picking must be
    done in a critical section.
     Use an asymmetric solution -- an odd-
    numbered philosopher picks up first the
    left chopstick and then the right chopstick.
    Even-numbered philosopher picks up first
    the right chopstick and then the left
    chopstick.

    Operating System Concepts – 9th Edition 5.7 Silberschatz, Galvin and Gagne

    You might also like