Scribd Logo
Upload

Welcome to Scribd!

  • Application o Queue

    Uploaded by

    Saksham Arora
    7 views1 page
    This document discusses several examples where queues are used to efficiently manage shared resources and asynchronous processes. Queues are used to schedule tasks on a shared CPU, hold callers waiting for the next available call center representative, handle interrupts in real-time systems on a first-come first-served basis, buffer asynchronous data transfers between processes such as I/O, pipes and file I/O, and aid the breadth-first search graph traversal algorithm by maintaining processing order.

    Original Description:

    Original Title

    application o queue.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses several examples where queues are used to efficiently manage shared resources and asynchronous processes. Queues are used to schedule tasks on a shared CPU, hold callers waiting for the next available call center representative, handle interrupts in real-time systems on a first-come first-served basis, buffer asynchronous data transfers between processes such as I/O, pipes and file I/O, and aid the breadth-first search graph traversal algorithm by maintaining processing order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Application o Queue

    Uploaded by

    Saksham Arora
    This document discusses several examples where queues are used to efficiently manage shared resources and asynchronous processes. Queues are used to schedule tasks on a shared CPU, hold callers waiting for the next available call center representative, handle interrupts in real-time systems on a first-come first-served basis, buffer asynchronous data transfers between processes such as I/O, pipes and file I/O, and aid the breadth-first search graph traversal algorithm by maintaining processing order.

    Copyright:

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

    1.

    Serving requests on a single shared resource, like a printer, CPU task scheduling

    etc.

    2. In real life, Call Center phone systems will use Queues, to hold people calling them

    in an order, until a service representative is free.

    3. Handling of interrupts in real-time systems. The interrupts are handled in the same

    order as they arrive, First come first served..

    4 When data is transferred asynchronously (data not necessarily received at same rate as sent)

    between two processes. Examples include IO Buffers, pipes, file IO, etc.

    5 Queue is used in BFS(Breadth First Search) algorithm. It helps in traversing a


    tree or graph.

    You might also like