Cache chunked list concrete data type
View Patent ↗An embodiment of the invention provides a concrete data type and a method for providing a cached chunked list concrete data type. The method can perform steps including: storing at least one datum in a chunk in a cache line; and setting a lower bit value (LB) in a link/space pointer in the chunk to indicate the empty slots in the chunk.
1. A method for providing a cached chunked list concrete data type, the method comprising:
storing at least one datum in a chunk in a cache line; and
setting a lower bit value (LB) in a link/space pointer in the chunk to indicate the empty slots in the chunk.
2. The method of claim 1 , further comprising:
setting an upper bit value (UB) in the link/space pointer to link another chunk to the chunk.
3. The method of claim 1 , further comprising:
based on the LB value, identifying the empty slots; and
prefetching data from a main memory for storage into the empty slots in the chunk.
4. The method of claim 1 , further comprising:
traversing slots in the chunk by incrementing a count value.
5. The method of claim 1 , further comprising:
inserting datum in a last empty slot in the chunk.
6. The method of claim 5 , wherein the LB value identifies the last empty slot in the chunk.
7. The method of claim 1 , further comprising:
shifting datum in a slot into a next lower empty slot; and
inserting a new datum into the slot.
8. The method of claim 1 , further comprising:
linking the chunk to a new chunk; and
inserting datum into the new chunk if there are no empty slots in the chunk.
9. The method of claim 1 , further comprising:
unlinking an empty chunk from an Abstract Data Type (ADT).
10. The method of claim 1 , further comprising:
linking the chunk in an Abstract Data Type to a second chunk and to a third chunk.
11. A cached chunked list concrete data type, comprising:
a chunk aligned in a cache line and storing at least one datum, wherein a lower bit value (LB) in a link/space pointer in the chunk indicates the empty slots in the chunk.
12. The cached chunked list concrete data type of claim 11 , wherein an upper bit value (UB) in the link/space pointer links another chunk to the chunk.
13. The cached chunked list concrete data type of claim 11 wherein based on the LB value, empty slots are identified and data is prefetched from a main memory for storage into the empty slots in the chunk.
14. The cached chunked list concrete data type of claim 11 , wherein slots are traversed in slots in the chunk by incrementing a count value.
15. The cached chunked list concrete data type of claim 11 , wherein datum is inserted in a last empty slot in the chunk.
16. The cached chunked list concrete data type of claim 15 , wherein the LB value identifies the last empty slot in the chunk.
17. The cached chunked list concrete data type of claim 11 , wherein datum is shifted in a slot into a next lower empty slot, and new datum is inserted into the slot.
18. The cached chunked list concrete data type of claim 11 , wherein the chunk is linked to a new chunk; and datum is inserted into the new chunk if there are no empty slots in the chunk.
19. The cached chunked list concrete data type of claim 11 , wherein an empty chunk is unlinked from an Abstract Data Type (ADT).
20. The cached chunked list concrete data type of claim 11 , wherein the chunk is linked in an Abstract Data Type to a second chunk and to a third chunk.
21. An apparatus for providing a cached chunked list concrete data type, the apparatus comprising:
means for storing at least one datum in a chunk in a cache line; and
means for setting a lower bit value (LB) in a link/space pointer in the chunk to indicate the empty slots in the chunk.