Graph-based communication in Eden

DOI10.1007/S10990-014-9101-YMaRDI QIDQ526455zbMATH OpenOpenAlexFDO

Authors Thomas Horstmeyer, Rita Loogen

Publication date 15 May 2017

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10990-014-9101-y

zbMATH Keywords

functional programmingparallel computationcommunication topologiesprocess graphs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Parallel functional programming in Eden
• Parallelizing sequential graph computations
• Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
• scientific article; zbMATH DE number 1629840
• scientific article; zbMATH DE number 177427

Cites work

• scientific article; zbMATH DE number 997344 (Why is no real title available?)
• scientific article; zbMATH DE number 3566181 (Why is no real title available?)
• scientific article; zbMATH DE number 1106703 (Why is no real title available?)
• scientific article; zbMATH DE number 2065560 (Why is no real title available?)
• scientific article; zbMATH DE number 234035 (Why is no real title available?)
• Algorithm + strategy = parallelism
• Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
• Graph-based communication in Eden
• Parallel functional programming in Eden
• Type classes with existential types
• Understanding functional dependencies via constraint handling rules

Cited in

(2)

• A typed parallel -calculus via 1-depth intermediate proofs
• Graph-based communication in Eden

Describes a project that uses

Uses Software

• Eden
• Erlang
• Haskell

This page was built for publication: Graph-based communication in Eden

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526455)