Message Queues (IPC)


Message Queues
  • Either one task or group of tasks can use the queue
  • Usually queue is circular. elements are accessed by means of FIFO.
  • Printer task is an example
Queue
  • Initialization before using the function
  • provision for multiple queues. each queue will be having an ID
  • size of the queue is either user defined or predefined by the scheduler
  • There may be a need for error handler, when a queue is full.

Comments

  1. can u provide me a simple c program on msg q

    how to initialize a q?
    how to send a msg?
    how to receive a msg?
    how do we know that queue is full?
    what happens if the queue is full and how to avoid it?
    plz send me the required material

    regards
    kartheek

    ReplyDelete

Post a Comment

Popular Posts