Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages最新文献

Accelerate JavaScript applications by cross-compiling to WebAssembly 通过交叉编译到WebAssembly来加速JavaScript应用程序

Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages Pub Date : 2017-10-24 DOI: 10.1145/3141871.3141873

M. Reiser, Luc Bläser

引用次数: 26

Cross-ISA debugging in meta-circular VMs 元循环虚拟机中的跨isa调试

Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages Pub Date : 2017-10-24 DOI: 10.1145/3141871.3141872

Christos Kotselidis, A. Nisbet, Foivos S. Zakkak, N. Foutris

引用次数: 8

Fusing method handle graphs for efficient dynamic JVM language implementations 融合方法处理图形，实现高效的动态JVM语言实现

Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages Pub Date : 2017-10-24 DOI: 10.1145/3141871.3141874

Shijie Xu, David Bremner, Daniel Heidinga

{"title":"Fusing method handle graphs for efficient dynamic JVM language implementations","authors":"Shijie Xu, David Bremner, Daniel Heidinga","doi":"10.1145/3141871.3141874","DOIUrl":"https://doi.org/10.1145/3141871.3141874","url":null,"abstract":"A Method Handle (MH) in JSR 292 (Supporting Dynamically Typed Languages on the JVM) is a typed, directly executable reference to an underlying method, constructor, or field, with optional method type transformations. Multiple connected MHs make up a Method Handle Graph (MHG), which transfers an invocation at a dynamic call site to real method implementations at runtime. Despite benefits that MHGs have for dynamic JVM language implementations, MHGs challenge existing JVM optimization because a) larger MHGs at call sites incur higher graph traversal costs at runtime; and b) JIT expenses, including profiling and compilation of individual MHs, increase along with the number of MHs. This paper proposes dynamic graph fusion to compile an MHG into another equivalent but simpler MHG (e.g., fewer MHs and edges), as well as related optimization opportunities (e.g., selection policy and inline caching). Graph fusion dynamically fuses bytecodes of internal MHs on hot paths, and then substitutes these internal MHs with the instance of the newly generated bytecodes at program runtime. The implementation consists of a template system and GraphJIT. The former emits source bytecodes for individual MHs, while the latter is a JIT compiler that fuses source bytecodes from templates on the bytecode level (i.e., both source code and target code are bytecodes). With the JRuby Micro-Indy benchmark from Computer Language Benchmark Game and JavaScript Octane benchmark on Nashorn, our results show that (a) the technique can reduce execution time of Micro-Indy and Octane benchmarks by 6.28% and 7.73% on average; b) it can speed up a typical MHG’s execution by 31.53% using Ahead-Of-Time (AOT) compilation; and (c) the technique reduces the number of MH JIT compilations by 52.1%.","PeriodicalId":384671,"journal":{"name":"Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages","volume":"1 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":"129896831","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}

引用次数: 4

Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages 第九届ACM SIGPLAN虚拟机和中间语言国际研讨会论文集

Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages Pub Date : 1900-01-01 DOI: 10.1145/3141871

引用次数: 0