Experiments in separating computational algorithm from program distribution and communication

R. B. Yehezkael; Y. Wiseman; H. G. Mendelbaum; I. L. Gordin

doi:10.1007/3-540-70734-4

Experiments in separating computational algorithm from program distribution and communication

R. B. Yehezkael, Y. Wiseman, H. G. Mendelbaum, I. L. Gordin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yields flexible programs capable of handling different kinds of data/program distribution with no change to the pure algorithm. 2) Implicit or automatic handling of communication via externally mapped variables and generalizations of assignment and reference to these variables. This provides unified device independent view and processing of internal data and external distributed data at the user programming language level. 3) Programs need only know of the direct binds with distributed correspondents (mailbox driver, file manager, remote task, window manager etc.). This avoids the need for a central description of all the interconnections. The main short-range benefits of this proposal are to facilitate parallel computations. Parallel programming is a fundamental challenge in computer science, nowadays. Improving these techniques will lead to simplify the programming, eliminate the communication statements, and unify the various communication by using an implicit method for the transfer of data which is becoming essential with the proliferation of distributed networked environment. We present 2 experiments of separation between PurAl and DUAL, using a preprocessor or an object-type library. This new approach might be of interest to both academic and industrial researchers.

Original language	English
Title of host publication	Applied Parallel Computing
Subtitle of host publication	New Paradigms for HPC in Industry and Academia - 5th International Workshop, PARA 2000, Proceedings
Editors	Tor Sorevik, Fredrik Manne, Assefaw Hadish Gebremedhin, Randi Moe
Publisher	Springer Verlag
Pages	268-278
Number of pages	11
ISBN (Print)	354041729X, 9783540417293
DOIs	https://doi.org/10.1007/3-540-70734-4
State	Published - 2001
Externally published	Yes
Event	5th International Workshop on Applied Parallel Computing, PARA 2000 - Bergen, Norway Duration: 18 Jun 2000 → 20 Jun 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1947
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Workshop on Applied Parallel Computing, PARA 2000
Country/Territory	Norway
City	Bergen
Period	18/06/00 → 20/06/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Access to Document

10.1007/3-540-70734-4

Cite this

Yehezkael, R. B., Wiseman, Y., Mendelbaum, H. G., & Gordin, I. L. (2001). Experiments in separating computational algorithm from program distribution and communication. In T. Sorevik, F. Manne, A. H. Gebremedhin, & R. Moe (Eds.), Applied Parallel Computing: New Paradigms for HPC in Industry and Academia - 5th International Workshop, PARA 2000, Proceedings (pp. 268-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1947). Springer Verlag. https://doi.org/10.1007/3-540-70734-4

Yehezkael, R. B. ; Wiseman, Y. ; Mendelbaum, H. G. et al. / Experiments in separating computational algorithm from program distribution and communication. Applied Parallel Computing: New Paradigms for HPC in Industry and Academia - 5th International Workshop, PARA 2000, Proceedings. editor / Tor Sorevik ; Fredrik Manne ; Assefaw Hadish Gebremedhin ; Randi Moe. Springer Verlag, 2001. pp. 268-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0edeffa4ea074fb580d88458d5c2946f,

title = "Experiments in separating computational algorithm from program distribution and communication",

abstract = "Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yields flexible programs capable of handling different kinds of data/program distribution with no change to the pure algorithm. 2) Implicit or automatic handling of communication via externally mapped variables and generalizations of assignment and reference to these variables. This provides unified device independent view and processing of internal data and external distributed data at the user programming language level. 3) Programs need only know of the direct binds with distributed correspondents (mailbox driver, file manager, remote task, window manager etc.). This avoids the need for a central description of all the interconnections. The main short-range benefits of this proposal are to facilitate parallel computations. Parallel programming is a fundamental challenge in computer science, nowadays. Improving these techniques will lead to simplify the programming, eliminate the communication statements, and unify the various communication by using an implicit method for the transfer of data which is becoming essential with the proliferation of distributed networked environment. We present 2 experiments of separation between PurAl and DUAL, using a preprocessor or an object-type library. This new approach might be of interest to both academic and industrial researchers.",

author = "Yehezkael, {R. B.} and Y. Wiseman and Mendelbaum, {H. G.} and Gordin, {I. L.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 5th International Workshop on Applied Parallel Computing, PARA 2000 ; Conference date: 18-06-2000 Through 20-06-2000",

year = "2001",

