Dynamic binary translation using run-time feedbacks

Dynamic binary translation is the process of translating, modifying and rewriting executable (binary) code from one machine to another at run-time. This process of low-level re-engineering consists of a reverse engineering phase followed by a forward engineering phase. UQDBT, the University of Queensland Dynamic Binary Translator, is a machine-adaptable translator. Adaptability is provided through the specification of properties of machines and their instruction sets, allowing the support of different pairs of source and target machines. Most binary translators are closely bound to a pair of machines, making analyses and code hard to reuse. Like most virtual machines, UQDBT performs generic optimizations that apply to a variety of machines. Frequently executed code is translated to native code by the use of edge weight instrumentation, which makes UQDBT converge more quickly than systems based on instruction speculation. In this paper, we describe the architecture and run-time feedback optimizations performed by the UQDBT system, and provide results obtained in the x86 and SPARC® platforms.

Relationship between laboratory-measured variables and heart rate during an ultra-endurance triathlon

The aim of the present study was to examine the relationship between the performance heart rate during an ultra-endurance triathlon and the heart rate corresponding to several demarcation points measured during laboratory-based progressive cycle ergometry and treadmill running. Less than one month before an ultra-endurance triathlon, 21 well-trained ultra-endurance triathletes (mean +/- s: age 35 +/- 6 years, height 1.77 +/- 0.05 in, mass 74.0 +/- 6.9 kg, (V) over dot O-2peak = 4.75 +/- 0.42 1 center dot min(-1)) performed progressive exercise tests of cycle ergometry and treadmill running for the determination of peak oxygen uptake ((V) over do O-2peak), heart rate corresponding to the first and second ventilatory thresholds, as well as the heart rate deflection point. Portable telemetry units recorded heart rate at 60 s increments throughout the ultra-endurance triathlon. Heart rate during the cycle and run phases of the ultra-endurance triathlon (148 +/- 9 and 143 +/- 13 beats center dot min(-1) respectively) were significantly (P < 0.05) less than the second ventilatory thresholds (160 +/- 13 and 165 +/- 14 beats center dot min(-1) respectively) and heart rate deflection points (170 +/- 13 and 179 +/- 9 beats center dot min(-1) respectively). However, mean heart rate during the cycle and run phases of the ultra-endurance triathlon were significantly related to (r = 0.76 and 0.66; P < 0.01), and not significantly different from, the first ventilatory thresholds (146 +/- 12 and 148 +/- 15 beats center dot min(-1) respectively). Furthermore, the difference between heart rate during the cycle phase of the ultra-endurance triathlon and heart rate at the first ventilatory threshold was related to marathon run time (r = 0.61; P < 0.01) and overall ultra-endurance triathlon time (r = 0.45; P < 0.05). The results suggest that triathletes perform the cycle and run phases of the ultra-endurance triathlon at an exercise intensity near their first ventilatory threshold

The value of a small microkernel for dreamy memory and the RAMpage memory hierarchy

This paper explores potential for the RAMpage memory hierarchy to use a microkernel with a small memory footprint, in a specialized cache-speed static RAM (tightly-coupled memory, TCM). Dreamy memory is DRAM kept in low-power mode, unless referenced. Simulations show that a small microkernel suits RAMpage well, in that it achieves significantly better speed and energy gains than a standard hierarchy from adding TCM. RAMpage, in its best 128KB L2 case, gained 11% speed using TCM, and reduced energy 14%. Equivalent conventional hierarchy gains were under 1%. While 1MB L2 was significantly faster against lower-energy cases for the smaller L2, the larger SRAM's energy does not justify the speed gain. Using a 128KB L2 cache in a conventional architecture resulted in a best-case overall run time of 2.58s, compared with the best dreamy mode run time (RAMpage without context switches on misses) of 3.34s, a speed penalty of 29%. Energy in the fastest 128KB L2 case was 2.18J vs. 1.50J, a reduction of 31%. The same RAMpage configuration without dreamy mode took 2.83s as simulated, and used 2.39J, an acceptable trade-off (penalty under 10%) for being able to switch easily to a lower-energy mode.

Procedure compilation in the refinement calculus

High-level language program compilation strategies can be proven correct by modelling the process as a series of refinement steps from source code to a machine-level description. We show how this can be done for programs containing recursively-defined procedures in the well-established predicate transformer semantics for refinement. To do so the formalism is extended with an abstraction of the way stack frames are created at run time for procedure parameters and variables.

