I just discovered cue and find it has a number of interesting concepts.
I was wondering if cue could be used for the following situation.
A program which is a combination of
- a long computation that is ran infrequently (5ms duration @ 100Hz)
- a short computation that is ran frequently (1ms duration @ 500Hz).
The total computation cost does not exceed the system resources as you can see for the above program. But the long computation may violate the assumption that all computations run fast enough such that they can be considered instantly ( in particular the long computation invalidates that assumption for the short but frequent computation).
So my questions are the following :
- is my exposition correct?
- do all computations have to take less time to execute than the smallest time step in the program?
- is there a way to make this work in cue?
Thank you!
Tyr
A program which is a combination of
- a long computation that is ran infrequently (5ms duration @ 100Hz)
- a short computation that is ran frequently (1ms duration @ 500Hz).
The total computation cost does not exceed the system resources as you can see for the above program. But the long computation may violate the assumption that all computations run fast enough such that they can be considered instantly ( in particular the long computation invalidates that assumption for the short but frequent computation).
So my questions are the following :
- is my exposition correct?
- do all computations have to take less time to execute than the smallest time step in the program?
- is there a way to make this work in cue?