Hands-On Software Engineering with Golang

Queueing and delivering messages

One of the core ideas of the BSP model is that graph components communicate with each other by exchanging messages. The fact that each vertex in the graph can potentially receive multiple messages mandates the introduction of some sort of abstraction for storing or queuing incoming messages until they are ready to be processed by the intended recipient.

In the three sections that follow, we will kick off our design discussion by defining the required interfaces for modeling messages and queues. Then, we will take a stab at implementing a simple, concurrent-safe in-memory queue.