A method of computing minimum firing time for self-cleaning SWITCH-less program nets

DOI10.1016/S0016-0032(97)00017-3MaRDI QIDQ5942204zbMATH OpenFDO

Authors Qi-Wei Ge, Hidenori Yanagida

Publication date 28 August 2001

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0016-0032(97)00017-3

zbMATH Keywords

data-flow programs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Execution termination and computation determinacy of data-flow program nets
• PARAdeg-processor scheduling for acyclic SWITCH-less program nets
• scientific article; zbMATH DE number 3570347
• scientific article; zbMATH DE number 2134685
• scientific article; zbMATH DE number 4178740

Cites work

• A Data Flow Multiprocessor
• Execution termination and computation determinacy of data-flow program nets
• scientific article; zbMATH DE number 3493844 (Why is no real title available?)

Cited in

(1)

• PARAdeg-processor scheduling for acyclic SWITCH-less program nets

Describes a project that uses

Uses Software

• SWITCH

This page was built for publication: A method of computing minimum firing time for self-cleaning SWITCH-less program nets

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