METHOD FOR REORDERING THE REQUEST QUEUE OF A HARDWARE ACCELERATOR

• US 20120221747A1
• Filed: 04/23/2012
• Published: 08/30/2012
• Est. Priority Date: 05/31/2010
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mei, Xiaolu, Xie, Dong, Zheng, Jun, Chang, Xiaotao, Feng, Kuan
• Application Number:
  US13/453,138
• Publication Number:
  US 20120221747A1
• Time in Patent Office: Days
• US Class Current: 710/6
• CPC Class Codes: G06F 9/3881 Arrangements for communication of instructions and data

Abstract

Reordering the request queue of the hardware accelerator, wherein, the request queue stores therein a plurality of coprocessor request blocks (CRBs) to be input into the hardware accelerator. A content addressable memory is connected to the request queue for storing the state pointer of each CRB in the request queue at a same physical storage location in the request queue, receiving the state pointer of a new CRB in response to the new CRB asking to join in the request queue and outputting the physical storage location of a CRB in the request queue whose state pointer stored in the content addressable memory is the same as the state pointer of the new CRB.

Claims

1-11. -11. (canceled)

12. A method for reordering a request queue for a hardware accelerator comprising:

storing a plurality of compressor request blocks (CBRs) to be input into the hardware accelerator in a request queue;

receiving a state pointer from a new CBR joining the request queue;

determining the physical location of an already stored CBR in said request queue, said already stored CBR having a state pointer which is the same as the state pointer of the new CBR; and

inputting the new CRB in the request queue so that said already stored CRB and the new CRB are adjacent to each in the request queue in the order of entry of the stored CRB and the new CRB into the queue, wherein stored CRB and the new CRB are input to the hardware accelerator in said order.

13. The method of claim 12 further including mapping the state pointer of the already stored CRB and the stage pointer of the new CRB wherein the entry data representing the new CBR has less digits before determining the physical location of a CBR.

14. The method of claim 13, wherein each CRB stored in the queue includes:

a pointer item pointing to the next CBR is the request queue to be input into the hardware accelerator, and

a message including the sequence number of said CRB within all CRBs in the message.

15. The method of claim 14, wherein said inputting the new CRB in the request queue so that said already stored CRB and the new CRB are adjacent to each in the request queue in the order of entry of the stored CRB and the new CRB into the queue, wherein stored CRB and the new CRB are input to the hardware accelerator in said order including:

selecting between the stored CRB and the new CRB, the one having the largest sequence number in said message to be processed, and

modifying said pointer item of the new CRB so as to point to said already stored CRB as the next CRB to be input.

16. The method of claim 15, wherein:

each CRB includes two state description bits;

a first state description bit indicating whether the state of the each processed CRB bit is stored in memory; and

a second state description bit indicating whether processing of the CRB needs to retrieve the current state of said previously stored message; and

said method further includes updating the two state description bits of a new CRB in response to said new CRB coming said request queue.

17. The method of claim 16 further including:

locking the inputting of the already stored CRB to said hardware accelerator in response to said new CRB joining said request queue; and

removing said locking upon the completion of the new CRB joining said queue.

18. The method of claim 14 wherein the new CRB includes the a message including the sequence number of the new CRB within all CRBs in the message.

19. The method of claim 18 wherein said inputting the new CRB in the request queue so that said already stored CRB and the new CRB are adjacent to each in the request queue in the order of entry of the stored CRB and the new CRB into the queue includes:

selecting between the stored CRB and the new CRB, the one having the largest sequence number in said message to be input into the hardware accelerator; and

right shifting by one each CRB in said request queue following CRB being input; and

inserting a new CRB into the queue location of the next CRB being input to said hardware accelerator.

20. The method of claim 19, wherein:

each CRB includes two state description bits;

a first state description bit indicating whether the state of the each processed CRB bit is stored in memory; and

a second state description bit indicating whether processing of the CRB needs to retrieve the current state of said previously stored message; and

said method further includes updating the two state description bits of a new CRB in response to said new CRB joining said request queue.

21. The method of claim 20 further including:

locking the inputting of the already stored CRB to said hardware accelerator in response to said new CRB joining said request queue; and

removing said locking upon the completion of the new CRB joining said queue.