Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management最新文献

筛选

英文中文

A bounded memory allocator for software-defined global address spaces 用于软件定义的全局地址空间的有界内存分配器

Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management Pub Date : 2016-06-14 DOI: 10.1145/2926697.2926709

François Gindraud, F. Rastello, Albert Cohen, François Broquedis

{"title":"A bounded memory allocator for software-defined global address spaces","authors":"François Gindraud, F. Rastello, Albert Cohen, François Broquedis","doi":"10.1145/2926697.2926709","DOIUrl":"https://doi.org/10.1145/2926697.2926709","url":null,"abstract":"This paper presents a memory allocator targeting manycore architec- tures with distributed memory. Among the family of Multi Processor System on Chip (MPSoC), these devices are composed of multiple nodes linked by an on-chip network; most nodes have multiple processors sharing a small local memory. While MPSoC typically excel on their performance-per-Watt ratio, they remain hard to program due to multilevel parallelism, explicit resource and memory management, and hardware constraints (limited memory, network topology). Typical programming frameworks for MPSoC leave much target-specific work to the programmer: combining threads or node-local OpenMP, software caching, explicit message passing (and sometimes, routing), with non-standard interfaces. More abstract, automatic frameworks exist, but they target large-scale clusters and do not model the hardware constraints of MPSoC. The memory allocator described in this paper is one component of a larger runtime system, called Givy, to support dynamic task graphs with automatic software caching and data-driven execution on MPSoC. To simplify the programmer’s view of memory, both runtime and program data objects live in a Global Address Space (GAS). To avoid address collisions when objects are dynamically allocated, and to manage virtual memory mappings across nodes, a GAS-aware memory allocator is required. This paper proposes such an allocator with the following properties: (1) it is free of inter-node synchronizations; (2) its node-local performance match that of state-of-the-art shared-memory allocators; (3) it provides node-local mechanisms to implement inter-node software caching within a GAS; (4) it is well suited for small memory systems (a few MB per node).","PeriodicalId":203550,"journal":{"name":"Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122675777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Liveness-based garbage collection for lazy languages 针对惰性语言的基于活动性的垃圾收集

Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management Pub Date : 2016-04-20 DOI: 10.1145/2926697.2926698

Prasanna Kumar K., A. Sanyal, Amey Karkare

{"title":"Liveness-based garbage collection for lazy languages","authors":"Prasanna Kumar K., A. Sanyal, Amey Karkare","doi":"10.1145/2926697.2926698","DOIUrl":"https://doi.org/10.1145/2926697.2926698","url":null,"abstract":"We consider the problem of reducing the memory required to run lazy first-order functional programs. Our approach is to analyze programs for liveness of heap-allocated data. The result of the analysis is used to preserve only live data—a subset of reachable data—during garbage collection. The result is an increase in the garbage reclaimed and a reduction in the peak memory requirement of programs. Whereas this technique has already been shown to yield benefits for eager first-order languages, the lack of a statically determinable execution order and the presence of closures pose new challenges for lazy languages. These require changes both in the liveness analysis itself and in the design of the garbage collector. To show the effectiveness of our method, we implemented a copying collector that uses the results of the liveness analysis to preserve live objects, both evaluated and closures. Our experiments confirm that for programs running with a liveness-based garbage collector, there is a significant decrease in peak memory requirements. In addition, a sizable reduction in the number of collections ensures that in spite of using a more complex garbage collector, the execution times of programs running with liveness and reachability-based collectors remain comparable.","PeriodicalId":203550,"journal":{"name":"Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114917409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management 2016年ACM SIGPLAN内存管理国际研讨会论文集

Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management Pub Date : 1900-01-01 DOI: 10.1145/2926697

Christine H. Flood, Zheng Zhang

引用次数: 0

首页上一页