In Search Computing, queries act over internet resources, and combine access to standard web services with exact results and to ranked search services. Such resources often provide limited statistical information that can be used to inform static query optimization, and correlations between the values and ranks associated with different resources may only become clear at query runtime. As a res...

FlexRTS is a dynamically configurable and extensible run-time system for Orca, a high performance parallel programming system. It provides run-time and application programmers with full control over the implementation and placement of kernel and user-level modules (device drivers, protocol stacks, thread packages, etc.). This allows programmers to optimize the run-time system on a per applicati...

This paper presents a tool for dynamic loading of components into run-time environments. This tool was implemented in the context of the Odyssey environment. Using this tool, it is possible to select, at runtime, the desired set of functionality for the Odyssey environment. Depending on the selected configuration, new components are downloaded and dynamically plugged into the environment. Moreo...

The dynamic re-programming of embedded systems is a long-standing problem in the field. With the advent of wireless sensor networks and the ‘Internet of Things’ it has now become necessary to be able to reprogram at run-time due to the difficulty of gaining access to such systems once deployed. The issues of power consumption, flexibility, and operating system protections are examined for a ran...

According to a study in 2002 commisioned by a US Department, software bugs annually costs the US economy an estimated $59 billion. A more recent study in 2013 by Cambridge University estimated that the global cost has risen to $312 billion globally. There exists various ways to prevent, isolate and fix software bugs, ranging from lightweight methods that are (semi)-automatic, to heavyweight met...

Traditional approaches for program comprehension use static program analysis or dynamic program analysis in the form of execution traces. Our approach, however, makes use of runtime-data such as parameter and object values. Compared to traditional program comprehension techniques, this approach enables fundamentally new ways of program analysis which we have not seen so far. Reflection analysis...

......................................................................................................................................... iv Chapter 1: Introduction and Motivation ......................................................................................... 1 Chapter 2: Background ..........................................................................................................

Current parallelizing compilers cannot identify a signi cant fraction of fully parallel loops because they have complex or statically insu ciently de ned access patterns. Since fully parallel loops arise frequently in practice, we have developed methods to speculatively execute loops concurrently. These methods can be applied to any loop, even if the iteration space of the loop is unknown, as i...

This paper describes a framework and tools for automating the production of designs which can be partially recon gured at run time. The tools include: (i) a partial evaluator, which produces con guration les for a given design, where the number of con gurations can be minimised by a process known as compile-time sequencing; (ii) an incremental con guration calculator, which takes the output of ...

Adaptive Computing is a relatively new research area [1]. The main thrust of this research area so far has been on programmable/configurable hardware. Significant successes have been reported. The programmable gate array (FPGA) technology has matured producing very high-density gate arrays (~1 million gates) with lower configuration times. A variety of hardware platforms comprising of microproc...