Re: epoll Ada binding

[Mark Lorenzen <mark.lorenzen@ofir.dk>]

Ole-Hjalmar Kristensen <ole-hjalmar.kristensen@substitute_employer_here.com> writes:

> But wouldn't it be better if the built-in tasks could be made lightweight
> enough by changing the run time system? Then you would not have to
> choose between two different task types, and all your familiar
> abstractions would work. Actually I miss Occam on the transputers,
> where task switching had the same cost as a subroutine call.

Yes, if task switching can be made lightweight enough. I have worked
with software for telephony switches that may have f.x. 50,000 ongoing
calls. Each call is a long chain of "tasks", so all in all the amount
of tasking resources needed can be very large.

> I think this is better handled by a program generator, like this one: 
> http://smc.sourceforge.net

I do not know that particular application, but a state machine
compiler could be a good tool.

- Mark Lorenzen