Implementing quick-release VLV memory access array

A method for implementing a quick-release Variable Length Vector (VLV) memory access array, comprising:

• each time when a pipeline restarts to refresh an out-of-order queue, and a number of times for sending an access request for an entry recorded in a sending counter associated with the entry equals to a number of times for receiving return for the entry recorded in a returning counter associated with the entry, maintaining an Identifier (ID) of the entry unchanged, wherein the ID is used for a next pushed request;
• each time when the pipeline restarts to refresh the out-of-order queue, the number of times for sending the access request for the entry recorded in the sending counter does not equal to the number of times for receiving the return for the entry recorded in the returning counter, and mirror resources are not exhausted, executing operations comprising:
• releasing the entry,
• copying the ID, the sending counter and the returning counter associated with the entry to another structure, and
• selecting N IDs, each of which is in a non-busy status, from a free list, setting a busy bit of each of the N IDs, and filling the N IDs into an ID field of the entry, wherein N is an integer;
• storing copied request information of at least one uncompleted request when the pipeline restarts to refresh the out-of-order queue using the mirror resources, the copied request information comprising the ID, the sending counter and the returning counter of each request;
• after the receiving counter is copied to the mirror resources, continuing monitoring at least one return response, increasing a counting number of the returning counter based on a count of the at least one return response, releasing a current mirror resource and the ID when the counting number of the sending counter equals to the counting number of the returning counter, and updating the free list according to the released ID;
• when the currently released mirror resource is the only available resource, copying the released ID back to an entry tagged to be restarted in a same clock cycle of releasing this ID to exchange information with the entry;
• and
• maintaining ID allocation and recycling through the free list;
• allocating an ID each time when a request is pushed;
• recycling the ID when the entry is normally released, or recycling the ID when the request is completed in the mirror resources.