By Topic

2012 11th International Symposium on Parallel and Distributed Computing

Date 25-29 June 2012

Filter Results

Displaying Results 1 - 25 of 53
  • [Cover art]

    Publication Year: 2012, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (3089 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (18 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Copyright Page

    Publication Year: 2012, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (117 KB)
    Freely Available from IEEE
  • Table of Contents

    Publication Year: 2012, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2012, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (48 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2012, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2012, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Steering Committee

    Publication Year: 2012, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2012, Page(s):xiv - xv
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Performance of a Structure-Detecting SpMV Using the CSR Matrix Representation

    Publication Year: 2012, Page(s):3 - 10
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    Sparse matrix-vector multiplication (SpMV) is an important building block for many scientific applications. Various formats exist to store and represent sparse matrices in the computer's memory. The compressed row storage format (CRS or CSR) is typically a baseline to report a new hybrid or an improved representation of sparse matrices. In this paper, we describe the implementation and performance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols

    Publication Year: 2012, Page(s):11 - 18
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula. Using the structured nature of the security protocols allows us to design a simple and efficient parallelisation of an algorithm which constructs the state-space under consideration in a need-driven fashion. A prototype implementation has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predictive Schemes for QoS Awareness of Publish/Subscribe Systems on MANET

    Publication Year: 2012, Page(s):19 - 25
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (678 KB) | HTML iconHTML

    In this paper, we propose a failure prediction methodology for quality of service (QoS) degradation prediction for publish/subscribe systems on MANET. Our propose is to use the Auto Regressive Integrated Moving Average (ARIMA) method to predict failure occurrence in the system and to provide optimal QoS provision of applications. Besides, our forecasting algorithm looks for the source behind QoS d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of Data-Parallel Skeletons: A Case Study Using a Coarse-Grained Hierarchical Model

    Publication Year: 2012, Page(s):26 - 33
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    Writing parallel programs is known to be notoriously difficult. Often programmers do not want to reason about message-passing algorithms and only want to combine existing high-level patterns to produce their parallel program. This is the algorithmic skeletons approach to parallel programming. It improves reliability and clarity of source code. But skeletons can be insufficient when complicated com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Engineering as a Service for HPC

    Publication Year: 2012, Page(s):34 - 39
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (190 KB) | HTML iconHTML

    The application of Software Engineering (SE) techniques in High Performance Computing (HPC) is an often discussed and difficult issue. The 'as a service' model approach rising from latest cloud computing trends provides an promising way to offer appropriate software engineering support for high performance computing. This paper presents and discusses the idea and concept for a Software Engineering... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Need of Software Engineering Methods for High Performance Computing Applications

    Publication Year: 2012, Page(s):40 - 46
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    This paper presents the results of an online survey with more than a hundred High Performance Computing (HPC) community members. The goal of the survey was to get a deeper understanding of ongoing HPC projects and the project participants' knowledge about software engineering. Previous and current research give the impression that with software engineering methods adequate for the development of H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting State-of-the-Art x86 Architectures in Scientific Computing

    Publication Year: 2012, Page(s):47 - 54
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    In recent years, general purpose ×86 architectures have undergone significant modifications towards high performance computing capabilities. Lately, technologies like wider vector units or Fused Multiply-Add (FMA) instruction, which were mainly known from GPU arcitectures, have been introduced. In this paper, we examine the performance of current ×86 architectures, namely Intel Sandy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composable Linear Solvers for Multiphysics

    Publication Year: 2012, Page(s):55 - 62
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (195 KB) | HTML iconHTML

    The Portable, Extensible Toolkit for Scientific computing (PETSc), which focuses on the scalable solution of problems based on partial differential equations, now incorporates new components that allow full compos ability of solvers for multiphysics and multilevel methods. Through strong encapsulation, we achieve arbitrary, dynamic composition of hierarchical methods for coupled problems and allow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tuning a Finite Difference Computation for Parallel Vector Processors

    Publication Year: 2012, Page(s):63 - 70
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (843 KB) | HTML iconHTML

    Current CPU and GPU architectures heavily use data and instruction parallelism at different levels. Floating point operations are organised in vector instructions of increasing vector length. For reasons of performance it is mandatory to use the vector instructions efficiently. Several ways of tuning a model problem finite difference stencil computation are discussed. The combination of vectorisat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the Allocation of Communication-Intensive Applications in Clouds Using Time-Related Information

    Publication Year: 2012, Page(s):71 - 78
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (683 KB) | HTML iconHTML

    The optimal allocation of Communication-Intensive Applications is a well-know complex issue in Clouds. This kind of applications, due to the strong impact of communications on their performance, requires not only that their tasks are allocated on resources able to satisfy their computational requirements but also that the distance among these resources, in terms of communication delay or latency, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steps towards GPU Accelerated Aggregation AMG

    Publication Year: 2012, Page(s):79 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (198 KB) | HTML iconHTML

    We present an implementation of AMG with simple aggregation techniques on multiple GPUs. It supports the parallel matrix representations typically used for finite volume discretisation. We employ the ICRS sparse matrix format and the asynchronous exchange mechanism of MPI on CPUs that has been modified to make it suitable for the GPU coprocessors. We show that the solution phase of the standard v-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Computation and Large-Scale Visualization in Heterogeneous Compute Environments

    Publication Year: 2012, Page(s):87 - 94
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    High performance computing still typically disregards heterogeneous environments and focuses on homogeneous clusters. While providing advantages and easing development, this fails to address the recent change toward heterogeneous computing infrastructure. With DIANA we presented an abstraction layer for unified access to local compute hardware including different hardware APIs. In this paper we ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining the Availability of Grid Resources Using Active Probing

    Publication Year: 2012, Page(s):95 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (606 KB) | HTML iconHTML

    Determining qualitative availability aspects of Grid resources is a complex and cumbersome task because of the inherent characteristics of a Grid like Virtual Organizations. To cope with these challenges we argue for a more qualitative specification of availability which respects inter-organizational aspects besides pure technical values and percentages. Although there are several existing approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory-Efficient Implementation of a Rigid-Body Molecular Dynamics Simulation

    Publication Year: 2012, Page(s):103 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB) | HTML iconHTML

    Molecular dynamics simulations are usually optimized with regard to runtime rather than memory consumption. In this paper, we investigate two distinct implementational aspects of the frequently used Linked-Cell algorithm for rigid-body molecular dynamics simulations: the representation of particle data for the force calculation, and the layout of data structures in memory. We propose a low memory ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Coupling Tool for Parallel Molecular Dynamics-Continuum Simulations

    Publication Year: 2012, Page(s):111 - 118
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1211 KB) | HTML iconHTML

    We present a tool for coupling Molecular Dynamics and continuum solvers. It is written in C++ and is meant to support the developers of hybrid molecular -continuum simulations in terms of both realisation of the respective coupling algorithm as well as parallel execution of the hybrid simulation. We describe the implementational concept of the tool and its parallel extensions. We particularly focu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.