Programming bsp and multi-bsp algorithms in ml.
Saved in:
| Title: | Programming bsp and multi-bsp algorithms in ml. |
|---|---|
| Authors: | Allombert, Victor1 (AUTHOR) victor.allombert@lacl.fr, Gava, Frédéric2 (AUTHOR) |
| Source: | Journal of Supercomputing. Jul2020, Vol. 76 Issue 7, p5079-5097. 19p. |
| Subjects: | Modern architecture, Level of difficulty, Algorithms, Time management |
| Abstract: | The bsml and multi-ml languages have been designed for programming, à laml, algorithms of the respectively bsp and multi-bsp bridging models. multi-bsp is an extension of the well-know bsp model by taking into account the different levels of networks and memories of modern hierarchical architectures. This is a rather new model, as well as multi-ml is a new language, while bsp and bsml have been used for a long time in many different domains. Intuitively, designing and programming multi-bsp algorithms seems more complex than with bsp, and one can ask whether it is beneficial to rewrite bsp algorithms using the multi-bsp model. In this paper, we thus investigate the pro and cons of the aforementioned models and languages by experimenting with them on different typical applications. For this, we use a methodology to measure the level of difficulty of writing code and we also benchmark them in order to show whether writing multi-ml code is worth the effort. [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: 143613106 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Programming bsp and multi-bsp algorithms in ml. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Allombert%2C+Victor%22">Allombert, Victor</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> victor.allombert@lacl.fr</i><br /><searchLink fieldCode="AR" term="%22Gava%2C+Frédéric%22">Gava, Frédéric</searchLink><relatesTo>2</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Jul2020, Vol. 76 Issue 7, p5079-5097. 19p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Modern+architecture%22">Modern architecture</searchLink><br /><searchLink fieldCode="DE" term="%22Level+of+difficulty%22">Level of difficulty</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Time+management%22">Time management</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The bsml and multi-ml languages have been designed for programming, à laml, algorithms of the respectively bsp and multi-bsp bridging models. multi-bsp is an extension of the well-know bsp model by taking into account the different levels of networks and memories of modern hierarchical architectures. This is a rather new model, as well as multi-ml is a new language, while bsp and bsml have been used for a long time in many different domains. Intuitively, designing and programming multi-bsp algorithms seems more complex than with bsp, and one can ask whether it is beneficial to rewrite bsp algorithms using the multi-bsp model. In this paper, we thus investigate the pro and cons of the aforementioned models and languages by experimenting with them on different typical applications. For this, we use a methodology to measure the level of difficulty of writing code and we also benchmark them in order to show whether writing multi-ml code is worth the effort. [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=143613106 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11227-019-02822-9 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 5079 Subjects: – SubjectFull: Modern architecture Type: general – SubjectFull: Level of difficulty Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Time management Type: general Titles: – TitleFull: Programming bsp and multi-bsp algorithms in ml. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Allombert, Victor – PersonEntity: Name: NameFull: Gava, Frédéric IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 07 Text: Jul2020 Type: published Y: 2020 Identifiers: – Type: issn-print Value: 09208542 Numbering: – Type: volume Value: 76 – Type: issue Value: 7 Titles: – TitleFull: Journal of Supercomputing Type: main |
| ResultId | 1 |
