The Use of Queues in the Parallel Data Flow Evaluation of "If-Then-While" Programs
A property of a model of parallel computation is analyzed. We show that the use of queues may speed-up the execution of well formed data flow schemas by an arbitrarily large factor. A general model of data flow computation is presented to provide a framework for the comparison of data flow models. I...
Main Author: | Jaffe, Jeffrey |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148932 |
Similar Items
-
The Equivalence of R. E. Programs and Data Flow Schemes
by: Jaffe, Jeffrey
Published: (2023) -
The impact of queue length information on buffer overflow in parallel queues
by: Jagannathan, Krishna Prasanna, et al.
Published: (2010) -
The Impact of Queue Length Information on Buffer Overflow in Parallel Queues
by: Modiano, Eytan H, et al.
Published: (2018) -
Parallel computation : synchronization, scheduling, and schemes.
by: Jaffe, Jeffrey Martin
Published: (2005) -
Data-centric execution of speculative parallel programs
by: Jeffrey, Mark Christopher, et al.
Published: (2018)