Abstract
Data Flow is a natural paradigm representing distributed programs able to express the data (and control) dependencies between composing entities (nodes). Our work concentrates on Data Flow programs having Hard-Real-Time constraints; we consider periodic programs but the method can also be applied to sporadic and aperiodic ones. We propose a method to find, if possible, a feasible execution time assignment for each program node in the system, given a heuristic mapping.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
