The beta analysis applet now supports the multi-processor response time analysis I've been writing about. To me, a graph of response times gives a better feel for the system than simple feasible/infeasible answers.

Deadline monotonic priority assignment doesn't seem to "work" for multi-processor, so I'm trying Audsley's algorithm on MP. I haven't thought about it enough to know if it will always find a feasible priority assignment if one exists, but it does seem to work.

For instance, here's a screen shot of the applet showing three tasks with hard-coded deadline monotonic priority assignments for one processor:
screen shot 1
Since its utilization is 1.55, it doesn't try to compute response times, but when I move the slider to give it two processors, the applet analyzes the system and finds in infeasible. Task t1, the one with the longest deadline and thus the lowest priority misses its deadline:
screen shot 2
If I let the applet chose task priorities
screen shot 3
It elects to give t1 the highest priority and generates a feasible system.

As you'd expect, giving the system three processors generates improved response times, and more processors beyond that don't generate any improvement.
screen shot 4