Harmonious Cooperation of Processes Operating on a Common Set of Data. Part 3

摘要: Abstract : 02AF-671AESDTR-147-Vol-3 See also Part 2, AD757903. A data-sharing scheduler is defined in terms of finite-state machine theory. Using the language and concepts machines, authors give precise definitions for notions delayed, blocked, deadlock, permanent blocking, sharing a datum; these their interrelationships lead to characterization class schedular (unrestricted nontrivial); basic theorem data stated proved, its implications are explored. The narrative summary discussion main result work suitable system designer or analyst.