Platform‐independent profiling in a virtual execution environment

Virtual execution environments, such as the Java virtual machine, promote platform‐independent software development. However, when it comes to analyzing algorithm complexity and performance bottlenecks, available tools focus on platform‐specific metrics, such as the CPU time consumption on a particular system. Other drawbacks of many prevailing profiling tools are high overhead, significant measurement perturbation, as well as reduced portability of profiling tools, which are often implemented in platform‐dependent native code. This article presents a novel profiling approach, which is entirely based on program transformation techniques, in order to build a profiling data structure that provides calling‐context‐sensitive program execution statistics. We explore the use of platform‐independent profiling metrics in order to make the instrumentation entirely portable and to generate reproducible profiles. We implemented these ideas within a Java‐based profiling tool called JP. A significant novelty is that this tool achieves complete bytecode coverage by statically instrumenting the core runtime libraries and dynamically instrumenting the rest of the code. JP provides a small and flexible API to write customized profiling agents in pure Java, which are periodically activated to process the collected profiling information. Performance measurements point out that, despite the presence of dynamic instrumentation, JP causes significantly less overhead than a prevailing tool for the profiling of Java code. Copyright © 2008 John Wiley & Sons, Ltd.     

Polymorphic bytecode instrumentation

Bytecode instrumentation is a widely used technique to implement aspect weaving and dynamic analyses in virtual machines such as the Java virtual machine. Aspect weavers and other instrumentations are usually developed independently and combining them often requires significant engineering effort, if at all possible. In this article, we present polymorphic bytecode instrumentation(PBI), a simple but effective technique that allows dynamic dispatch amongst several, possibly independent instrumentations. PBI enables complete bytecode coverage, that is, any method with a bytecode representation can be instrumented. We illustrate further benefits of PBI with three case studies. First, we describe how PBI can be used to implement a comprehensive profiler of inter‐procedural and intra‐procedural control flow. Second, we provide an implementation of execution levels for AspectJ, which avoids infinite regression and unwanted interference between aspects. Third, we present a framework for adaptive dynamic analysis, where the analysis to be performed can be changed at runtime by the user. We assess the overhead introduced by PBI and provide thorough performance evaluations of PBI in all three case studies. We show that pure Java profilers like JP2 can, thanks to PBI, produce accurate execution profiles by covering all code, including the core Java libraries. We then demonstrate that PBI‐based execution levels are much faster than control flow pointcuts to avoid interference between aspects and that their efficient integration in a practical aspect language is possible. Finally, we report that PBI enables adaptive dynamic analysis tools that are more reactive to user inputs than existing tools that rely on dynamic aspect‐oriented programming with runtime weaving. These experiments position PBI as a widely applicable and practical approach for combining bytecode instrumentations. © 2015 The Authors. Software: Practice and Experience Published by John Wiley & Sons Ltd.     

Workload characterization of JVM languages

Originally developed with a single language in mind, the JVM is now targeted by numerous programming languages—its automatic memory management, just‐in‐time compilation, and adaptive optimizations—making it an attractive execution platform. However, the garbage collector, the just‐in‐time compiler, and other optimizations and heuristics were designed primarily with the performance of Java programs in mind. Consequently, many of the languages targeting the JVM, and especially the dynamically typed languages, are suffering from performance problems that cannot be simply solved at the JVM side. In this article, we aim to contribute to the understanding of the character of the workloads imposed on the JVM by both dynamically typed and statically typed JVM languages. To this end, we introduce a new set of dynamic metrics for workload characterization, along with an easy‐to‐use toolchain to collect the metrics. We apply the toolchain to applications written in six JVM languages (Java, Scala, Clojure, Jython, JRuby, and JavaScript) and discuss the findings. Given the recently identified importance of inlining for the performance of Scala programs, we also analyze the inlining behavior of the HotSpot JVM when executing bytecode originating from different JVM languages. As a result, we identify several traits in the non‐Java workloads that represent potential opportunities for optimization. © 2015 The Authors. Software: Practice and Experience Published by John Wiley & Sons Ltd.     

Command governor for constrained switched systems with scheduled model transition dwell times

In this paper, a switched control architecture for constrained control systems is presented. The strategy is based on command governor ideas that are here specialized to ‘optimally’ schedule switching events on the plant dynamics for improving control performance at the expense of low computational burdens. The significance of the method mainly lies in its capability to avoid constraints violation and loss of stability regardless of any configuration change occurrence in the plant/constraint structure. To this end, the concept of model transition dwell time is used within the proposed control framework to formally define the minimum time necessary to enable a switching event under guaranteed conditions on the overall stability and constraint fulfilment. Simulation results on a simple linear system and on a Cessna 182 aircraft model show the effectiveness of the proposed strategy. Copyright © 2017 John Wiley & Sons, Ltd.     

Improved approaches to the exact solution of the machine covering problem

For the basic problem of scheduling a set of n independent jobs on a set of m identical parallel machines with the objective of maximizing the minimum machine completion time—also referred to as machine covering—we propose a new exact branch-and-bound algorithm. Its most distinctive components are a different symmetry-breaking solution representation, enhanced lower and upper bounds, and effective novel dominance criteria derived from structural patterns of optimal schedules. Results of a comprehensive computational study conducted on benchmark instances attest to the effectiveness of our approach, particularly for small ratios of n to m.     

