From transformations to methodology in parallel program development: A case study

The Bird-Meertens formalism (BMF) of higher-order functions over lists is a mathematical framework supporting formal derivation of algorithms from functional specifications. This paper reports results of a case study on the systematic use of BMF in the process of parallel program development. We dev...

Full description

Saved in:
Bibliographic Details
Published inMicroprocessing and microprogramming Vol. 41; no. 8; pp. 571 - 588
Main Author Gorlatch, Sergei
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.1996
Subjects
Bird-Meertens formalism
Formal specification and design
Parallelization
Program transformation
Bird-Meertens formalism
Formal specification and design
Parallelization
Program transformation
Online AccessGet full text
ISSN0165-6074
DOI10.1016/0165-6074(96)00004-X

Cover

Abstract The Bird-Meertens formalism (BMF) of higher-order functions over lists is a mathematical framework supporting formal derivation of algorithms from functional specifications. This paper reports results of a case study on the systematic use of BMF in the process of parallel program development. We develop a parallel program for polynomial multiplication, starting with a straight-forward mathematical specification and arriving at the target processor topology together with a program for each processor of it. The development process is based on formal transformations; design decisions concerning data partitioning, processor interconnections, etc. are governed by formal type analysis and performance estimation rather than made ad hoc. The parallel target implementation is parameterized for an arbitrary number of processors; for the particular number, the target program is both time and cost-optimal. We compare our results with systolic solutions to polynomial multiplication.
AbstractList The Bird-Meertens formalism (BMF) of higher-order functions over lists is a mathematical framework supporting formal derivation of algorithms from functional specifications. This paper reports results of a case study on the systematic use of BMF in the process of parallel program development. We develop a parallel program for polynomial multiplication, starting with a straight-forward mathematical specification and arriving at the target processor topology together with a program for each processor of it. The development process is based on formal transformations; design decisions concerning data partitioning, processor interconnections, etc. are governed by formal type analysis and performance estimation rather than made ad hoc. The parallel target implementation is parameterized for an arbitrary number of processors; for the particular number, the target program is both time and cost-optimal. We compare our results with systolic solutions to polynomial multiplication.
The Bird-Meertens formalism (BMF) of higher-order functions over lists is a mathematical framework supporting formal derivation of algorithms from functional specifications. This paper reports results of a case study on the systematic use of BMF in the process of parallel program development. We develop a parallel program for polynomial multiplication, starting with a straight-forward mathematical specification and arriving at the target processor topology together with a program for each processor of it. The development process is based on formal transformations; design decisions concerning data partitioning, processor interconnections, etc. are governed by formal type analysis and performance estimation rather than made ad hoc. The parallel target implementation is parameterized for an arbitrary number of processors; for the particular number, the target program is both time and cost-optimal. We compare our results with systolic solutions to polynomial multiplication.
Author Gorlatch, Sergei
Author_xml – sequence: 1
  givenname: Sergei
  surname: Gorlatch
  fullname: Gorlatch, Sergei
  email: gorlatch@fmi.uni-passau.de
  organization: Universität Passau, D-94030 Passau, Germany
