<i>Ouroboros</i>
Martin Winter, Daniel Mlakar, Mathias Parger, Markus Steinberger
Abstract
Dynamic memory allocation on a single instruction, multiple threads architecture, like the Graphics Processing Unit (GPU), is challenging and implementation guidelines caution against it. Data structures must rise to the challenge of thousands of concurrently active threads trying to allocate memory. Efficient queueing structures have been used in the past to allow for simple allocation and reuse of memory directly on the GPU but do not scale well to different allocation sizes, as each requires its own queue.
Topics & Concepts
Computer scienceGraphics processing unitQueueing theoryGraphicsParallel computingReuseQueueMemory managementSimple (philosophy)ArchitectureDistributed computingComputer architectureOperating systemComputer networkOverlayEpistemologyEcologyBiologyArtPhilosophyVisual artsParallel Computing and Optimization TechniquesDistributed systems and fault toleranceDistributed and Parallel Computing Systems