Enhanced ground support: lessons from work on reduced crew operations

Cognition, Technology & Work - From the 1950s through the 1980s, aircraft design was marked by an increase in reliability and automation, and, correspondingly, a decrease in the crew complement...     

A Class of Smoothers for Saddle Point Problems

In this paper smoothing properties are shown for a class of iterative methods for saddle point problems with smoothing rates of the order 1/m, where m is the number of smoothing steps. This generalizes recent results by Braess and Sarazin, who could prove this rates for methods where, in the context of the Stokes problem, the pressure correction equation is solved exactly, which is not needed here. Received December 4, 1998; revised April 14, 2000     

Mikromethode zur quantitativen Bestimmung von Coffein

Zusammenfassung Zur quantitativen Bestimmung von Coffein in biologischem Material wird ein kombiniertes Verfahren aus Dünnschichtchromatographie und Densitometrie beschrieben. Das Verfahren läßt Bestimmungen im Nanogramm-Bereich zu. Das Probenvolumen liegt unter 100 l.Die Proben — Capillarblut — werden zunächst mit dem gleichen Volumen Chloroform extrahiert. Anschließend wird das Coffein mittels Dünnschichtchromatographie von Begleitstoffen und störenden Substanzen abgetrennt. Es werden Kieselgel-60-Fertigplatten und Chlorofom/Aceton (9 + 1; v/v) als Fließmittel verwendet, dabei beträgt die Laufzeit 30 min.Die quantitative densitometrische Auswertung erfolgt durch Remissionsmessung bei 273 nm. Im Bereich von 10–60 ng Coffein/Fleck verläuft die Eichkurve linear. 1 mg/I Coffein kann noch sicher quantitativ erfaßt werden. Die Nachweisgrenze liegt bei 0,1 mg/1.

---

A quantitative micromethod for the caffeine determination

Summary A combined procedure with thin-layer-chromatography and densitometry is described for the quantitative estimation of caffeine in biological material. This method ist applicable in the nanogram range. Test samples of less than 100 l may be used. The samples (capillary-blood) are extracted with the same volume of chloroform. Caffeine is separated from interfering compounds by thin-layer-chromatography. Commercial silica-60-plates with chloroform/acetone (9 + 1; v/v) as solvent are used. The running time is about 30 min. The quantitative densitometric determinations are performed in the remission mode at 273 nm. In the range from 10 to 60 ng/spot the calibration curve is linear. Accurate quantitative data will be obtained even at concentrations of 1 mg/1 caffeine. The detection limit is at about 0.1 mg/1.

     

Development of an interlocked nail for segmental defects in the rabbit tibia

Previous animal models have been developed to study intramedullary nailing for challenging segmental defects in the tibia. In large animals, interlocked nail fixation created a stable environment suitable to study new bone growth technologies placed in the defect. To our knowledge, there are no comparable interlocked tibial defect models for the rabbit in which new technologies could be evaluated. Such a model would be helpful since the rabbit is a popular initial model for orthopedic research studies owing to its wide availability and low cost. While numerous studies have nailed the rabbit tibia, all were non-locked implants that allowed some degree of instability between the fracture fragments. In addition, the non-locked nails were constructed of stainless steel, whereas human nails are increasingly made from titanium alloy. In the current study, an interlocked titanium nail was developed for the rabbit tibia. It was implanted in cadaver tibiae and subjected to fatigue cycling in combined compression and bending at physiologic levels to 21,061 cycles. This duration is estimated to represent 12 weeks of gait by the animal. Before and after fatigue cycling, monotonic testing was performed in compression and bending at physiologic levels. The intact contralateral limbs served as controls. All limbs completed the cycling; the instrumented limbs exhibited interfragmentary cyclic strain amplitudes during fatigue (616 +/- 139 micro-strain), which was significantly greater than the control limbs (136 +/- 35 microstrain). Monotonic strain amplitudes for the test limbs in bending and compression were 4839 +/- 1028 and 542 +/- 122 microstrain, respectively; corresponding values for the control bones were 407 +/- 118 and 95 +/- 38 microstrain, respectively. These data are similar to those presented in prior studies in larger bone models. The current study presents one method for interlocked nail fixation for this complex tibial shaft fracture in a small animal.     

Correlation between machining direction,cutter geometry and step-over distance in 3-axis milling: Application to milling by zones

Computer-Aided Manufacturing (CAM) occupies an increasingly important role in engineering with all it has to offer in terms of new possibilities and improving designer/manufacturer productivity. The present study addresses machining of free-form surfaces on a 3-axis NC machine tool. There have recently been a large number of studies devoted to planning tool paths on free-form surfaces with various strategies being adopted. These strategies are intended to increase efficiency by reducing the overall length of machining. Often, the choice of the cutter is arbitrary and the work focuses on planning. In order to boost productivity, the present work offers assistance in choosing the cutting tool, the machining direction and cutting by surface zones, adopting a milling strategy by parallel planes. To do so, a comparison is made between milling using a spherical end milling cutter and a torus end milling cutter with the same outer radius. This comparison relates to the radius of curvature of the trace left by the cutter at the point of contact between the tool and the workpiece in relation to the direction of feed motion.