A formal framework for modelling and analysing mobile systems

This paper presents a formal framework for modelling and analysing mobile systems. The framework comprises a collection of models of the dominant design paradigms which are readily extended to incorporate details of particular technologies, i.e., programming languages and their run-time support, and applications. The modelling language is Object-Z, an extension of the well-known Z specification language with explicit support for object-oriented concepts. Its support for object orientation makes Object-Z particularly suited to our task. The system structuring techniques offered by object-orientation are well suited to modelling mobile systems. In addition, inheritance and polymorphism allow us to exploit commonalities in mobile systems by defining more complex models in terms of simpler ones.

Towards a methodology for deriving contract-compliant business processes

This paper presents a methodology for deriving business process descriptions based on terms in business contract. The aim is to assist process modellers in structuring collaborative interactions between parties, including their internal processes, to ensure contract-compliant behaviour. The methodology requires a formal model of contracts to facilitate process derivations and to form a basis for contract analysis tools and run-time process execution.

Towards a standards-based autonomic context management system

Pervasive computing applications must be sufficiently autonomous to adapt their behaviour to changes in computing resources and user requirements. This capability is known as context-awareness. In some cases, context-aware applications must be implemented as autonomic systems which are capable of dynamically discovering and replacing context sources (sensors) at run-time. Unlike other types of application autonomy, this kind of dynamic reconfiguration has not been sufficiently investigated yet by the research community. However, application-level context models are becoming common, in order to ease programming of context-aware applications and support evolution by decoupling applications from context sources. We can leverage these context models to develop general (i.e., application-independent) solutions for dynamic, run-time discovery of context sources (i.e., context management). This paper presents a model and architecture for a reconfigurable context management system that supports interoperability by building on emerging standards for sensor description and classification.

Methods for conflict resolution in policy-based management systems

While developments in distributed object computing environments, such as the Common Object Request Broker Architecture (CORBA) [17] and the Telecommunication Intelligent Network Architecture (TINA) [16], have enabled interoperability between domains in large open distributed systems, managing the resources within such systems has become an increasingly complex task. This challenge has been considered for several years within the distributed systems management research community and policy-based management has recently emerged as a promising solution. Large evolving enterprises present a significant challenge for policy-based management partly due to the requirement to support both mutual transparency and individual autonomy between domains [2], but also because the fluidity and complexity of interactions occurring within such environments requires an ability to cope with the coexistence of multiple, potentially inconsistent policies. This paper discusses the need of providing both dynamic (run-time) and static (compile-time) conflict detection and resolution for policies in such systems and builds on our earlier conflict detection work [7, 8] to introduce the methods for conflict resolution in large open distributed systems.

Expression profiling of purified mouse gonadal somatic cells during the critical time window of sex determination reveals novel candidate genes for human sexual dysgenesis syndromes

Despite the identification of SRY as the testis-determining gene in mammals, the genetic interactions controlling the earliest steps of male sex determination remain poorly understood. In particular, the molecular lesions underlying a high proportion of human XY gonadal dysgenesis, XX maleness and XX true hermaphroditism remain undiscovered. A number of screens have identified candidate genes whose expression is modulated during testis or ovary differentiation in mice, but these screens have used whole gonads, consisting of multiple cell types, or stages of gonadal development well beyond the time of sex determination. We describe here a novel reporter mouse line that expresses enhanced green fluorescent protein under the control of an Sf1 promoter fragment, marking Sertoli and granulosa cell precursors during the critical period of sex determination. These cells were purified from gonads of male and female transgenic embryos at 10.5 dpc (shortly after Sry transcription is activated) and 11.5 dpc (when Sox9 transcription begins), and their transcriptomes analysed using Affymetrix genome arrays. We identified 266 genes, including Dhh, Fgf9 and Ptgds, that were upregulated and 50 genes that were downregulated in 11.5 dpc male somatic gonad cells only, and 242 genes, including Fst, that were upregulated in 11.5 dpc female somatic gonad cells only. The majority of these genes are novel genes that lack identifiable homology, and several human orthologues were found to map to chromosomal loci implicated in disorders of sexual development. These genes represent an important resource with which to piece together the earliest steps of sex determination and gonad development, and provide new candidates for mutation searching in human sexual dysgenesis syndromes.