Decision problems concerning parallel programming
A notion of a correct (= deadlock free) scheduling of several recursive processes using common resources is introduced. The existence of correct schedulings is schown to be undecidable from recursive indices of the relevant processes. Further-more we isolate several cases where the more existence of a correct scheduling does not imply the existence of a computable (recursive) correct scheduling.
KeywordsParallel Programming Recursive Function Common Resource Recursive Process Recursion Theory
Unable to display preview. Download preview PDF.