View in EDS HTML Full Text PDF Full Text

Language-based vectorization and parallelization using intrinsics, OpenMP, TBB and Cilk Plus.

Saved in:
Bibliographic Details
Title: Language-based vectorization and parallelization using intrinsics, OpenMP, TBB and Cilk Plus.
Authors: Stpiczyński, Przemysław1 przem@hektor.umcs.lublin.pl
Source: Journal of Supercomputing. Apr2018, Vol. 74 Issue 4, p1461-1472. 12p.
Subjects: Parallel programs (Computer programs), SIMD (Computer architecture), Multicore processors, Recursive programming, Intel computers
Abstract: The aim of this paper is to evaluate OpenMP, TBB and Cilk Plus as basic language-based tools for simple and efficient parallelization of recursively defined computational problems and other problems that need both task and data parallelization techniques. We show how to use these models of parallel programming to transform a source code of Adaptive Simpson’s Integration to programs that can utilize multiple cores of modern processors. Using the example of Belman-Ford algorithm for solving single-source shortest path problems, we advise how to improve performance of data parallel algorithms by tuning data structures for better utilization of vector extensions of modern processors. Manual vectorization techniques based on Cilk array notation and intrinsics are presented. We also show how to simplify such optimization using Intel SIMD Data Layout Template containers. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 128656650
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Language-based vectorization and parallelization using intrinsics, OpenMP, TBB and Cilk Plus.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Stpiczyński%2C+Przemysław%22">Stpiczyński, Przemysław</searchLink><relatesTo>1</relatesTo><i> przem@hektor.umcs.lublin.pl</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Apr2018, Vol. 74 Issue 4, p1461-1472. 12p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Parallel+programs+%28Computer+programs%29%22">Parallel programs (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22SIMD+%28Computer+architecture%29%22">SIMD (Computer architecture)</searchLink><br /><searchLink fieldCode="DE" term="%22Multicore+processors%22">Multicore processors</searchLink><br /><searchLink fieldCode="DE" term="%22Recursive+programming%22">Recursive programming</searchLink><br /><searchLink fieldCode="DE" term="%22Intel+computers%22">Intel computers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The aim of this paper is to evaluate OpenMP, TBB and Cilk Plus as basic language-based tools for simple and efficient parallelization of recursively defined computational problems and other problems that need both task and data parallelization techniques. We show how to use these models of parallel programming to transform a source code of <italic>Adaptive Simpson’s Integration</italic> to programs that can utilize multiple cores of modern processors. Using the example of <italic>Belman-Ford algorithm</italic> for solving single-source shortest path problems, we advise how to improve performance of data parallel algorithms by tuning data structures for better utilization of vector extensions of modern processors. Manual vectorization techniques based on Cilk array notation and intrinsics are presented. We also show how to simplify such optimization using Intel SIMD Data Layout Template containers. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=128656650
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-017-2231-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 1461
    Subjects:
      – SubjectFull: Parallel programs (Computer programs)
        Type: general
      – SubjectFull: SIMD (Computer architecture)
        Type: general
      – SubjectFull: Multicore processors
        Type: general
      – SubjectFull: Recursive programming
        Type: general
      – SubjectFull: Intel computers
        Type: general
    Titles:
      – TitleFull: Language-based vectorization and parallelization using intrinsics, OpenMP, TBB and Cilk Plus.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Stpiczyński, Przemysław
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 74
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1