Parallel I/O scheduling in the presence of data duplication on multiprogrammed cluster computing systems

The widespread adoption of cluster computing as a high performance computing platform has seen the growth of data intensive scientific, engineering and commercial applications such as digital libraries, climate modeling, computational chemistry, computational fluid dynamics and image repositories. However, I/O subsystem performance has not been keeping pace with processor and memory performance, and is fast becoming the dominant factor in overall system performance.  Thus, parallel I/O has become a necessity in the face of performance improvements in other areas of computing systems. This paper addresses the problem of parallel I/O scheduling on cluster computing systems in the presence of data replication.  We propose two new I/O scheduling algorithms and evaluate the relative performance of the proposed policies against two existing approaches.  Simulation results show that the proposed policies perform substantially better than the baseline policies.

Robust parallel filtering design of a swarm tracking system

Swarming networks of mobile autonomous agents require inter-agent position information in order perform various tasks. The primary control input for the majority of current control strategies is inter-agent distance information. In this paper we provide a robust parallel filter based tracking scheme that allows a mobile agent to track other multiple mobile agents. The distance, angle, and relative position is given in a direct target tracking output. This allows the mobile agent to decide which information is best suited for the particular objective

High-precision five-axis machine for high-speed material processing using linear motors and parallel-serial kinematics

The paper describes some details of the mechanical and kinematics design of a five-axis mechanism. The design has been utilized to physically realize an industrial-scale five-axis milling machine that can carry a three KW spindle. However, the mechanism could be utilized in other material processing and factory automation applications. The mechanism has five rectilinear joints/axes. Two of these axes are arranged traditionally, i.e. in series, and the other three axes utilize the concept of parallel kinematics. This combination results in a design that allows three translational and two rotational two-mode degrees of freedom (DOFs). The design provides speed, accuracy and cost advantages over traditional five-axis machines. All axes are actuated using linear motors.

Asymmetrical three-DOFs rotational-translational parallel-kinematics mechanisms based on lie group theory

The paper introduces four families of three-DOFs translational-rotational Parallel-Kinematics Mechanisms (PKMs) as well as the mobility analysis of such families using Lie group theory. Two of these families are mechanisms with one-rotational two-translational degrees of freedom (DOFs) and each of the other two has one-translational two-rotational DOFs. Four novel mechanisms are presented and discussed as representatives of these four families. Although these mechanisms are asymmetric, the components used to realise them are very similar and, hence, there is no great departure from the favourable modularity of parallel-kinematics mechanisms.

Contemporaneous intra-day volume, option, and futures volatility transmissions across parallel markets

The primary objective of this article is to investigate volatility transmission across three parallel markets operating on the Sydney Futures Exchange (SFE), both within and out of sample. Half-hourly observations are sampled from transaction data for the share price index (SPI) futures, SPI futures options, and 90-day bank accepted bill (BAB) futures markets, and the analysis is carried out using the simultaneous volatility (SVL) system of equations as well as competing volatility models. The results confirm the poor ability of GARCH models to fit intraday data. This study also applies an artificial nesting procedure to evaluate the out-of-sample volatility forecasts. Implied volatility has very limited (if any) predictive power when evaluated in isolation, whereas the SVL model with implied volatility embedded provides incremental information relative to competing model forecasts.

The performance of a parallel TSP program and byte sequential benchmarks executing on a shared cluster

Although individual PCs of a cluster are used by their owners to run sequential applications (local jobs), the cluster as a whole or its subset can also be employed to run parallel applications (cluster jobs) even during working hours. This implies that these computers have to be shared by parallel and sequential applications, which could lead to the improvement of the execution performance and resource utilization. However, there is a lack of experimental study showing the behavior and performance of executing parallel and sequential applications concurrently on a non-dedicated cluster. The result of such research would be beneficial for the development of new global scheduling algorithms. We present the result of an experimental study into scheduling of a mixture of parallel and sequential applications on a non-dedicated cluster. The aim of this study is to learn how the concurrent execution of a communication intensive parallel application and sequential applications influences their execution performance and utilization of the cluster.

Two-mode overconstrained three-DOFs rotational-translational linear-motor-based parallel-kinematics mechanism for machine tool applications

The paper introduces a family of three-DOFs translational-rotational Parallel-Kinematics Mechanisms (PKMs) as well as the mobility analysis of such family using Lie-group theory. Each member of this family has two-rotational one-translational DOFs. A novel mechanism is presented and analyzed as a representative of that family. The use and the practical value of that modular mechanism are emphasized.

A parallel downloading algorithm for redundant networks

In this paper, we study the downloading mechanism of BitTorrent (or BT), a P2P based popular and convenient parallel downloading software tool, point out some of its limitations, and propose an algorithm to improve its performance. In particular, we address the limitations of BT by using neighbours in P2P networks to resolve the redundant copies problem and to optimise the downloading speed. Our preliminary experiments show that the proposed enhancement algorithm works well.

An enhanced parallel downloading algorithm for BT

BitTorrent (or BT) is a P2P based popular and convenient parallel downloading software tool. In this paper, we study the downloading mechanism of BitTorrent, point out some of its limitations, and propose an algorithm to improve its performance. Two major limitations of BitTorrent are, first its downloading speed is slow at the beginning of a downloading or when there is only a few clients. Second, current algorithms cannot achieve the best
parallel downloading degree as the selection of sub-pieces is random, and a file may not be downloaded when the file provider leaves the network unexpectedly. In this paper we address these problems by using neighbours in P2P networks to resolve the redundant copies and to optimise the download speed. Our preliminary experiments show that the proposed enhancement algorithm works well.

Delay control and parallel admission algorithms for real-time anycast flow

An anycast flow is a flow that can be connected to any one of the members in a group of designated (replicated) servers (called anycast group). In this paper, we derive a set of formulas for calculating the end-to-end delay bound for the anycast flows and present novel admission control algorithms for anycast flows with real-time constraints. Given such an anycast group, our algorithms can effectively select the paths for anycast flows' admission and connection based on the least end-to-end delay bounds evaluated. We also present a parallel admission control algorithm that can effectively calculate the available paths with a short delay bound for different destinations in the anycast group so that a best path with the shortest delay bound can be chosen.

A parallel DNA fragment assembly algorithm based on eulerian superpath approach

Fragments assembly is among the core problems in the research of Genome. Although many assembly tools based on the "overlap-layout-consensus" paradigm are widely used such as in the Human Genome Project currently, they still can not resolve the "repeats problem" in the DNA sequencing. For the purpose of resolving such problem, Pevzner et al. put forward a new Euler Superpath assembly algorithm. But it needs a big and complex de Bruijin graph which consumes large amounts of memories i.e. becomes the bottleneck of the performance. We present a parallel DNA fragment assembly algorithm based on the Eularian Superpath theory and solve the bottleneck in the current assembly program. The experimental results demonstrate that our approach has a good scalability, and can be used in DNA assembly of middle and large size of eukaryote genome.