Interpreter
Dynamic scheduler:
- Input is parsed and stored in a dependancy graph.
- Execution machine (interpreter / scheduler) works through the graph and makes appropriate calls:
- estimate-calls are added in order to get necessary run-time information for scheduling (cost-function)
- every invocation is issued as soon as possible (data-flow) and reasonable (according to cost-function)
- all invocations for which the CSRT waits for results are polled regularly, and results extracted and new invocations issued as soon as possible
CSRT would still be sequential!
Overview results, flexible interactions:
- megaprogrammer can program statement by statement and get results immediately; results will influence what he/she does next
- like ftp, web