Persistent Asynchronous Adaptive Specialization for Generic Array Programming.
Saved in:
| Title: | Persistent Asynchronous Adaptive Specialization for Generic Array Programming. |
|---|---|
| Authors: | Grelck, Clemens1, Wiesinger, Heinrich1 |
| Source: | International Journal of Parallel Programming. Apr2019, Vol. 47 Issue 2, p164-183. 20p. |
| Subjects: | Generic programming (Computer science), Software engineering, Parallel computers, Asynchronous circuits, Multicore processors |
| Abstract: | Generic array programming systematically abstracts from structural array properties such as shape and rank. As usual, generic programming comes at the price of lower runtime performance. The idea of asynchronous adaptive specialization is to exploit parallel computing facilities to reconcile these conflicting objectives through the continuous adaptation of running applications to the ranks and shapes of their arrays. A key parameter for the effectiveness of our approach is the time it takes from requesting a certain specialization until its availability to the running application. We describe the ins and outs of a persistence layer that keeps specialized variants in a repository for future use and thus effectively reduces the average waiting time for re-compilation to nearly zero. A number of critical issues that, among others, stem from the interplay between function specialization and function overloading catch our special attention. We describe the solutions adopted and illustrate the benefits of persistent asynchronous adaptive specialization by a series of experiments. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Parallel Programming 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: 135451501 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Persistent Asynchronous Adaptive Specialization for Generic Array Programming. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Grelck%2C+Clemens%22">Grelck, Clemens</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Wiesinger%2C+Heinrich%22">Wiesinger, Heinrich</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Parallel+Programming%22">International Journal of Parallel Programming</searchLink>. Apr2019, Vol. 47 Issue 2, p164-183. 20p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Generic+programming+%28Computer+science%29%22">Generic programming (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Software+engineering%22">Software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+computers%22">Parallel computers</searchLink><br /><searchLink fieldCode="DE" term="%22Asynchronous+circuits%22">Asynchronous circuits</searchLink><br /><searchLink fieldCode="DE" term="%22Multicore+processors%22">Multicore processors</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Generic array programming systematically abstracts from structural array properties such as shape and rank. As usual, generic programming comes at the price of lower runtime performance. The idea of asynchronous adaptive specialization is to exploit parallel computing facilities to reconcile these conflicting objectives through the continuous adaptation of running applications to the ranks and shapes of their arrays. A key parameter for the effectiveness of our approach is the time it takes from requesting a certain specialization until its availability to the running application. We describe the ins and outs of a persistence layer that keeps specialized variants in a repository for future use and thus effectively reduces the average waiting time for re-compilation to nearly zero. A number of critical issues that, among others, stem from the interplay between function specialization and function overloading catch our special attention. We describe the solutions adopted and illustrate the benefits of persistent asynchronous adaptive specialization by a series of experiments. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Parallel Programming 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=135451501 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10766-018-0567-9 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 20 StartPage: 164 Subjects: – SubjectFull: Generic programming (Computer science) Type: general – SubjectFull: Software engineering Type: general – SubjectFull: Parallel computers Type: general – SubjectFull: Asynchronous circuits Type: general – SubjectFull: Multicore processors Type: general Titles: – TitleFull: Persistent Asynchronous Adaptive Specialization for Generic Array Programming. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Grelck, Clemens – PersonEntity: Name: NameFull: Wiesinger, Heinrich IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2019 Type: published Y: 2019 Identifiers: – Type: issn-print Value: 08857458 Numbering: – Type: volume Value: 47 – Type: issue Value: 2 Titles: – TitleFull: International Journal of Parallel Programming Type: main |
| ResultId | 1 |