BookMark eNqFkE1LAzEQhnOoYFv9Bx5yEj2sbvYj2e1BKGJVKIig0FvIJrM1kt3UJC3035u14sGDDswMM8z7MjwTNOptDwidkfSKpIRexywTmrLioqaXaYwiWY3Q-Gd9jCbevw_7mpVj9LxwtsPBid631nUiaNt7HCzuILxZZY1d77Hu8UY4YQwYvHF27USHFezA2E0HfZjhOZbCA_Zhq_Yn6KgVxsPpd5-i18Xdy-1Dsny6f7ydLxOZ52VICmApzWkuc9oWlVAqa2STQ00yUivFGMtE2QpaNQ1kIAkQRpuyKVlGUxEr5FN0fvCNH31swQfeaS_BGNGD3XqeUVKxusriYXE4lM5676DlG6c74facpHxgxgc4fIDD6zgMbPgqyma_ZFKHLz6Rljb_iW8OYogEdhoc91JDL0FpBzJwZfXfBp9IPYqg
CitedBy_id crossref_primary_10_1145_256167_256201
Cites_doi 10.1016/0167-6423(93)90014-G
10.1142/S0129626495000163
10.1006/jpdc.1995.1089
10.1093/comjnl/35.6.555
10.1142/S0129626494000302
10.1016/0167-8191(94)90033-7
10.1007/978-1-4612-3228-5
ContentType Journal Article
Copyright 1996
Copyright_xml – notice: 1996
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/0165-6074(96)00004-X
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 588
ExternalDocumentID 10_1016_0165_6074_96_00004_X
016560749600004X
GroupedDBID --K
--M
-~X
.~1
0R~
123
1B1
1~.
5VS
8P~
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ADBBV
ADEZE
ADJOM
ADMUD
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBOLZ
HLZ
HZ~
IHE
JJJVA
KOM
LG9
M41
MO0
O-L
O9-
OAUVE
P-9
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SPC
SST
SSV
SSZ
T5K
TN5
UHS
WUQ
YYP
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c335t-4e706363c36f48add2bcb3e91219dd7772a5fa68bbe2ec1e176b5b57260a572e3
IEDL.DBID AIKHN
ISSN 0165-6074
IngestDate Mon Sep 29 05:31:18 EDT 2025
Thu Apr 24 23:07:51 EDT 2025
Wed Oct 01 02:37:33 EDT 2025
Fri Feb 23 02:28:51 EST 2024
IsPeerReviewed false
IsScholarly false
Issue 8
Keywords Bird-Meertens formalism
Formal specification and design
Parallelization
Program transformation
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c335t-4e706363c36f48add2bcb3e91219dd7772a5fa68bbe2ec1e176b5b57260a572e3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 26187982
PQPubID 23500
PageCount 18
ParticipantIDs proquest_miscellaneous_26187982
crossref_primary_10_1016_0165_6074_96_00004_X
crossref_citationtrail_10_1016_0165_6074_96_00004_X
elsevier_sciencedirect_doi_10_1016_0165_6074_96_00004_X
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 1996-04-01
PublicationDateYYYYMMDD 1996-04-01
PublicationDate_xml – month: 04
  year: 1996
  text: 1996-04-01
  day: 01
