liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An analytic computation-driven algorithm for Decentralized Multicore Systems
Wenzhou Med Univ, Peoples R China.
Wenzhou Univ, Peoples R China.
Wenzhou Med Univ, Peoples R China.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
Show others and affiliations
2019 (English)In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 96, p. 101-110Article in journal (Refereed) Published
Abstract [en]

In the modern era, increasing numbers of cores per chip are applied for decentralized systems, but there is not any appropriate symbolic computation approach to construct multicore analytic approximation. Thus, it is essential to develop an efficient, simple and unified way for decentralized Adomian decomposition method to increase the potential speed of the multicore systems. In our paper, we present an innovative parallel algorithm of constructing analytic solutions for nonlinear differential system, which based on the Adomian-Rach double decomposition method and Rachs Adomian polynomials. Based on our algorithm, we further developed a user-friendly Python software package to construct analytic approximations of initial or boundary value problems. Finally, the scope of validity of our Python software package is illustrated by several different types of nonlinear examples. The obtained results demonstrate the effectiveness of our package by compared with exact solution and numeric method, the characteristics of each class of Adomian polynomials and the efficiency of parallel algorithm with multicore processors. We emphasis that the super-linear speedup may happens for the duration of constructing approximate solutions. So, it can be considered as a promising alternative algorithm of decentralized Adomian decomposition method for solving nonlinear problems in science and engineering. (C) 2019 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2019. Vol. 96, p. 101-110
Keywords [en]
Parallel algorithm; Adomian-Rach double decomposition method; Adomian polynomials; Decentralized Multicore Systems
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-157513DOI: 10.1016/j.future.2019.01.031ISI: 000466254600009OAI: oai:DiVA.org:liu-157513DiVA, id: diva2:1328795
Note

Funding Agencies|Zhejiang Provincial Natural Science Foundation of China [LQ15A010009, LY16F030010]; Wenzhou Science & Technology Bureau, China [Y20150086, 2018ZG016]; China Scholarship Council

Available from: 2019-06-23 Created: 2019-06-23 Last updated: 2019-06-23

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Sodhro, Ali Hassan
By organisation
Database and information techniquesFaculty of Science & Engineering
In the same journal
Future generations computer systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 49 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf