> I must be real thick. :o) I still don't see what
> the problem is. I regularly schedule harder tasks
> than this with only one int, timer based.
>
> 1. main int 100kHz (top priority, always int)
> 2. every 100 ints, at the end of the int handler
> we set a flag for task 2.
> 3. At regular points throughout the main code
> (as often as possible) we check the task two
> flag and exit from main code to perform task 2
> until it is done.
> 4. all priorities are maintained and it works
> fine up to 100% of timeslice being used, at which
> point it starts reducing time given the lowest
> priority code, which is the main code.

We are talking about different things. I am looking for a general solution,
which (IHMO) does not exists, while you state that (IYHO?) for a particular
set of tasks a working program can be made (which I do not deny).

Your solution is not general enough for me because the main task must, at
regular points (frequency at least 1/ deadline of task2) check for the flag,
which can be very annoying (for instance in the middle of a
compiler-supplied floating point multiply routine). And I don't like the
fact that the main task must know the timing details of the other task(s).

Wouter

--
http://www.piclist.com#nomail Going offline? Don't AutoReply us!
email listserv@mitvma.mit.edu with SET PICList DIGEST in the body