Queueing Theory for Embedded Systems Designers

This technical paper by veteran embedded software instructor David Kalinsky examines the queueing calculations that should be done as part of the design of application software for embedded systems. These calculations serve to properly design message queues, linked lists, ring buffers, memory pools and partitions. Both capacity and queueing delay time issues are discussed, with emphasis on practical examples rather than mathematical proofs.

View Entire Paper | Previous Page | White Papers Search

If you found this page useful, bookmark and share it on: