Patent ID: 11113069

Abstract:
A method for implementing of a quick-release Variable Length Vector (VLV) memory access array in the technical field of software programs, which includes the following steps: Step 1: when a pipeline restarts to refresh an out-of-order queue each time, and the number of sending an entry recorded in a sending counter of the entry is equal to the number of returning the entry recorded in a returning counter of the entry, an ID of the entry is kept unchanged, and the ID is used for a next pushed request; Step 2: when the pipeline restarts to refresh the out-of-order queue each time, the number of sending the entry recorded in the sending counter is not equal to the number of returning the entry recorded in the returning counter and mirror resources are not exhausted, the existing entry is released, the ID, the sending counter and the returning counter of the entry are copied to another structure, and N IDs, each of which is in a non-busy status are selected from a free list, and a busy bit of each of the N IDs is set, and the N IDs are filled into an ID field of the entry; Step 3: copied request information of at least one request which is not completed is stored through the mirror resources when the pipeline restarts to refresh the out-of-order queue, and the copied request information includes an ID, a sending counter and a receiving counter of each request; Step 4: after the receiving counter is copied to the mirror resources, at least one response is continued to be monitored; Step 5: when the currently released mirror resource is the only available resource, the released ID is copied back to an entry tagged to be restarted in the same period of releasing this ID to exchange information with the entry; and Step 6: ID allocation and recovery is maintained through a free list.