Principles and Practice of Programming in Java最新文献

ejIP: a TCP/IP stack for embedded Java ejIP:用于嵌入式Java的TCP/IP栈

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093167

Martin Schoeberl

引用次数: 1

Fine-grained adaptive biased locking 细粒度自适应偏置锁定

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093184

F. Pizlo, Daniel Frampton, Antony Lloyd Hosking

{"title":"Fine-grained adaptive biased locking","authors":"F. Pizlo, Daniel Frampton, Antony Lloyd Hosking","doi":"10.1145/2093157.2093184","DOIUrl":"https://doi.org/10.1145/2093157.2093184","url":null,"abstract":"Mutual-exclusion locking is the prevailing technique for protecting shared resources in concurrent programs. Fine-grained locking maximizes the opportunities for concurrent execution while preserving correctness, but increases both the number of locks and the frequency of lock operations. Adding to the frequency of these operations is the practice of using locks defensively --- such as in library code designed for use in both concurrent and single-threaded scenarios. If the library does not protect itself with locks, an engineering burden is placed on the library's users; if the library does use locks, it punishes those who use it only from a single thread. Biased locking is a dynamic protocol for eliminating this trade-off, in which the underlying run-time system optimizes lock operations by biasing a lock to a specific thread when the lock is dynamically found to be thread-local. Biased locking protocols are distinguished by how many opportunities for optimization are found, and what performance trade-offs for non-local locks are experienced. Of particular concern is the relatively high cost involved in revoking the bias of a lock, which makes existing biased locking protocols susceptible to performance pathologies for programs with specific patterns of contention.\u0000 This work presents the biased locking protocol used in Jikes RVM, a high-throughput Java virtual machine. The protocol, dubbed Fable, builds on prior work by adding per-object-instance dynamic adaptation and inexpensive bias revocation. We describe the protocol, detail how it was implemented, and use it in offering the most thorough evaluation of Java locking protocols to date. Fable is shown to provide speed-ups over traditional Java locking across a broad spectrum of benchmarks while being robust to cases previous protocols handled poorly.","PeriodicalId":169989,"journal":{"name":"Principles and Practice of Programming in Java","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133229318","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}

引用次数: 20

Jazz2: a flexible and extensible framework for structural testing in a Java VM Jazz2:用于在Java VM中进行结构测试的灵活且可扩展的框架

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093169

Jonathan Misurda, B. Childers, M. Soffa

引用次数: 4

Eliminating partially-redundant array-bounds check in the Android Dalvik JIT compiler 消除了Android Dalvik JIT编译器中部分冗余的数组边界检查

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093175

J. Absar, Deepak Shekhar

引用次数: 4

The Java Virtual Machine in retargetable, high-performance instruction set simulation 实现了Java虚拟机中的可重标、高性能指令集仿真

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093161

M. Kaufmann, Matthias Häsing, Thomas B. Preußer, R. Spallek

{"title":"The Java Virtual Machine in retargetable, high-performance instruction set simulation","authors":"M. Kaufmann, Matthias Häsing, Thomas B. Preußer, R. Spallek","doi":"10.1145/2093157.2093161","DOIUrl":"https://doi.org/10.1145/2093157.2093161","url":null,"abstract":"Two main demands on instruction set simulation are portability and high simulation performance. For the testing and benchmarking of ISA prototypes such as in an ASIP design process, simulators are additionally required to offer retargetability for the rapid modeling and revisal of their simulation targets.\u0000 In this paper, we present the techniques applied in a full-system instruction set simulation framework that combines these three conflicting demands. Our framework is retargetable, portable and provides high simulation performance. It is entirely implemented in Java and features a two-stage dynamic binary translation (DBT) targeting Java Bytecode in the first stage and employing the Java Virtual Machine as an external code generation back end in the second stage. While the use of state-of-the-art techniques such as DBT generates high simulation performance, the framework is also platform independent and can run on any J2SE-compliant Java Runtime Environment. In spite of this platform independence, the native code generated in the second stage will even profit from the platform-specific optimizations performed by modern JVM implementations. Our second contribution is HPADL, the instruction set description language that provides the retargetability of our framework. HPADL is tailored for the specific needs of dynamically compiling full-system IS simulation. Due to its clean separation of concerns between the instruction decoding and instruction execution, it easily enables DBT. Also, it is not restricted to a specific range of target architectures such as RISC. In this paper, we will compare the modeling effort in HPADL to that of QEMU. For our experiments and in order to show the practicability and flexibility of our approach, we implemented HPADL models of the DLX, 8086, ARMv4 and PowerPC/PowerPC VLE ISA as well as some IO device models in Java. A comparison with the simulation performance of QEMU by reference of the EEMBC AutoBench 1.1 shows that we achieve 78% of the QEMU performance on average.","PeriodicalId":169989,"journal":{"name":"Principles and Practice of Programming in Java","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129764218","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

Optimized memory management for class metadata in a JVM 为JVM中的类元数据优化了内存管理

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093182

Thomas Schatzl, L. Daynès, H. Mössenböck

{"title":"Optimized memory management for class metadata in a JVM","authors":"Thomas Schatzl, L. Daynès, H. Mössenböck","doi":"10.1145/2093157.2093182","DOIUrl":"https://doi.org/10.1145/2093157.2093182","url":null,"abstract":"A Java virtual machine (JVM) typically manages large amounts of class metadata (e.g. class descriptors, methods, byte codes) in main-memory. In this paper, we analyze the impact of metadata memory management on garbage collection costs in an industrial-strength JVM. We show that, for most applications in the latest DaCapo benchmark suite, the tracing of class metadata accounts for a significant part of full collection time.\u0000 We propose a novel approach to metadata memory management based on metaspaces and on a linkset graph. Metaspaces store class metadata segregated by their class loader and keep an exact record of references from class metadata to the heap. The linkset graph summarizes what metaspaces reference others via resolved symbolic links. Metaspaces allow en masse reclamation of the storage allocated to classes defined by a class loader when this class loader becomes unreachable. The linkset graph eliminates the need to trace references between metadata to determine the liveness of classes and of the heap objects they refer to.\u0000 This reduces the number of visited references in class metadata to less than 1% of the original amount and cuts down tracing time by up to 80%. Average full heap collection time improves by at least 35% for all but one of the Dacapo benchmarks, and by more than 70% for six of them.\u0000 Metaspace-based management of class metadata also extends well to multi-tasking implementations of the JVM. It enables tasks to unload classes independently of other tasks.","PeriodicalId":169989,"journal":{"name":"Principles and Practice of Programming in Java","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128455581","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}

引用次数: 1

The SOUL tool suite for querying programs in symbiosis with Eclipse 用于查询与Eclipse共生的程序的SOUL工具套件

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093168

Coen De Roover, Carlos Noguera, Andy Kellens, V. Jonckers

{"title":"The SOUL tool suite for querying programs in symbiosis with Eclipse","authors":"Coen De Roover, Carlos Noguera, Andy Kellens, V. Jonckers","doi":"10.1145/2093157.2093168","DOIUrl":"https://doi.org/10.1145/2093157.2093168","url":null,"abstract":"Program queries can answer important software engineering questions that range from \"which expressions are cast to this type?\" over \"does my program attempt to read from a closed file?\" to \"does my code follow the prescribed design?\". In this paper, we present a comprehensive tool suite for querying Java programs. It consists of the logic program query language Soul, the Cava library of predicates for quantifying over an Eclipse workspace and the Eclipse plugin Barista for launching queries and inspecting their results. Barista allows other Eclipse plugins to peruse program query results which is facilitated by the symbiosis of Soul with Java -- setting Soul apart from other program query languages. This symbiosis enables the Cava library to forego the predominant transcription to logic facts of the queried program. Instead, the library queries the actual AST nodes used by Eclipse itself, making it trivial for any Eclipse plugin to find the AST nodes that correspond to a query result. Moreover, such plugins do not have to worry about having queried stale program information. We illustrate the extensibility of our suite by implementing a tool for co-evolving source code and annotations using program queries.","PeriodicalId":169989,"journal":{"name":"Principles and Practice of Programming in Java","volume":"74 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132192101","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}

引用次数: 56

DeepFJig: modular composition of nested classes DeepFJig:嵌套类的模块化组合

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093172

A. Corradi, M. Servetto, E. Zucca

引用次数: 6

Optimizing interpreters by tuning opcode orderings on virtual machines for modern architectures: or: how I learned to stop worrying and love hill climbing 通过调整现代架构的虚拟机上的操作码顺序来优化解释器;或者:我如何学会停止担忧，爱上爬山

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093183

Jason McCandless, David Gregg

引用次数: 6

Portable and accurate collection of calling-context-sensitive bytecode metrics for the Java virtual machine 用于Java虚拟机的可移植且准确的调用上下文敏感字节码度量集合

Principles and Practice of Programming in Java Pub Date : 2011-08-24 DOI: 10.1145/2093157.2093160

Aibek Sarimbekov, Andreas Sewe, Walter Binder, Philippe Moret, Martin Schoeberl, M. Mezini

{"title":"Portable and accurate collection of calling-context-sensitive bytecode metrics for the Java virtual machine","authors":"Aibek Sarimbekov, Andreas Sewe, Walter Binder, Philippe Moret, Martin Schoeberl, M. Mezini","doi":"10.1145/2093157.2093160","DOIUrl":"https://doi.org/10.1145/2093157.2093160","url":null,"abstract":"Calling-context profiles and dynamic metrics at the bytecode level are important for profiling, workload characterization, program comprehension, and reverse engineering. Prevailing tools for collecting calling-context profiles or dynamic bytecode metrics often provide only incomplete information or suffer from limited compatibility with standard JVMs. However, completeness and accuracy of the profiles is essential for tasks such as workload characterization, and compatibility with standard JVMs is important to ensure that complex workloads can be executed. In this paper, we present the design and implementation of JP2, a new tool that profiles both the inter- and intra-procedural control flow of workloads on standard JVMs. JP2 produces calling-context profiles preserving callsite information, as well as execution statistics at the level of individual basic blocks of code. JP2 is complemented with scripts that compute various dynamic bytecode metrics from the profiles. As a case-study and tutorial on the use of JP2, we use it for cross-profiling for an embedded Java processor.","PeriodicalId":169989,"journal":{"name":"Principles and Practice of Programming in Java","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121821439","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}

引用次数: 25