Academic Journal
Automatic mapping of sequential programs to parallel computers with distributed memory.
| Τίτλος: | Automatic mapping of sequential programs to parallel computers with distributed memory. |
|---|---|
| Συγγραφείς: | Bagliy, A.P.1 (AUTHOR) abagly@sfedu.ru, Krivosheev, N.M.1 (AUTHOR), Steinberg, B.Ya1 (AUTHOR) |
| Πηγή: | Procedia Computer Science. 2023, Vol. 229, p236-244. 9p. |
| Θεματικοί όροι: | Parallel programs (Computer programs), Computer storage devices, Cartography software, Distributed computing, Compilers (Computer programs), Computer systems |
| Περίληψη: | This work is aimed at creating an automatically parallelizing compiler for a distributed memory computing system. The conditions for the correctness of parallelization of the considered sequential programs on a computing system with distributed memory are described. The article considers the problem of placing data in distributed memory with minimization of interprocessor transfers for a program represented by a sequence of parallelizable loops. To solve this problem, an auxiliary bipartite "statements-variables" graph (SVG) is constructed and analyzed from the text of the program. The problem of grouping transfers of small data volumes into a smaller number of transfers of large data volumes is considered. The solution of this problem also leads to minimization of the time for data transfer. New chips with distributed local memory of thousands of cores have higher performance than the previous ones. Therefore, the development of compilers for the development of such microcircuits is necessary and relevant. [ABSTRACT FROM AUTHOR] |
| Βάση Δεδομένων: | Supplemental Index |
| FullText | Links: – Type: other Text: Availability: 0 CustomLinks: – Url: https://www.doi.org/10.1016/j.procs.2023.12.025? Name: ScienceDirect (all content) (s7799221) Category: fullText Text: View record from ScienceDirect MouseOverText: View record from ScienceDirect |
|---|---|
| Header | DbId: edo DbLabel: Supplemental Index An: 174470558 RelevancyScore: 938 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 937.867004394531 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Automatic mapping of sequential programs to parallel computers with distributed memory. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bagliy%2C+A%2EP%2E%22">Bagliy, A.P.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> abagly@sfedu.ru</i><br /><searchLink fieldCode="AR" term="%22Krivosheev%2C+N%2EM%2E%22">Krivosheev, N.M.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Steinberg%2C+B%2EYa%22">Steinberg, B.Ya</searchLink><relatesTo>1</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Procedia+Computer+Science%22">Procedia Computer Science</searchLink>. 2023, Vol. 229, p236-244. 9p. – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Parallel+programs+%28Computer+programs%29%22">Parallel programs (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+devices%22">Computer storage devices</searchLink><br /><searchLink fieldCode="DE" term="%22Cartography+software%22">Cartography software</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br /><searchLink fieldCode="DE" term="%22Compilers+%28Computer+programs%29%22">Compilers (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This work is aimed at creating an automatically parallelizing compiler for a distributed memory computing system. The conditions for the correctness of parallelization of the considered sequential programs on a computing system with distributed memory are described. The article considers the problem of placing data in distributed memory with minimization of interprocessor transfers for a program represented by a sequence of parallelizable loops. To solve this problem, an auxiliary bipartite "statements-variables" graph (SVG) is constructed and analyzed from the text of the program. The problem of grouping transfers of small data volumes into a smaller number of transfers of large data volumes is considered. The solution of this problem also leads to minimization of the time for data transfer. New chips with distributed local memory of thousands of cores have higher performance than the previous ones. Therefore, the development of compilers for the development of such microcircuits is necessary and relevant. [ABSTRACT FROM AUTHOR] |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edo&AN=174470558 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.procs.2023.12.025 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 236 Subjects: – SubjectFull: Parallel programs (Computer programs) Type: general – SubjectFull: Computer storage devices Type: general – SubjectFull: Cartography software Type: general – SubjectFull: Distributed computing Type: general – SubjectFull: Compilers (Computer programs) Type: general – SubjectFull: Computer systems Type: general Titles: – TitleFull: Automatic mapping of sequential programs to parallel computers with distributed memory. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bagliy, A.P. – PersonEntity: Name: NameFull: Krivosheev, N.M. – PersonEntity: Name: NameFull: Steinberg, B.Ya IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 07 Text: 2023 Type: published Y: 2023 Identifiers: – Type: issn-print Value: 18770509 Numbering: – Type: volume Value: 229 Titles: – TitleFull: Procedia Computer Science Type: main |
| ResultId | 1 |