Skip to content
Richard G. Clegg edited this page Jul 31, 2015 · 6 revisions

Hard problems (require intellectual effort)

  • Mapping process to task type -- tasks are ANY_TO_ONE MANY_TO_ONE ANY_TO_MANY etc etc (logic of scheduling). This must be inferred from process

  • Inferring graph shape from code -- beyond obvious cases (foldt -- or single processing task) can we be cleverer at inferring the shape of the task graph

Middling problems

  • Reset function -- we need to "reset" tasks by setting to zero any local variables (generate a void reset() function in the task class)

  • Ensure that send always happens before consume. User should be able to write consume(x) then send (x) but in C++ this is unsafe as consume essentially acts as a free

Dumb work problems -- needs doing not done

  • Maybe give better interface in C++ to make foldt (could possibly ignore this) -- RGC

  • Syntactic sugar for send/consume -- needs adding to intermediate language.

  • Type checking for peek and peekAll

Clone this wiki locally