This could be useful to minimize CPU/GPU exchanges.
Context
The reason I'm asking this, is working that I work on very large procedurally generated images. These images are built by chunk on the CPU.
Then, some processing is done on the GPU side with WARP.
Currently, the pipeline flow is the following:
We have a base image.
Shift that image by a given amount of chunks.
Build missing image chunks.
Rebuild image using the previously generated chunks.
image is shared with warp (send to GPU)
Process on the gpu
Repeat (1-6)
If the feature was available, the pipeline would like that:
We have an initial map containing the chunks.
Build missing chunks and send them to warp.
Remove chunks (from warp side).
Process on the GPU with proper chunk indexing.
Repeat(1-4)
Having a std::map like system would allow avoiding rebuilding the image, and also reduce the amount of data sent to the GPU.
I can provide more details if needed.
Description
Hi there! First I wanted to say thanks for the fantastic work you are doing with Warp, and the support you're providing for it!
As for the request, I was wondering if you could implement c++ style std::map inside warp.
This would provide the ability to do things such as:
Which would be equivalent to:
This could be useful to minimize CPU/GPU exchanges.
Context
The reason I'm asking this, is working that I work on very large procedurally generated images. These images are built by chunk on the CPU. Then, some processing is done on the GPU side with WARP.
Currently, the pipeline flow is the following:
We have a base image.
If the feature was available, the pipeline would like that:
We have an initial map containing the chunks.
Having a std::map like system would allow avoiding rebuilding the image, and also reduce the amount of data sent to the GPU. I can provide more details if needed.
Thanks again for all the work and support,
Best,
Antoine