Schedule Analysis [Soton]

• Assumes a concurrent program.

• Objective: reduce the creation of tasks and synchronization to the minimum, while preserving the program observables.

• Alternatively, reduce it to the optimum, for a given amount of resources (e.g., processors).

• E.g., given the standard concurrent quick-sort program, if it is known that there is only one processor in the system, the sequential version can be generated.

• Complex problem, requires extensive program analysis.

• Needs development of techniques for analysis of concurrent programs.

• Also needs sharing-like domains - keep track of dependencies depth-K sharing domain. [Soton]