First in, first out (FIFO) memory queue architecture enabling a plurality of writers and a single reader to use the queue without mutual exclusive locking. The FIFO queue is implemented using an array. A write counter value associated with the array provides a reservation value to each writer that is mutually exclusive of the value provided to every other writer. A read counter value associated with the array prevents writers from writing over data messages stored in the array that are yet to be read by the single reader.