Strategy for data-flow synchronizations in stencil parallel computations on multi-/manycore systems.
Saved in:
| Title: | Strategy for data-flow synchronizations in stencil parallel computations on multi-/manycore systems. |
|---|---|
| Authors: | Szustak, Lukasz1 lszustak@icis.pcz.pl |
| Source: | Journal of Supercomputing. Apr2018, Vol. 74 Issue 4, p1534-1546. 13p. |
| Subjects: | Data flow computing, Parallel programs (Computer programs), Multicore processors, Intel microprocessors, Abstraction (Computer science) |
| Abstract: | In this paper, an innovative strategy for the data-flow synchronization in shared-memory systems is proposed. This strategy assumes to synchronize only interdependent threads instead of using the barrier approach that—in contrast to our approach—synchronize all threads. We demonstrate the adaptation of the data-flow synchronization strategy to two complex scientific applications based on stencil codes. An algorithm for the data-flow synchronization is developed and successfully used for both applications. The proposed approach is evaluated for various Intel microarchitectures released in the last 5 years, including the newest processors: Skylake and Knights Landing. The important part of this assessment is the performance comparison of the proposed data-flow synchronization with the OpenMP barrier. The experimental results show that the performance of the studied applications can be accelerated up to 1.3 times using the proposed data-flow synchronizations strategy. [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.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 128656656 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Strategy for data-flow synchronizations in stencil parallel computations on multi-/manycore systems. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Szustak%2C+Lukasz%22">Szustak, Lukasz</searchLink><relatesTo>1</relatesTo><i> lszustak@icis.pcz.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, p1534-1546. 13p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Data+flow+computing%22">Data flow computing</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+programs+%28Computer+programs%29%22">Parallel programs (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Multicore+processors%22">Multicore processors</searchLink><br /><searchLink fieldCode="DE" term="%22Intel+microprocessors%22">Intel microprocessors</searchLink><br /><searchLink fieldCode="DE" term="%22Abstraction+%28Computer+science%29%22">Abstraction (Computer science)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: In this paper, an innovative strategy for the data-flow synchronization in shared-memory systems is proposed. This strategy assumes to synchronize only interdependent threads instead of using the barrier approach that—in contrast to our approach—synchronize all threads. We demonstrate the adaptation of the data-flow synchronization strategy to two complex scientific applications based on stencil codes. An algorithm for the data-flow synchronization is developed and successfully used for both applications. The proposed approach is evaluated for various Intel microarchitectures released in the last 5 years, including the newest processors: Skylake and Knights Landing. The important part of this assessment is the performance comparison of the proposed data-flow synchronization with the OpenMP barrier. The experimental results show that the performance of the studied applications can be accelerated up to 1.3 times using the proposed data-flow synchronizations strategy. [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=128656656 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11227-018-2239-3 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 13 StartPage: 1534 Subjects: – SubjectFull: Data flow computing Type: general – SubjectFull: Parallel programs (Computer programs) Type: general – SubjectFull: Multicore processors Type: general – SubjectFull: Intel microprocessors Type: general – SubjectFull: Abstraction (Computer science) Type: general Titles: – TitleFull: Strategy for data-flow synchronizations in stencil parallel computations on multi-/manycore systems. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Szustak, Lukasz 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 |