Application of Grid computing for designing a class of optimal periodic nonuniform sampling sequences

  • Authors:
  • Andrzej Tarczynski;Tamas Kiss;Gabor Tersztyanszki;Thierry Delaitre;Dongdong Qu;Stephen Winter

  • Affiliations:
  • Centre for System Analysis, University of Westminster, 115 New Cavendish Street, London, W1W 6UW, United Kingdom;Centre for Parallel Computing, University of Westminster, 115 New Cavendish Street, London, W1W 6UW, United Kingdom;Centre for Parallel Computing, University of Westminster, 115 New Cavendish Street, London, W1W 6UW, United Kingdom;Centre for Parallel Computing, University of Westminster, 115 New Cavendish Street, London, W1W 6UW, United Kingdom;Centre for System Analysis, University of Westminster, 115 New Cavendish Street, London, W1W 6UW, United Kingdom;Centre for Parallel Computing, University of Westminster, 115 New Cavendish Street, London, W1W 6UW, United Kingdom

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Designing periodic nonuniform sampling sequences for digital alias free signal processing is a computationally extensive problem where sequential single computer based solutions could easily run for days or even weeks. In order to reduce computation time, the sequential algorithm needed to be parallelized making it possible to execute parts of the calculations on different nodes of a computational Grid at the same time, reducing the overall runtime of the application. This paper presents and compares two different Grid based implementations representing the two main Grid approaches at the moment. The first solution utilizes a production Grid environment based on GEMLCA and the P-Grade Grid portal, and the second represents a BOINC desktop Grid-based solution.