Home About us Contact | |||
Computing Applications (computing + application)
Selected AbstractsDesign and implementation of a high-performance CCA event service,CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 9 2009Ian Gorton Abstract Event services based on publish,subscribe architectures are well-established components of distributed computing applications. Recently, an event service has been proposed as part of the common component architecture (CCA) for high-performance computing (HPC) applications. In this paper we describe our implementation, experimental evaluation, and initial experience with a high-performance CCA event service that exploits efficient communications mechanisms commonly used on HPC platforms. We describe the CCA event service model and briefly discuss the possible implementation strategies of the model. We then present the design and implementation of the event service using the aggregate remote memory copy interface as an underlying communication layer for this mechanism. Two alternative implementations are presented and evaluated on a Cray XD-1 platform. The performance results demonstrate that event delivery latencies are low and that the event service is able to achieve high-throughput levels. Finally, we describe the use of the event service in an application for high-speed processing of data from a mass spectrometer and conclude by discussing some possible extensions to the event service for other HPC applications. Published in 2009 by John Wiley & Sons, Ltd. [source] Usability levels for sparse linear algebra components,CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 12 2008M. Sosonkina Abstract Sparse matrix computations are ubiquitous in high-performance computing applications and often are their most computationally intensive part. In particular, efficient solution of large-scale linear systems may drastically improve the overall application performance. Thus, the choice and implementation of the linear system solver are of paramount importance. It is difficult, however, to navigate through a multitude of available solver packages and to tune their performance to the problem at hand, mainly because of the plethora of interfaces, each requiring application adaptations to match the specifics of solver packages. For example, different ways of setting parameters and a variety of sparse matrix formats hinder smooth interactions of sparse matrix computations with user applications. In this paper, interfaces designed for components that encapsulate sparse matrix computations are discussed in the light of their matching with application usability requirements. Consequently, we distinguish three levels of interfaces, high, medium, and low, corresponding to the degree of user involvement in the linear system solution process and in sparse matrix manipulations. We demonstrate when each interface design choice is applicable and how it may be used to further users' scientific goals. Component computational overheads caused by various design choices are also examined, ranging from low level, for matrix manipulation components, to high level, in which a single component contains the entire linear system solver. Published in 2007 by John Wiley & Sons, Ltd. [source] Technologies for value creation: an exploration of remote diagnostics systems in the manufacturing industryINFORMATION SYSTEMS JOURNAL, Issue 3 2008Katrin Jonsson Abstract., With firms increasingly relying on ubiquitous computing to implement major business initiatives, it is becoming ever more necessary to understand the technological aspects of business developments. This paper analyzes the use of remote diagnostics systems in the manufacturing industry and discusses the opportunities and challenges for the early adopters. It pays specific attention to the impact on business aspects such as the value creation process consisting of relationships, roles, and architecture and the value proposal consisting of a business offer and customer value. The study shows how ubiquitous computing allows manufacturers to become remote service providers while customers can either become co-creators of value or passive receivers of created value. Ubiquitous computing also creates possibilities for the manufacturing industry to design new kinds of business offers based on remote presence. Studying remote diagnostics systems shows that ubiquitous computing creates value when deployed in products, and not just in relation to individuals. Moreover, the design of the value-creation process should not be limited to the single supplier or customer organization, as ubiquitous computing applications take no notice of organizational boundaries. [source] Surface wavelets: a multiresolution signal processing tool for 3D computational modellingINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 3 2001Kevin Amaratunga Abstract In this paper, we provide an introduction to wavelet representations for complex surfaces (surface wavelets), with the goal of demonstrating their potential for 3D scientific and engineering computing applications. Surface wavelets were originally developed for representing geometric objects in a multiresolution format in computer graphics. These wavelets share all of the major advantages of conventional wavelets, in that they provide an analysis tool for studying data, functions and operators at different scales. However, unlike conventional wavelets, which are restricted to uniform grids, surface wavelets have the power to perform signal processing operations on complex meshes, such as those encountered in finite element modelling. This motivates the study of surface wavelets as an efficient representation for the modelling and simulation of physical processes. We show how surface wavelets can be applied to partial differential equations, stated either in integral form or in differential form. We analyse and implement the wavelet approach for a model 3D potential problem using a surface wavelet basis with linear interpolating properties. We show both theoretically and experimentally that an O(h) convergence rate, hn being the mesh size, can be obtained by retaining only O((logN) 7/2N) entries in the discrete operator matrix, where N is the number of unknowns. The principles described here may also be extended to volumetric discretizations. Copyright © 2001 John Wiley & Sons, Ltd. [source] |