{"title":"Gallatin:通用 GPU 内存管理器","authors":"Hunter McCoy, Prashant Pandey","doi":"10.1145/3627535.3638499","DOIUrl":null,"url":null,"abstract":"Dynamic memory management is critical for efficiently porting modern data processing pipelines to GPUs. However, building a general-purpose dynamic memory manager on GPUs is challenging due to the massive parallelism and weak memory coherence. Existing state-of-the-art GPU memory managers, Ouroboros and Reg-Eff, employ traditional data structures such as arrays and linked lists to manage memory objects. They build specialized pipelines to achieve performance for a fixed set of allocation sizes and fall back to the CUDA allocator for allocating large sizes. In the process, they lose general-purpose usability and fail to support critical applications such as streaming graph processing. In this paper, we introduce Gallatin, a general-purpose and high-performance GPU memory manager. Gallatin uses the van Emde Boas (vEB) tree data structure to manage memory objects efficiently and supports allocations of any size. Furthermore,wedevelopahighly-concurrentGPUimplemen-tationofthevEBtreewhichcanbebroadlyusedinotherGPU applications.Itsupportsconstanttimeinsertions,deletions, andsuccessoroperationsforagivenmemorysize. Inourevaluation,wecompareGallatinwithstate-of-the-artspecializedallocatorvariants.Gallatinisupto374 × faster onsingle-sizedallocationsandupto264 × fasteronmixed-size allocations than the next-best allocator. In scalability benchmarks, Gallatin is up to 254 × times faster than the next-best allocator as the number of threads increases. For the graph benchmarks, Gallatin is 1 . 5 × faster than the state-of-the-art for bulk insertions, slightly faster for bulk deletions, and is 3 × faster than the next-best allocator for all graph expansion tests.","PeriodicalId":286119,"journal":{"name":"ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming","volume":"329 ","pages":"364-376"},"PeriodicalIF":0.0000,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gallatin: A General-Purpose GPU Memory Manager\",\"authors\":\"Hunter McCoy, Prashant Pandey\",\"doi\":\"10.1145/3627535.3638499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dynamic memory management is critical for efficiently porting modern data processing pipelines to GPUs. However, building a general-purpose dynamic memory manager on GPUs is challenging due to the massive parallelism and weak memory coherence. Existing state-of-the-art GPU memory managers, Ouroboros and Reg-Eff, employ traditional data structures such as arrays and linked lists to manage memory objects. They build specialized pipelines to achieve performance for a fixed set of allocation sizes and fall back to the CUDA allocator for allocating large sizes. In the process, they lose general-purpose usability and fail to support critical applications such as streaming graph processing. In this paper, we introduce Gallatin, a general-purpose and high-performance GPU memory manager. Gallatin uses the van Emde Boas (vEB) tree data structure to manage memory objects efficiently and supports allocations of any size. Furthermore,wedevelopahighly-concurrentGPUimplemen-tationofthevEBtreewhichcanbebroadlyusedinotherGPU applications.Itsupportsconstanttimeinsertions,deletions, andsuccessoroperationsforagivenmemorysize. Inourevaluation,wecompareGallatinwithstate-of-the-artspecializedallocatorvariants.Gallatinisupto374 × faster onsingle-sizedallocationsandupto264 × fasteronmixed-size allocations than the next-best allocator. In scalability benchmarks, Gallatin is up to 254 × times faster than the next-best allocator as the number of threads increases. For the graph benchmarks, Gallatin is 1 . 5 × faster than the state-of-the-art for bulk insertions, slightly faster for bulk deletions, and is 3 × faster than the next-best allocator for all graph expansion tests.\",\"PeriodicalId\":286119,\"journal\":{\"name\":\"ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming\",\"volume\":\"329 \",\"pages\":\"364-376\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3627535.3638499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3627535.3638499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic memory management is critical for efficiently porting modern data processing pipelines to GPUs. However, building a general-purpose dynamic memory manager on GPUs is challenging due to the massive parallelism and weak memory coherence. Existing state-of-the-art GPU memory managers, Ouroboros and Reg-Eff, employ traditional data structures such as arrays and linked lists to manage memory objects. They build specialized pipelines to achieve performance for a fixed set of allocation sizes and fall back to the CUDA allocator for allocating large sizes. In the process, they lose general-purpose usability and fail to support critical applications such as streaming graph processing. In this paper, we introduce Gallatin, a general-purpose and high-performance GPU memory manager. Gallatin uses the van Emde Boas (vEB) tree data structure to manage memory objects efficiently and supports allocations of any size. Furthermore,wedevelopahighly-concurrentGPUimplemen-tationofthevEBtreewhichcanbebroadlyusedinotherGPU applications.Itsupportsconstanttimeinsertions,deletions, andsuccessoroperationsforagivenmemorysize. Inourevaluation,wecompareGallatinwithstate-of-the-artspecializedallocatorvariants.Gallatinisupto374 × faster onsingle-sizedallocationsandupto264 × fasteronmixed-size allocations than the next-best allocator. In scalability benchmarks, Gallatin is up to 254 × times faster than the next-best allocator as the number of threads increases. For the graph benchmarks, Gallatin is 1 . 5 × faster than the state-of-the-art for bulk insertions, slightly faster for bulk deletions, and is 3 × faster than the next-best allocator for all graph expansion tests.