doi = "10.1007/3-540-70734-4",

language = "אנגלית",

isbn = "354041729X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "268--278",

editor = "Tor Sorevik and Fredrik Manne and Gebremedhin, {Assefaw Hadish} and Randi Moe",

booktitle = "Applied Parallel Computing",

address = "גרמניה",

}

Yehezkael, RB, Wiseman, Y, Mendelbaum, HG & Gordin, IL 2001, Experiments in separating computational algorithm from program distribution and communication. in T Sorevik, F Manne, AH Gebremedhin & R Moe (eds), Applied Parallel Computing: New Paradigms for HPC in Industry and Academia - 5th International Workshop, PARA 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1947, Springer Verlag, pp. 268-278, 5th International Workshop on Applied Parallel Computing, PARA 2000, Bergen, Norway, 18/06/00. https://doi.org/10.1007/3-540-70734-4

Experiments in separating computational algorithm from program distribution and communication. / Yehezkael, R. B.; Wiseman, Y.; Mendelbaum, H. G. et al.
Applied Parallel Computing: New Paradigms for HPC in Industry and Academia - 5th International Workshop, PARA 2000, Proceedings. ed. / Tor Sorevik; Fredrik Manne; Assefaw Hadish Gebremedhin; Randi Moe. Springer Verlag, 2001. p. 268-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1947).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Experiments in separating computational algorithm from program distribution and communication

AU - Yehezkael, R. B.

AU - Wiseman, Y.

AU - Mendelbaum, H. G.

AU - Gordin, I. L.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yields flexible programs capable of handling different kinds of data/program distribution with no change to the pure algorithm. 2) Implicit or automatic handling of communication via externally mapped variables and generalizations of assignment and reference to these variables. This provides unified device independent view and processing of internal data and external distributed data at the user programming language level. 3) Programs need only know of the direct binds with distributed correspondents (mailbox driver, file manager, remote task, window manager etc.). This avoids the need for a central description of all the interconnections. The main short-range benefits of this proposal are to facilitate parallel computations. Parallel programming is a fundamental challenge in computer science, nowadays. Improving these techniques will lead to simplify the programming, eliminate the communication statements, and unify the various communication by using an implicit method for the transfer of data which is becoming essential with the proliferation of distributed networked environment. We present 2 experiments of separation between PurAl and DUAL, using a preprocessor or an object-type library. This new approach might be of interest to both academic and industrial researchers.

AB - Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yields flexible programs capable of handling different kinds of data/program distribution with no change to the pure algorithm. 2) Implicit or automatic handling of communication via externally mapped variables and generalizations of assignment and reference to these variables. This provides unified device independent view and processing of internal data and external distributed data at the user programming language level. 3) Programs need only know of the direct binds with distributed correspondents (mailbox driver, file manager, remote task, window manager etc.). This avoids the need for a central description of all the interconnections. The main short-range benefits of this proposal are to facilitate parallel computations. Parallel programming is a fundamental challenge in computer science, nowadays. Improving these techniques will lead to simplify the programming, eliminate the communication statements, and unify the various communication by using an implicit method for the transfer of data which is becoming essential with the proliferation of distributed networked environment. We present 2 experiments of separation between PurAl and DUAL, using a preprocessor or an object-type library. This new approach might be of interest to both academic and industrial researchers.

UR - http://www.scopus.com/inward/record.url?scp=84880413677&partnerID=8YFLogxK

U2 - 10.1007/3-540-70734-4

DO - 10.1007/3-540-70734-4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84880413677

SN - 354041729X

SN - 9783540417293

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 278

BT - Applied Parallel Computing

A2 - Sorevik, Tor

A2 - Manne, Fredrik

A2 - Gebremedhin, Assefaw Hadish

A2 - Moe, Randi

PB - Springer Verlag

T2 - 5th International Workshop on Applied Parallel Computing, PARA 2000

Y2 - 18 June 2000 through 20 June 2000

ER -

Yehezkael RB, Wiseman Y, Mendelbaum HG, Gordin IL. Experiments in separating computational algorithm from program distribution and communication. In Sorevik T, Manne F, Gebremedhin AH, Moe R, editors, Applied Parallel Computing: New Paradigms for HPC in Industry and Academia - 5th International Workshop, PARA 2000, Proceedings. Springer Verlag. 2001. p. 268-278. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-70734-4

Experiments in separating computational algorithm from program distribution and communication

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this