Replace linked list/deque in server loop with plain array

[TheHashTableSlasher]

Instead of using a queue proper, we can just use a dynamic array and clear it every time we read from it (since all inputs are consumed at once)

[TheHashTableSlasher]

Actually, if we wish to re-implement the ability to get only the first n updates from the server, this may not be such a good idea. Thoughts? @cuihantao

Relevant feature in original DiME:

% Checks to see if there are any messages from the server and receives up to
% max_msg messages. If not specified, max_msg defaults to 3.
d.sync()
d.sync(max_msg)

[cuihantao]

In use cases, we will always read the first n variables in the queue (or the storage), as described.

[TheHashTableSlasher]

Okay, in that case I will close this and open a new issue for that.