Zum Hauptinhalt springen

NODE PREFETCHING IN A WIDE BVH TRAVERSAL WITH A STACK

2023
Online Patent

Titel:
NODE PREFETCHING IN A WIDE BVH TRAVERSAL WITH A STACK
Link:
Veröffentlichung: 2023
Medientyp: Patent
Sonstiges:
  • Nachgewiesen in: USPTO Patent Applications
  • Sprachen: English
  • Document Number: 20230298126
  • Publication Date: September 21, 2023
  • Appl. No: 17/699059
  • Application Filed: March 18, 2022
  • Claim: 1. An apparatus comprising: ray tracing acceleration hardware to manage active ray tracing stack allocations within a traversal stack; and stack management hardware logic to issue a prefetch operation comprising an indication of bounding volume hierarchy (BVH) node data to be prefetched and an indication of a cache level, wherein responsive to performing the prefetch operation, the BVH node data is to be prefetched to the indicated cache level.
  • Claim: 2. The apparatus of claim 1 wherein the prefetch operation is to identify N elements of the traversal stack.
  • Claim: 3. The apparatus of claim 2 wherein the stack management hardware logic is to identify the N elements as the top-most elements of the traversal stack.
  • Claim: 4. The apparatus of claim 2 wherein the stack management hardware logic is to identify the N elements as elements below one or more top-most elements of the traversal stack.
  • Claim: 5. The apparatus of claim 4 wherein the stack management hardware logic is to identify the N elements by anticipating when the N elements are to be accessed by the ray tracing acceleration hardware logic.
  • Claim: 6. The apparatus of claim 1 further comprising: a cache subsystem comprising a hierarchy of cache levels, wherein the cache level identified by the prefetch operation comprises one of the cache levels in the hierarchy of cache levels.
  • Claim: 7. The apparatus of claim 6 wherein the cache level identified by the prefetch operation comprises one of an L2 cache, an L1 cache, and an L0 cache.
  • Claim: 8. The apparatus of claim 1 wherein the stack management hardware logic is to mark one or more entries of the traversal stack to indicate that the associated BVH node data has been prefetched.
  • Claim: 9. A method comprising: managing active ray tracing stack allocations within a traversal stack; and performing a prefetch operation comprising an indication of bounding volume hierarchy (BVH) node data to be prefetched and an indication of a cache level, wherein responsive to performing the prefetch operation, the BVH node data is to be prefetched to the indicated cache level.
  • Claim: 10. The method of claim 9 wherein the prefetch operation is to identify N elements of the traversal stack.
  • Claim: 11. The method of claim 10 wherein the N elements are identified as the top-most elements of the traversal stack.
  • Claim: 12. The method of claim 10 wherein the N elements are identified as elements below one or more top-most elements of the traversal stack.
  • Claim: 13. The method of claim 12 wherein the N elements are identified by anticipating when the N elements are to be accessed by the ray tracing acceleration hardware logic.
  • Claim: 14. The method of claim 9 wherein the cache level identified by the prefetch operation comprises one cache level in a hierarchy of cache levels.
  • Claim: 15. The method of claim 14 wherein the cache level identified by the prefetch operation comprises one of an L2 cache, an L1 cache, and an L0 cache.
  • Claim: 16. The apparatus of claim 9 further comprising: marking one or more entries of the traversal stack to indicate that the associated BVH node data has been prefetched.
  • Claim: 17. A machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform the operations of: managing active ray tracing stack allocations within a traversal stack; and performing a prefetch operation comprising an indication of bounding volume hierarchy (BVH) node data to be prefetched and an indication of a cache level, wherein responsive to performing the prefetch operation, the BVH node data is to be prefetched to the indicated cache level.
  • Claim: 18. The machine-readable medium of claim 17 wherein the prefetch operation is to identify N elements of the traversal stack.
  • Claim: 19. The machine-readable medium of claim 18 wherein the N elements are identified as the top-most elements of the traversal stack.
  • Claim: 20. The machine-readable medium of claim 17 wherein the N elements are identified as elements below one or more top-most elements of the traversal stack.
  • Claim: 21. The machine-readable medium of claim 20 wherein the N elements are identified by anticipating when the N elements are to be accessed by the ray tracing acceleration hardware logic.
  • Claim: 22. The machine-readable medium of claim 17 wherein the cache level identified by the prefetch operation comprises one cache level in a hierarchy of cache levels.
  • Claim: 23. The machine-readable medium of claim 22 wherein the cache level identified by the prefetch operation comprises one of an L2 cache, an L1 cache, and an L0 cache.
  • Claim: 24. The machine-readable medium of claim 17 wherein the program code is to cause the machine to perform the additional operation of: marking one or more entries of the traversal stack to indicate that the associated BVH node data has been prefetched.
  • Current International Class: 06; 06; 06; 06; 06; 06

Klicken Sie ein Format an und speichern Sie dann die Daten oder geben Sie eine Empfänger-Adresse ein und lassen Sie sich per Email zusenden.

oder
oder

Wählen Sie das für Sie passende Zitationsformat und kopieren Sie es dann in die Zwischenablage, lassen es sich per Mail zusenden oder speichern es als PDF-Datei.

oder
oder

Bitte prüfen Sie, ob die Zitation formal korrekt ist, bevor Sie sie in einer Arbeit verwenden. Benutzen Sie gegebenenfalls den "Exportieren"-Dialog, wenn Sie ein Literaturverwaltungsprogramm verwenden und die Zitat-Angaben selbst formatieren wollen.

xs 0 - 576
sm 576 - 768
md 768 - 992
lg 992 - 1200
xl 1200 - 1366
xxl 1366 -