Acceleration-as-a-Service: Exploiting Virtualised GPUs for a Financial Application

'How can GPU acceleration be obtained as a service in a cluster?' This question has become increasingly significant due to the inefficiency of installing GPUs on all nodes of a cluster. The research reported in this paper is motivated to address the above question by employing rCUDA (remote CUDA), a framework that facilitates Acceleration-as-a-Service (AaaS), such that the nodes of a cluster can request the acceleration of a set of remote GPUs on demand. The rCUDA framework exploits virtualisation and ensures that multiple nodes can share the same GPU. In this paper we test the feasibility of the rCUDA framework on a real-world application employed in the financial risk industry that can benefit from AaaS in the production setting. The results confirm the feasibility of rCUDA and highlight that rCUDA achieves similar performance compared to CUDA, provides consistent results, and more importantly, allows for a single application to benefit from all the GPUs available in the cluster without loosing efficiency.Comment: 11th IEEE International Conference on eScience (IEEE eScience) - Munich, Germany, 201

Lightweight Asynchronous Snapshots for Distributed Dataflows

Distributed stateful stream processing enables the deployment and execution of large scale continuous computations in the cloud, targeting both low latency and high throughput. One of the most fundamental challenges of this paradigm is providing processing guarantees under potential failures. Existing approaches rely on periodic global state snapshots that can be used for failure recovery. Those approaches suffer from two main drawbacks. First, they often stall the overall computation which impacts ingestion. Second, they eagerly persist all records in transit along with the operation states which results in larger snapshots than required. In this work we propose Asynchronous Barrier Snapshotting (ABS), a lightweight algorithm suited for modern dataflow execution engines that minimises space requirements. ABS persists only operator states on acyclic execution topologies while keeping a minimal record log on cyclic dataflows. We implemented ABS on Apache Flink, a distributed analytics engine that supports stateful stream processing. Our evaluation shows that our algorithm does not have a heavy impact on the execution, maintaining linear scalability and performing well with frequent snapshots.Comment: 8 pages, 7 figure

Anisotropic lattices for precision computations in heavy flavor physics

We study the anisotropic lattice QCD for precision computations of heavy-light matrix elements. Our previous study in which the lattices are calibrated with a few percent accuracy has already given results comparable to the existing calculations. This suggests that even higher precision may be achieved by a more precise calibration of anisotropic lattices. We describe our strategy to tune the gauge and quark parameters with accuracies much less than 1 % in the quenched approximation.Comment: 3 papes, 2 figures, Lattice2003(heavy

Anisotropic lattice with nonperturbative accuracy

We determine the nonperturbative anisotropic parameter of the gauge action in the quenched approximation with less than 1% accuracy using the Sommer scale measured by the L\"uscher-Weisz algorithm or smearing technique. We also study the nonperturbative O(a)-improvement of the quark action. The bare quark anisotropy is determined using the masses from the temporal and spatial directions. For the determination of the $O(a)$ improvement coefficients, we apply the Schr\"odinger functional method.Comment: 3 pages, 5 figures, Lattice2004(improved

Well-posed lateral boundary conditions for spectral semi-implicit semi-Lagrangian schemes : tests in a one-dimensional model

The aim of this paper is to investigate the feasibility of well-posed lateral boundary conditions in a Fourier spectral semi-implicit semi-Lagrangian one-dimensional model. Two aspects are analyzed: (i) the complication of designing well-posed boundary conditions for a spectral semi-implicit scheme and (ii) the implications of such a lateral boundary treatment for the semi-Lagrangian trajectory computations at the lateral boundaries. Straightforwardly imposing boundary conditions in the gridpoint-explicit part of the semi-implicit time-marching scheme leads to numerical instabilities for time steps that are relevant in today's numerical weather prediction applications. It is shown that an iterative scheme is capable of curing these instabilities. This new iterative boundary treatment has been tested in the framework of the one-dimensional shallow-water equations leading to a significant improvement in terms of stability. As far as the semi-Lagrangian part of the time scheme is concerned, the use of a trajectory truncation scheme has been found to be stable in experimental tests, even for large values of the advective Courant number. It is also demonstrated that a well-posed buffer zone can be successfully applied in this spectral context. A promising (but not easily implemented) alternative to these three above-referenced schemes has been tested and is also presented here