PublicationDecade 1990
PublicationTitle Microprocessing and microprogramming
PublicationYear 1996
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Jones (BIB17) 1989
Walker (BIB32) 1994; 20
Darlington, Field, Harrison, Kelly, Sharp, Wu, While (BIB9) 1993
Bacci, Danelutto (BIB1) 1994
Cole (BIB7) 1988
Skillicorn (BIB28) 1993; 26
Partsch (BIB23) 1993
Leighton (BIB19) 1992
Skillicorn, Cai (BIB29) 1994
Pepper, Exner, Südholt (BIB25) 1993
Skillicorn, Cai (BIB27) 1995; 28
Quinn (BIB26) 1994
Cole (BIB8) 1993
Meertens (BIB21) 1989
Bird, De Moor (BIB2) 1992
Clint, Fitzpatrick, Harmer, Kilpatrick, Boyle (BIB6) 1994; volume II
Gibbons (BIB13) 1992
Chen, Shang (BIB5) 1993
Geerling (BIB12) October 1994
Dijkstra, Scholten (BIB10) 1990
Südholt (BIB31) 1994
To appear.
Grant-Duff, Harrison (BIB15) 1994
W. Cai and D. Skillicorn. Calculating recurrences using the Bird-Meertens formalism.
Geerling (BIB11) 1994
Harrison (BIB16) 1992; 35
Pepper (BIB24) 1993
Bird (BIB3) 1988
Smith, Lowry (BIB30) 1989
Jones, Sheeran (BIB18) 1992
Lengauer (BIB20) 1993
Gorlatch, Lengauer (BIB14) 1994
J. O'Donnell. A correctness proof of parallel scan.
Skillicorn (10.1016/0165-6074(96)00004-X_BIB27) 1995; 28
Pepper (10.1016/0165-6074(96)00004-X_BIB25) 1993
10.1016/0165-6074(96)00004-X_BIB4
Harrison (10.1016/0165-6074(96)00004-X_BIB16) 1992; 35
Geerling (10.1016/0165-6074(96)00004-X_BIB11) 1994
Bird (10.1016/0165-6074(96)00004-X_BIB3) 1988
Darlington (10.1016/0165-6074(96)00004-X_BIB9) 1993
Lengauer (10.1016/0165-6074(96)00004-X_BIB20) 1993
Skillicorn (10.1016/0165-6074(96)00004-X_BIB29) 1994
10.1016/0165-6074(96)00004-X_BIB22
Chen (10.1016/0165-6074(96)00004-X_BIB5) 1993
Dijkstra (10.1016/0165-6074(96)00004-X_BIB10) 1990
Bacci (10.1016/0165-6074(96)00004-X_BIB1) 1994
Smith (10.1016/0165-6074(96)00004-X_BIB30) 1989
Pepper (10.1016/0165-6074(96)00004-X_BIB24) 1993
Quinn (10.1016/0165-6074(96)00004-X_BIB26) 1994
Clint (10.1016/0165-6074(96)00004-X_BIB6) 1994; volume II
Gorlatch (10.1016/0165-6074(96)00004-X_BIB14) 1994
Leighton (10.1016/0165-6074(96)00004-X_BIB19) 1992
Jones (10.1016/0165-6074(96)00004-X_BIB17) 1989
Cole (10.1016/0165-6074(96)00004-X_BIB7) 1988
Cole (10.1016/0165-6074(96)00004-X_BIB8) 1993
Jones (10.1016/0165-6074(96)00004-X_BIB18) 1992
Walker (10.1016/0165-6074(96)00004-X_BIB32) 1994; 20
Skillicorn (10.1016/0165-6074(96)00004-X_BIB28) 1993; 26
Bird (10.1016/0165-6074(96)00004-X_BIB2) 1992
Grant-Duff (10.1016/0165-6074(96)00004-X_BIB15) 1994
Partsch (10.1016/0165-6074(96)00004-X_BIB23) 1993
Meertens (10.1016/0165-6074(96)00004-X_BIB21) 1989
Gibbons (10.1016/0165-6074(96)00004-X_BIB13) 1992
Geerling (10.1016/0165-6074(96)00004-X_BIB12) 1994
Südholt (10.1016/0165-6074(96)00004-X_BIB31) 1994
References_xml – start-page: 368
  year: 1994
  end-page: 375
  ident: BIB14
  article-title: Systematic development of an SPMD implementation schema for mutually recursive divide-and-conquer specifications
  publication-title: Proc. Eighth Int. Paral. Proc. Symp. (IPPS'94)
– start-page: 217
  year: 1993
  end-page: 238
  ident: BIB25
  article-title: Functional development of massively parallel programs
  publication-title: Formal Methods in Programming and Their Applications
– start-page: 208
  year: 1992
  end-page: 232
  ident: BIB18
  article-title: Designing arithmetic circuits by refinement in Ruby
  publication-title: Mathematics of Program Construction
– start-page: 1
  year: 1993
  end-page: 53
  ident: BIB24
  article-title: Deductive derivation of parallel programs
  publication-title: Parallel Algorithm Derivation and Program Transformation
– start-page: 66
  year: 1989
  end-page: 90
  ident: BIB21
  article-title: Constructing a calculus of programs
  publication-title: Mathematics of Program Construction
– year: 1993
  ident: BIB8
  article-title: List homomorphic parallel algorithms for bracket matching
  publication-title: Technical report
– year: 1994
  ident: BIB29
  article-title: Equational code generation: Implementing categorical data types for data parallelism
  publication-title: Proceedings of TENCON '94
– start-page: 136
  year: 1994
  end-page: 147
  ident: BIB11
  article-title: Formal derivation of SIMD parallelism >from non-linear recursive specifications
  publication-title: Parallel Processing: CONPAR 94 — VAPP VI
– reference: J. O'Donnell. A correctness proof of parallel scan.
– volume: 28
  start-page: 65
  year: 1995
  end-page: 83
  ident: BIB27
  article-title: A cost calculus for parallel functional programming
  publication-title: Journal of Parallel and Distributed Computing
– year: October 1994
  ident: BIB12
  article-title: Program transformations and skeletons: formal derivation of parallel programs
  publication-title: Technical Report CSI-R9411
– start-page: 565
  year: 1994
  end-page: 568
  ident: BIB1
  article-title: Efficient compilation of structured parallel programs for distributed memory MIMD machines
  publication-title: Parallel Computing: Trends and Applications
– year: 1990
  ident: BIB10
  article-title: Predicate Calculus and Program Semantics
  publication-title: Texts and Monographs in Computer Science
– start-page: 45
  year: 1992
  end-page: 66
  ident: BIB2
  article-title: Solving optimization problems with catamorphisms
  publication-title: Mathematics of Program Construction
– year: 1988
  ident: BIB7
  article-title: Algorithmic skeletons: A structured approach to the management of parallel computation
  publication-title: Ph.D. Thesis. Technical Report CST-56-88
– start-page: 122
  year: 1992
  end-page: 138
  ident: BIB13
  article-title: Upwards and downwards accumulations on trees
  publication-title: Mathematics of Program Construction
– reference: . To appear.
– start-page: 804
  year: 1993
  end-page: 809
  ident: BIB5
  article-title: Mapping of uniform dependence algorithm onto fixed size processor arrays
  publication-title: Proc. 7th Int. Parallel Processing Symposium
– year: 1994
  ident: BIB26
  publication-title: Parallel Computing
– volume: 20
  start-page: 657
  year: 1994
  end-page: 673
  ident: BIB32
  article-title: The design of a standard message passing interface for distributed memory concurrent computers
  publication-title: Parallel Computing
– start-page: 398
  year: 1993
  end-page: 416
  ident: BIB20
  article-title: Loop parallelization in the polytope model
  publication-title: CONCUR '93
– volume: 35
  start-page: 555
  year: 1992
  end-page: 566
  ident: BIB16
  article-title: A higher-order approach to parallel algorithms
  publication-title: The Computer Journal
– start-page: 151
  year: 1988
  end-page: 216
  ident: BIB3
  article-title: Lectures on constructive functional programming
  publication-title: Constructive Methods in Computing Science
– reference: W. Cai and D. Skillicorn. Calculating recurrences using the Bird-Meertens formalism.
– year: 1992
  ident: BIB19
  publication-title: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
– year: 1994
  ident: BIB15
  article-title: Skeletons, list homomorhisms and parallel program transformation
  publication-title: Technical report
– start-page: 38
  year: 1994
  end-page: 57
  ident: BIB31
  article-title: Data distribution algebras — a formal basis for programming using skeletons
  publication-title: Programming Concepts Methods and Calculi (PROCOMET'94)
– start-page: 146
  year: 1993
  end-page: 160
  ident: BIB9
  article-title: Parallel programming using skeleton functions
  publication-title: Parallel Architectures and Languages Europe, PARLE '93
– volume: volume II
  start-page: 457
  year: 1994
  end-page: 462
  ident: BIB6
  article-title: A family of data-parallel derivations
  publication-title: High Performance Computing and Networking
– volume: 26
  start-page: 205
  year: 1993
  end-page: 221
  ident: BIB28
  article-title: Deriving parallel programs from specifications using cost information
  publication-title: Science of Computer Programming
– start-page: 80
  year: 1989
  end-page: 102
  ident: BIB17
  article-title: Deriving the fast Fourier algorithm by calculation
  publication-title: Proc. Conf. on Functional Programming
– start-page: 71
  year: 1993
  end-page: 110
  ident: BIB23
  article-title: Some experiments in transforming towards parallel executabiliry
  publication-title: Parallel Algorithm Derivation and Program Transformation
– start-page: 379
  year: 1989
  end-page: 398
  ident: BIB30
  article-title: Algorithm theories and design tactics
  publication-title: Mathematics of Program Construction
– volume: volume II
  start-page: 457
  year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB6
  article-title: A family of data-parallel derivations
– start-page: 804
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB5
  article-title: Mapping of uniform dependence algorithm onto fixed size processor arrays
– start-page: 71
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB23
  article-title: Some experiments in transforming towards parallel executabiliry
– volume: 26
  start-page: 205
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB28
  article-title: Deriving parallel programs from specifications using cost information
  publication-title: Science of Computer Programming
  doi: 10.1016/0167-6423(93)90014-G
– ident: 10.1016/0165-6074(96)00004-X_BIB4
  doi: 10.1142/S0129626495000163
– start-page: 122
  year: 1992
  ident: 10.1016/0165-6074(96)00004-X_BIB13
  article-title: Upwards and downwards accumulations on trees
– start-page: 217
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB25
  article-title: Functional development of massively parallel programs
– start-page: 379
  year: 1989
  ident: 10.1016/0165-6074(96)00004-X_BIB30
  article-title: Algorithm theories and design tactics
– year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB26
– start-page: 38
  year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB31
  article-title: Data distribution algebras — a formal basis for programming using skeletons
– volume: 28
  start-page: 65
  year: 1995
  ident: 10.1016/0165-6074(96)00004-X_BIB27
  article-title: A cost calculus for parallel functional programming
  publication-title: Journal of Parallel and Distributed Computing
  doi: 10.1006/jpdc.1995.1089
– volume: 35
  start-page: 555
  issue: 6
  year: 1992
  ident: 10.1016/0165-6074(96)00004-X_BIB16
  article-title: A higher-order approach to parallel algorithms
  publication-title: The Computer Journal
  doi: 10.1093/comjnl/35.6.555
– year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB12
  article-title: Program transformations and skeletons: formal derivation of parallel programs
– ident: 10.1016/0165-6074(96)00004-X_BIB22
  doi: 10.1142/S0129626494000302
– year: 1992
  ident: 10.1016/0165-6074(96)00004-X_BIB19
– start-page: 151
  year: 1988
  ident: 10.1016/0165-6074(96)00004-X_BIB3
  article-title: Lectures on constructive functional programming
– year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB15
  article-title: Skeletons, list homomorhisms and parallel program transformation
– start-page: 45
  year: 1992
  ident: 10.1016/0165-6074(96)00004-X_BIB2
  article-title: Solving optimization problems with catamorphisms
– volume: 20
  start-page: 657
  year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB32
  article-title: The design of a standard message passing interface for distributed memory concurrent computers
  publication-title: Parallel Computing
  doi: 10.1016/0167-8191(94)90033-7
– year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB8
  article-title: List homomorphic parallel algorithms for bracket matching
– start-page: 136
  year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB11
  article-title: Formal derivation of SIMD parallelism >from non-linear recursive specifications
– start-page: 368
  year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB14
  article-title: Systematic development of an SPMD implementation schema for mutually recursive divide-and-conquer specifications
– start-page: 146
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB9
  article-title: Parallel programming using skeleton functions
– start-page: 1
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB24
  article-title: Deductive derivation of parallel programs
– year: 1988
  ident: 10.1016/0165-6074(96)00004-X_BIB7
  article-title: Algorithmic skeletons: A structured approach to the management of parallel computation
– year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB29
  article-title: Equational code generation: Implementing categorical data types for data parallelism
– start-page: 565
  year: 1994
  ident: 10.1016/0165-6074(96)00004-X_BIB1
  article-title: Efficient compilation of structured parallel programs for distributed memory MIMD machines
– year: 1990
  ident: 10.1016/0165-6074(96)00004-X_BIB10
  article-title: Predicate Calculus and Program Semantics
  doi: 10.1007/978-1-4612-3228-5
– start-page: 66
  year: 1989
  ident: 10.1016/0165-6074(96)00004-X_BIB21
  article-title: Constructing a calculus of programs
– start-page: 80
  year: 1989
  ident: 10.1016/0165-6074(96)00004-X_BIB17
  article-title: Deriving the fast Fourier algorithm by calculation
– start-page: 208
  year: 1992
  ident: 10.1016/0165-6074(96)00004-X_BIB18
  article-title: Designing arithmetic circuits by refinement in Ruby
– start-page: 398
  year: 1993
  ident: 10.1016/0165-6074(96)00004-X_BIB20
  article-title: Loop parallelization in the polytope model
SSID ssj0004975
Score 1.2515023
Snippet The Bird-Meertens formalism (BMF) of higher-order functions over lists is a mathematical framework supporting formal derivation of algorithms from functional...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 571
SubjectTerms Bird-Meertens formalism
Formal specification and design
Parallelization
Program transformation
Title From transformations to methodology in parallel program development: A case study
URI https://dx.doi.org/10.1016/0165-6074(96)00004-X
https://www.proquest.com/docview/26187982
Volume 41
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  issn: 0165-6074
  databaseCode: ACRLP
  dateStart: 19950401
  customDbUrl:
  isFulltext: true
  dateEnd: 19960630
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0004975
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ]
  issn: 0165-6074
  databaseCode: AIKHN
  dateStart: 19950401
  customDbUrl:
  isFulltext: true
  dateEnd: 19960630
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0004975
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  issn: 0165-6074
  databaseCode: .~1
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 19960630
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0004975
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  issn: 0165-6074
  databaseCode: AKRWK
  dateStart: 19950401
  customDbUrl:
  isFulltext: true
  mediaType: online
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004975
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELagXVh4I8qjeGCAwTSJHTthqxBVeQoQSNks23GlSiWtIKz8ds6JQwEJIbFksGIrOp-_O8efv0PoUJlYUBbkRKcBJSxliuhAKBIoCAaRDq2udAtubvnwiV1mcfblLoyjVXrsrzG9Qmvf0vPW7M3G415Q6cYIBim4S0yyRdSG8JMkLdTuX1wNb-e3I1NRExl5TFyH5gJdyHufbUcpP66GIdlvAeoHVFfxZ7CKln3iiPv1t62hBVuso5WmKAP2a3QD3Q9eps-4_JKPgl_hcorrWtHVX3Q8LrDT_J5M7AR7hhbO5_ShU9zHBsIbrsRnN9HT4PzxbEh83QRiKI1LwqyAxINTQ_mIJQBgkTaa2jQEdMpzAfm0ikeKJ1rbyJrQhoLrWMcCtjYKnpZuoVYxLew2wjQPhFVOoibSLGJGBwZWPVWc8VgxxTqINsaSxouKu9oWE9mwx5yJpTOxTB2BDkwssw4in71mtajGH--LZh7kN-eQgPt_9Dxopk3CunGHIaqw07dXCTvHRKRJtPPvsXfRUk3hdjSePdQqX97sPmQope6ixZP3sAuOePZwfdf1DvkBoDzhOQ
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFA86D3rxW5xfy8GDHuLa5mv1NsQxdRsIG_QWkjSDQe3G7K7-7Sb92KYgAy89hCSUl5ffe2l_-T0AbqWmHBMvRir0MCIhkUh5XCJP2mAQKN-oXLegP2DdEXmNaLR2F8bRKkvsLzA9R-uypVlaszmbTJperhvDiU3BXWISbYMdQgPuDmAPXyuaBwl5QWNkFLnu1fU5nzWXbXchu88nQdFf4ekXUOfRp3MI9su0EbaLNzsCWyY9BgdVSQZY7tAT8N6ZTz9gtpaNWq-C2RQWlaLzb-hwkkKn-J0kJoElPwvGK_LQI2xDbYMbzKVnT8Go8zx86qKyagLSGNMMEcNt2sGwxmxMWha-AqUVNqFvsSmOuc2mJR1L1lLKBEb7xudMUUW5PdhI-zT4DNTSaWrOAcSxx410AjWBIgHRytN2z2PJCKOSSFIHuDKW0KWkuKtskYiKO-ZMLJyJRejoc9bEIqoDtBw1KyQ1NvTn1TqIH64hLOpvGNmolk3YXeN-hcjUTBefwp4bWzxsBRf_nrsBdrvDfk_0XgZvl2CvIHM7Qs8VqGXzhbm2uUqmbnJn_AZs_OBs
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=From+transformations+to+methodology+in+parallel+program+development%3A+a+case+study&rft.jtitle=Microprocessing+and+microprogramming&rft.au=Gorlatch%2C+Sergei&rft.date=1996-04-01&rft.issn=0165-6074&rft.volume=41&rft.issue=8-9&rft.spage=571&rft.epage=588&rft_id=info:doi/10.1016%2F0165-6074%2896%2900004-X&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0165-6074&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0165-6074&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0165-6074&client=summon