Articles, Blog

CppCon 2017: Nicolas Guillemot “Design Patterns for Low-Level Real-Time Rendering”

January 14, 2020


You Might Also Like

13 Comments

  • Reply Liang Luo October 13, 2017 at 1:25 am

    cppcon is awesome.

  • Reply greje656 October 13, 2017 at 2:52 am

    great talk!

  • Reply Janko Dedic October 13, 2017 at 6:10 am

    This guy explains everything so well… Great talk!

  • Reply Henri Tuhola October 13, 2017 at 11:46 pm

    Barely scratches the paint on the surface of the subject. I hoped to see some real code among it and not just those oversimplifications.

  • Reply Siddharth P October 15, 2017 at 4:24 am

    Since opengl context can be bound to one thread at a time, how does a fork, join thread of command list work?

  • Reply Jared Mistretta October 20, 2017 at 1:45 pm

    Great talk! Great ideas explained simply and concisely. Good job!

  • Reply scolic03 October 21, 2017 at 8:37 pm

    10/10 talk, liked, shared on Facebook, subscribed, excitedly printed on A3 wallpaper, studied and revered!
    This kind of explanation only comes from a person knowing the subject matter intimately. A lot of hard work went into this talk and it shows. Thank you.

  • Reply Xavier Thomas November 13, 2017 at 12:41 am

    One solution for the ring buffer sizing/wrapping issue is to use virtual memory as explained here http://ourmachinery.com/post/virtual-memory-tricks/ which permit allocating a huge addressing space but actually using just the memory you touch.

  • Reply Sychonut June 17, 2018 at 11:43 pm

    Interesting talk. Thanks for sharing!

  • Reply Lava Block July 10, 2018 at 4:24 pm

    Thanks for sharing. Great

  • Reply Martin Preinfalk August 22, 2018 at 8:40 pm

    great talk!

  • Reply Operation Darkside October 21, 2018 at 5:14 pm

    I would have needed these explanations far sooner. This was finally a version I understood. So many other tutorials and talks assume existing knowledge of graphics programming

  • Reply Sergey Dzhaltyr April 12, 2019 at 8:30 pm

    48:01
    Stack allocator might be beneficial for this case. Basically it makes the memory allocated for T1 to be implicitly reused for OUT (due to nature of stack allocators).
    So sequence will be: [NEW T2] [NEW T1] [RUN A] [DEL T1] [NEW OUT] …

  • Leave a Reply