Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages最新文献

Garbage collection and efficiency in dynamic metacircular runtimes: an experience report 动态元循环运行时的垃圾收集和效率:一份经验报告

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3133841.3133845

Javier Pimás, Javier Burroni, Jean-Baptiste Arnaud, Stefan Marr

{"title":"Garbage collection and efficiency in dynamic metacircular runtimes: an experience report","authors":"Javier Pimás, Javier Burroni, Jean-Baptiste Arnaud, Stefan Marr","doi":"10.1145/3133841.3133845","DOIUrl":"https://doi.org/10.1145/3133841.3133845","url":null,"abstract":"In dynamic object-oriented languages, low-level mechanisms such as just-in-time compilation, object allocation, garbage collection (GC) and method dispatch are often handled by virtual machines (VMs). VMs are typically implemented using static languages, allowing only few changes at run time. In such systems, the VM is not part of the language and interfaces to memory management or method dispatch are fixed, not allowing for arbitrary adaptation. Furthermore, the implementation can typically not be inspected or debugged with standard tools used to work on application code. This paper reports on our experience building Bee, a dynamic Smalltalk runtime, written in Smalltalk. Bee is a Dynamic Metacircular Runtime (DMR) and seamlessly integrates the VM into the application and thereby overcomes many restrictions of classic VMs, for instance by allowing arbitrary code modifications of the VM at run time. Furthermore, the approach enables developers to use their standard tools for application code also for the VM, allowing them to inspect, debug, understand, and modify a DMR seamlessly. We detail our experience of implementing GC, compilation, and optimizations in a DMR. We discuss examples where we found that DMRs can improve understanding of the system, provide tighter control of the software stack, and facilitate research. We also show that the Bee DMR matches and surpass the performance of a widely used Smalltalk VM.","PeriodicalId":117125,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122404299","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}

引用次数: 0

The semantics of name resolution in grace 名称解析的语义是优雅的

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3133841.3133847

V. Vergu, Michiel Haisma, E. Visser

引用次数: 1

Object equivalence: revisiting object equality profiling (an experience report) 对象等价:重新访问对象等价分析(一份经验报告)

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3133841.3133844

A. Infante, Alexandre Bergel

引用次数: 8

Challenges and progress toward efficient gradual typing (invited talk) 高效渐进式打字的挑战与进展(特邀演讲)

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3133841.3148570

Jeremy G. Siek

引用次数: 2

Semantics of asynchronous JavaScript 异步JavaScript的语义

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3133841.3133846

Matthew C. Loring, Mark Marron, Daan Leijen

引用次数: 29

The JavaScriptCore virtual machine (invited talk) JavaScriptCore虚拟机(特邀演讲)

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3170472.3148567

F. Pizlo

引用次数: 1

Dynamic atomicity: optimizing swift memory management 动态原子性:优化快速内存管理

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-10-24 DOI: 10.1145/3133841.3133843

D. Ungar, D. Grove, H. Franke

{"title":"Dynamic atomicity: optimizing swift memory management","authors":"D. Ungar, D. Grove, H. Franke","doi":"10.1145/3133841.3133843","DOIUrl":"https://doi.org/10.1145/3133841.3133843","url":null,"abstract":"Swift is a modern multi-paradigm programming language with an extensive developer community and open source ecosystem. Swift 3's memory management strategy is based on Automatic Reference Counting (ARC) augmented with unsafe APIs for manually-managed memory. We have seen ARC consume as much as 80% of program execution time. A significant portion of ARC's direct performance cost can be attributed to its use of atomic machine instructions to protect reference count updates from data races. Consequently, we have designed and implemented dynamic atomicity, an optimization which safely replaces atomic reference-counting operations with nonatomic ones where feasible. The optimization introduces a store barrier to detect possibly intra-thread references, compiler-generated recursive reference-tracers to find all affected objects, and a bit of state in each reference count to encode its atomicity requirements. Using a suite of 171 microbenchmarks, 9 programs from the Computer Language Benchmarks Game, and the Richards benchmark, we performed a limit study by unsafely making all reference counting operations nonatomic. We measured potential speedups of up to 220% on the microbenchmarks, 120% on the Benchmarks Game and 70% on Richards. By automatically reducing ARC overhead, our optimization both improves Swift 3's performance and reduces the temptation for performance-oriented programmers to resort to unsafe manual memory management. Furthermore, the machinery implemented for dynamic atomicity could also be employed to obtain cheaper thread-safe Swift data structures, or to augment ARC with optional cycle detection or a backup tracing garbage collector.","PeriodicalId":117125,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122050049","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}

引用次数: 6

Decoding Lua: formal semantics for the developer and the semanticist 解码Lua:面向开发人员和语义学家的形式语义

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-06-07 DOI: 10.1145/3133841.3133848

Mallku Soldevila, Beta Ziliani, Bruno Silvestre, Daniel Fridlender, Fabio Mascarenhas

引用次数: 8

A concurrency-agnostic protocol for multi-paradigm concurrent debugging tools 多范式并发调试工具的并发不可知协议

Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages Pub Date : 2017-06-01 DOI: 10.1145/3133841.3133842

Stefan Marr, Carmen Torres Lopez, Dominik Aumayr, E. G. Boix, H. Mössenböck

{"title":"A concurrency-agnostic protocol for multi-paradigm concurrent debugging tools","authors":"Stefan Marr, Carmen Torres Lopez, Dominik Aumayr, E. G. Boix, H. Mössenböck","doi":"10.1145/3133841.3133842","DOIUrl":"https://doi.org/10.1145/3133841.3133842","url":null,"abstract":"Today's complex software systems combine high-level concurrency models. Each model is used to solve a specific set of problems. Unfortunately, debuggers support only the low-level notions of threads and shared memory, forcing developers to reason about these notions instead of the high-level concurrency models they chose. This paper proposes a concurrency-agnostic debugger protocol that decouples the debugger from the concurrency models employed by the target application. As a result, the underlying language runtime can define custom breakpoints, stepping operations, and execution events for each concurrency model it supports, and a debugger can expose them without having to be specifically adapted. We evaluated the generality of the protocol by applying it to SOMns, a Newspeak implementation, which supports a diversity of concurrency models including communicating sequential processes, communicating event loops, threads and locks, fork/join parallelism, and software transactional memory. We implemented 21 breakpoints and 20 stepping operations for these concurrency models. For none of these, the debugger needed to be changed. Furthermore, we visualize all concurrent interactions independently of a specific concurrency model. To show that tooling for a specific concurrency model is possible, we visualize actor turns and message sends separately.","PeriodicalId":117125,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126791565","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}

引用次数: 14