Queue structure with validity vector and order array

An article, comprising:

• a storage medium having stored thereon instructions that when executed by a machine result in the following:
• initializing each bit in an n-bit validity vector to “0”;
• initializing each row[x] of an n-position queue, where x is an integer, such that any bit in a column of a two-dimensional order array before column[x] is set to “1” and any bit in a column after column[x] is set to “0”;
• writing data into position[x];
• updating bit[x] of the n-bit validity vector to indicate that position[x] contains valid data;
• updating multiple bits in row[x] of the two-dimensional order array;
• and
• updating multiple bits in column[x] of the order array,
• wherein the order array is an n-bit by n-bit array.

A method, comprising:

• initializing each bit in an n-bit validity vector to a first value;
• initializing each row[x] of an n-position queue, where x is an integer, such that any bit in a column of a two-dimensional order array before column[x] is set to a second value and any bit in a column after column[x] is set to the first value;
• writing data into position[x];
• updating bit[x] of the n-bit validity vector to indicate that position[x] contains valid data;
• updating multiple bits in row[x] of the two-dimensional order array;
• and
• updating multiple bits in column[x] of the order array,
• wherein the order array is an n-bit by n-bit array.