Results 1 to 2 of 2

Thread: band and partial update

  1. #1

    band and partial update

    I have a scene graph in my opengl engine, I traverses the graph and fills a buffer with some data for each node of the scene graph.
    I have a buffer filled with memory and i can send it as parameter of a kernel, and execute the kernel.
    Now: when i traverses again the graph i'm need only of the nodes that contain a flag to true(the flag is true only on the translate and rotated elements ).
    How i can minimize the band from host to the device(the gpu)?
    I see the enquequeMapBuffer, but i have a segmented memory and i shall call many time the enquequeMapBuffer and that i think that this is slow .
    Is possible to update the kernel(send data to an args) before that is executed with only a part of the data(those that have the flag to true), and remember on the kernel all the old data?
    or each time that i must execute a kernel i need to send all the data?

  2. #2

    Re: band and partial update

    for ex: i must implement a neighbor's finder with k-dtree, and for this i must create the data structure and fill it with data, after that i must call several time a kernel for each search, a solution is send all the queries in a kernel arguments , but it is not sufficient, because i should be able to adjourn the data structure for example if adds a element or delete it, how i can send only an argument or some to the kdtree of 100000 elements(for example)?

Similar Threads

  1. partial reductions
    By giugio in forum OpenCL
    Replies: 1
    Last Post: 03-11-2013, 01:18 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
Proudly hosted by Digital Ocean