Task allocation in data flow multiprocessors
Camille C. Price · ACM SIGARCH Computer Architecture News · 1991
The performance of data flow multiprocessors depends to a large extent on the methods used to partition a data flow program and assign the resulting computational tasks among the processors. We cite significant contributions to the field of data flow computing, and categorize these efforts according to the granularity of the partitions and by whether task allocation is static (performed at compile time) or dynamic (performed during execution of the program). Each reference is accompanied by a brief description of the task allocation techniques used in the system.