Generic low-latency NoC router architecture for FPGA computing systems

A novel cost-effective and low-latency wormhole router for packet-switched NoC designs, tailored for FPGA, is presented. This has been designed to be scalable at system level to fully exploit the characteristics and constraints of FPGA based systems, rather than custom ASIC technology. A key feature is that it achieves a low packet propagation latency of only two cycles per hop including both router pipeline delay and link traversal delay - a significant enhancement over existing FPGA designs - whilst being very competitive in terms of performance and hardware complexity. It can also be configured in various network topologies including 1-D, 2-D, and 3-D. Detailed design-space exploration has been carried for a range of scaling parameters, with the results of various design trade-offs being presented and discussed. By taking advantage of abundant buildin reconfigurable logic and routing resources, we have been able to create a new scalable on-chip FPGA based router that exhibits high dimensionality and connectivity. The architecture proposed can be easily migrated across many FPGA families to provide flexible, robust and cost-effective NoC solutions suitable for the implementation of high-performance FPGA computing systems. © 2011 IEEE.

Mathematical Modelling of a Reciprocating Piston Expander

Modern internal combustion (IC) engines reject around two thirds of the energy provided by the fuel as low-grade waste heat. Capturing a portion of this waste heat energy and transforming it into a more useful form of energy could result in a significant reduction in fuel consumption. By using the low-grade heat, an organic Rankine cycle (ORC) can produce mechanical work from a pressurised organic fluid with the use of an expander.
Ideal gas assumptions are shown to produce significant errors in expander performance predictions when using an organic fluid. This paper details the mathematical modelling technique used to accurately model the thermodynamic processes for both ideal and non-ideal fluids within the reciprocating expander. A comparison between the two methods illustrates the extent of the errors when modelling a reciprocating piston expander. Use of the ideal gas assumptions are shown to produce an error of 55% in the prediction of power produced by the expander when operating on refrigerant R134a.

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

The scheduling problem in distributed data-intensive computing environments has become an active research topic due to the tremendous growth in grid and cloud computing environments. As an innovative distributed intelligent paradigm, swarm intelligence provides a novel approach to solving these potentially intractable problems. In this paper, we formulate the scheduling problem for work-flow applications with security constraints in distributed data-intensive computing environments and present a novel security constraint model. Several meta-heuristic adaptations to the particle swarm optimization algorithm are introduced to deal with the formulation of efficient schedules. A variable neighborhood particle swarm optimization algorithm is compared with a multi-start particle swarm optimization and multi-start genetic algorithm. Experimental results illustrate that population based meta-heuristics approaches usually provide a good balance between global exploration and local exploitation and their feasibility and effectiveness for scheduling work-flow applications. © 2010 Elsevier Inc. All rights reserved.

Rigorous Specification and Low-Latency Implementation of Technical Market Indicators

Technical market indicators are tools used by technical an- alysts to understand trends in trading markets. Technical (market) indicators are often calculated in real-time, as trading progresses. This paper presents a mathematically- founded framework for calculating technical indicators. Our framework consists of a domain specific language for the un- ambiguous specification of technical indicators, and a run- time system based on Click, for computing the indicators. We argue that our solution enhances the ease of program- ming due to aligning our domain-specific language to the mathematical description of technical indicators, and that it enables executing programs in kernel space for decreased latency, without exposing the system to users’ programming errors.

Review of constitutive models for describing the time dependent behaviour of soft clays

Different classes of constitutive models have been proposed to capture the time-dependent behaviour of soft soil (creep, stress relaxation, rate dependency). This paper critically reviews many of the models developed based on understanding of the time dependent stress-strain-stress rate-strain rate behaviour of soils and viscoplasticity in terms of their strengths and weaknesses. Some discussion is also made on the numerical implementation aspects of these models. Typical findings from numerical analyses of geotechnical structures constructed on soft soils are also discussed. The general elastic viscoplastic (EVP) models can roughly be divided into two categories: models based on the concept of overstress and models based on non-stationary flow surface theory. Although general in structure, both categories have their own strengths and shortcomings. This review indicates that EVP analysis is yet to be vastly used by the geotechnical engineers, apparently due to the mathematical complication involved in the formulation of the constitutive models, unconvincing benefit in terms of the accuracy of performance prediction, requirement of additional soil parameter(s), difficulties in determining them, and the necessity of excessive computing resources and time. © 2013 Taylor & Francis.

Sequential measurement-based quantum computing with memories

We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the cluster state needed for the computation and its consumption by measurements are carried out simultaneously. As a consequence, effective clusters of one spatial dimension fewer than in the standard approach are sufficient for computation. In particular, universal computation requires only a one-dimensional array of memories. The scheme applies to discrete-variable systems of any dimension as well as to continuous-variable ones, and both are treated equivalently under the light of local complementation of graphs. In this way our formalism introduces a general framework that encompasses and generalizes in a unified manner some previous system-dependent proposals. The procedure is intrinsically well suited for implementations with atom-photon interfaces.

Energy Efficiency through Significance-Based Computing

An extension of approximate computing, significance-based computing exploits applications' inherent error resiliency and offers a new structural paradigm that strategically relaxes full computational precision to provide significant energy savings with minimal performance degradation.

Derivation of scientific software from mathematical specifications

Often the modification and enhancement of large scientific software systems are severely hampered because many components of the system are written in an implementation dependent fashion, they are inadequately documented, and their functionalities are not precisely known. In this paper we consider how mathematics may be employed to alleviate some of these problems. In particular, we illustrate how the formal specification notation VDM-SL is being used to specify precisely abstract data types for use in the development of scientific software.