Improving Data Locality for Efficient In-Core Path Tracing

Must read and other references.
jbikker
Posts: 164
Joined: Mon Nov 28, 2011 8:18 am
Contact:

Improving Data Locality for Efficient In-Core Path Tracing

Postby jbikker » Fri May 11, 2012 2:23 pm

The paper "Improving Data Locality for Efficient In-Core Path Tracing" has been accepted for CG Forum and is available for early online view as of today. Apparently I am allowed to distribute digital copies, upon request. So no link here, but feel free to PM.

Abstract:

In this paper, we investigate the efficiency of ray queries on the CPU in the context of path tracing, where ray distributions are mostly random. We show that existing schemes that exploit data locality to improve ray tracing efficiency fail to do so beyond the first diffuse bounce, and analyze the cause for this. We then present an alternative scheme inspired by the work of Pharr et al. in which we improve data locality by using a data-centric breadth-first approach. We show that our scheme improves on state-of-the-art performance for ray distributions in a path tracer.

Merax
Posts: 4
Joined: Fri Mar 23, 2012 10:05 pm

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby Merax » Fri May 11, 2012 7:39 pm

I don't have enough posts to send a PM, but I'd be interested in reading the paper if you can PM me :)

fpsunflower
Posts: 7
Joined: Sat May 12, 2012 2:25 am
Location: Los Angeles
Contact:

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby fpsunflower » Sat May 12, 2012 2:29 am

Me too!

Merax
Posts: 4
Joined: Fri Mar 23, 2012 10:05 pm

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby Merax » Sat May 12, 2012 6:11 pm

Thanks for the link, the paper was interesting and I like your idea for grouping the rays.

I'm torn between being impressed that the speed up is as good as you'd get from a new generation of CPUs and disappointed that it's not more considering how big the speed difference is between cache and main memory.

fpsunflower
Posts: 7
Joined: Sat May 12, 2012 2:25 am
Location: Los Angeles
Contact:

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby fpsunflower » Sun May 13, 2012 5:14 pm

Thanks!

Do you have a follow up planned that goes into the details of the GPU implementation? I would be curious to see a comparison to the Garanzha and Loop scheme.

franz
Posts: 12
Joined: Thu Dec 29, 2011 5:38 pm

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby franz » Mon May 14, 2012 6:15 am

Hey Jacco,

I'd be interested to get a copy of that paper as well, if you don't mind. Thanks!

Cheers,
Franz

HungryBear
Posts: 2
Joined: Tue Feb 14, 2012 2:59 pm

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby HungryBear » Mon May 14, 2012 11:27 am

Any chances to get a link /copy too? Thanks in advance

Brigadir
Posts: 8
Joined: Mon May 14, 2012 11:42 am

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby Brigadir » Mon May 14, 2012 11:44 am

Please, can you send/PM me this paper?

jbikker
Posts: 164
Joined: Mon Nov 28, 2011 8:18 am
Contact:

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby jbikker » Mon May 14, 2012 5:55 pm

fpsunflower wrote:Do you have a follow up planned that goes into the details of the GPU implementation? I would be curious to see a comparison to the Garanzha and Loop scheme.


I didn't attempt a GPU implementation yet. Perhaps somewhere in the future. :)

TheSFReader
Posts: 12
Joined: Tue Dec 06, 2011 8:18 am

Re: Improving Data Locality for Efficient In-Core Path Traci

Postby TheSFReader » Tue May 15, 2012 12:48 pm

jbikker wrote:The paper "Improving Data Locality for Efficient In-Core Path Tracing" has been accepted for CG Forum and is available for early online view as of today. Apparently I am allowed to distribute digital copies, upon request. So no link here, but feel free to PM.

Abstract:

In this paper, we investigate the efficiency of ray queries on the CPU in the context of path tracing, where ray distributions are mostly random. We show that existing schemes that exploit data locality to improve ray tracing efficiency fail to do so beyond the first diffuse bounce, and analyze the cause for this. We then present an alternative scheme inspired by the work of Pharr et al. in which we improve data locality by using a data-centric breadth-first approach. We show that our scheme improves on state-of-the-art performance for ray distributions in a path tracer.


Received the link. Thank you. Can we discuss it publicly, or shoud discussions remain "hidden" ?


Return to “Links & Papers”

Who is online

Users browsing this forum: No registered users and 1 guest