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.