Mathematica parallel computing. Some timing results on a intel nehalem multicore processor

Béla Paláncz, L. Kovács

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

1ome frequently employed algorithms in engineering, are parallel by nature (embarrasingly parallel algorithms) and some others can be parallelized via data parallelization. Algorithms like probability analysis, linear homotopy continuation method, Gauss-Jacobi combinatorial technique are belonging to the first group, while others like algorithms for digital image processing as well as reduced Groenber basis application to solving systems of polynomial equations fall into the other category. In this case study we illustrate how Mathematica can manage to evaluate such algorithms parallel on a multicore machine. The analysis of the efficiency of the computation and the net reduction of the execution time are presented by three examples as well as some useful tips are given to avoid pitfalls and utilize the advantages of parallel processing.

Original languageEnglish
Title of host publication10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009
Pages449-460
Number of pages12
Publication statusPublished - 2009
Event10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 - Budapest, Hungary
Duration: Nov 12 2009Nov 14 2009

Other

Other10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009
CountryHungary
CityBudapest
Period11/12/0911/14/09

Fingerprint

Parallel processing systems
Parallel algorithms
Image processing
Polynomials
Processing

Keywords

  • Color quantization
  • Gauss-jacobi algorithm
  • Monte-carlo method
  • Multicore processor
  • Parallel computation

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Paláncz, B., & Kovács, L. (2009). Mathematica parallel computing. Some timing results on a intel nehalem multicore processor. In 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 (pp. 449-460)

Mathematica parallel computing. Some timing results on a intel nehalem multicore processor. / Paláncz, Béla; Kovács, L.

10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009. p. 449-460.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Paláncz, B & Kovács, L 2009, Mathematica parallel computing. Some timing results on a intel nehalem multicore processor. in 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. pp. 449-460, 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009, Budapest, Hungary, 11/12/09.
Paláncz B, Kovács L. Mathematica parallel computing. Some timing results on a intel nehalem multicore processor. In 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009. p. 449-460
Paláncz, Béla ; Kovács, L. / Mathematica parallel computing. Some timing results on a intel nehalem multicore processor. 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009. pp. 449-460
@inproceedings{f4c6cfa6d484454f86e3a125a353eadc,
title = "Mathematica parallel computing. Some timing results on a intel nehalem multicore processor",
abstract = "1ome frequently employed algorithms in engineering, are parallel by nature (embarrasingly parallel algorithms) and some others can be parallelized via data parallelization. Algorithms like probability analysis, linear homotopy continuation method, Gauss-Jacobi combinatorial technique are belonging to the first group, while others like algorithms for digital image processing as well as reduced Groenber basis application to solving systems of polynomial equations fall into the other category. In this case study we illustrate how Mathematica can manage to evaluate such algorithms parallel on a multicore machine. The analysis of the efficiency of the computation and the net reduction of the execution time are presented by three examples as well as some useful tips are given to avoid pitfalls and utilize the advantages of parallel processing.",
keywords = "Color quantization, Gauss-jacobi algorithm, Monte-carlo method, Multicore processor, Parallel computation",
author = "B{\'e}la Pal{\'a}ncz and L. Kov{\'a}cs",
year = "2009",
language = "English",
pages = "449--460",
booktitle = "10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009",

}

TY - GEN

T1 - Mathematica parallel computing. Some timing results on a intel nehalem multicore processor

AU - Paláncz, Béla

AU - Kovács, L.

PY - 2009

Y1 - 2009

N2 - 1ome frequently employed algorithms in engineering, are parallel by nature (embarrasingly parallel algorithms) and some others can be parallelized via data parallelization. Algorithms like probability analysis, linear homotopy continuation method, Gauss-Jacobi combinatorial technique are belonging to the first group, while others like algorithms for digital image processing as well as reduced Groenber basis application to solving systems of polynomial equations fall into the other category. In this case study we illustrate how Mathematica can manage to evaluate such algorithms parallel on a multicore machine. The analysis of the efficiency of the computation and the net reduction of the execution time are presented by three examples as well as some useful tips are given to avoid pitfalls and utilize the advantages of parallel processing.

AB - 1ome frequently employed algorithms in engineering, are parallel by nature (embarrasingly parallel algorithms) and some others can be parallelized via data parallelization. Algorithms like probability analysis, linear homotopy continuation method, Gauss-Jacobi combinatorial technique are belonging to the first group, while others like algorithms for digital image processing as well as reduced Groenber basis application to solving systems of polynomial equations fall into the other category. In this case study we illustrate how Mathematica can manage to evaluate such algorithms parallel on a multicore machine. The analysis of the efficiency of the computation and the net reduction of the execution time are presented by three examples as well as some useful tips are given to avoid pitfalls and utilize the advantages of parallel processing.

KW - Color quantization

KW - Gauss-jacobi algorithm

KW - Monte-carlo method

KW - Multicore processor

KW - Parallel computation

UR - http://www.scopus.com/inward/record.url?scp=84883075450&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883075450&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84883075450

SP - 449

EP - 460

BT - 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009

ER -