Short Notes: Lenient Execution and Concurrent Execution of Re-entrant Routines: Efficient Implementation in Data Flow Systems | Zendy

R. Govindarajan | Zendy

Open Access

Short Notes: Lenient Execution and Concurrent Execution of Re-entrant Routines: Efficient Implementation in Data Flow Systems

Author(s) -

R. Govindarajan

Publication year - 1990

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/33.2.185

Subject(s) - computer science , matching (statistics) , interface (matter) , parallel computing , distributed computing , execution time , data structure , data flow diagram , flow (mathematics) , embedded system , operating system , database , statistics , mathematics , bubble , maximum bubble pressure method , geometry

Implementation details of efficient schemes for lenient execution and concurrent execution of re-entrant routines in a data flow model have been discussed in this paper. The proposed schemes require no extra hardware support and utilise the existing hardware resources such as the Matching Unit and Memory Network Interface, effectively to achieve the above mentioned goals.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research