Managing out-of-order memory command execution from multiple queues while maintaining data coherency

A method for managing queues in a memory, comprising:

• operating, by a memory core controller comprising at least two queues, in a mode where a particular queue from among the at least two queues is given priority over the at least one other queue;
• responsive to being ready to select a next entry from among the at least two queues to process, for a particular entry in the particular queue being the oldest entry next in the particular queue, performing, by the memory core controller, a first logical OR operations on a plurality of bits of a particular collision vector of the particular entry, wherein the particular collision vector may comprise a number of a plurality of bits corresponding to a number of a plurality of other entries in the at least one other queue, wherein if the particular entry accesses a same address as at least one another event in the at least one other queue and the at least one another event arrived before the particular entry, at least one particular bit of the plurality of bits of the particular collision vector is already set;
• and
• the memory core controller, responsive to the first logical OR operation returning a one, operative to select an oldest entry in the at least one other queue as the next entry to process and clearing a selected bit from among the least one particular bit in a particular position of the at least one bit position corresponding with a particular row position of the oldest entry within the plurality of other entries.

A computer program product comprising one or more computer-readable non-transitory storage devices and program instructions, stored on at least one of the one or more storage devices, the stored program instructions comprising:

• program instructions to operate in a mode where a particular queue from among at least two queues is given priority over the at least one other queue;
• program instructions to, responsive to being ready to select a next entry from among the at least two queues to process, for a particular entry in the particular queue being the oldest entry next in the particular queue, perform a first logical OR operations on a plurality of bits of a particular collision vector of the particular entry, wherein the particular collision vector may comprise a number of a plurality of bits corresponding to a number of a plurality of other entries in the at least one other queue, wherein if the particular entry accesses a same address as at least one another event in the at least one other queue and the at least one another event arrived before the particular entry, at least one particular bit of the plurality of bits of the particular collision vector is already set;
• and
• program instructions to, responsive to the first logical OR operation returning a one, select an oldest entry in the at least one other queue as the next entry to process and clearing a selected bit from among the least one particular bit in a particular position of the at least one bit position corresponding with a particular row position of the oldest entry within the plurality of other entries.