English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper presents a parallel code for solving banded systems by using the PARAGRAM language. First, the banded area is hierarchically partitioned, and then a parallel solving method based on S.L. Johnsson’s work (1985) is applied. Seveml descriptive features are effectively used to express the algorithm including hierarchical data definition provided by PARAGRAM. Only half the program lines are necessary for PARAGRAM description as compared with the macro task level parallel FORTRAN. A lower level parallel code generated by the PARAGRAM translator was executed on the Japanese National Research Project machine. For a solution of a banded matrix with 8192 equations, a speedup time of 2.83 is measured on 4 processing elements. This performance coincides well with a prediction resulting from the analysis of operations count and the amount of data transferred.

Solving banded systems using a parallel programming language with hierarchically data descriptive features