Re: epoll Ada binding

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

Wojtek Narczynski <wojtek@power.com.pl> writes:

> Hello,
> 
> > It would be very impressive if you succeed in making an efficient
> > task-based implementation with 10000 concurrent connections.
> 
> The first step is to create a lightweight userspace tasking runtime, then
> make the scheduler IO aware. First I tried to rewrite FSU threads in Ada,
> function by function, structure by structure. Currently I perceive it as
> truly moronic. After having taken a good look at OpenRavenscar and Jose
> Tasking Kernel, I think I am on the right track. I have a lot of
> functionality working. One humongous missing piece is signals /
> interrupts. After all that making the scheduler IO aware will be a piece
> of cake.

OK, so it requires a special run-time system. If the tasks are I/O
aware, will the "usual" Ada task behaviour be preserved?

For some time I have been thinking how to make a library, which can be
used for the purpose of building networking applications. But instead
of patching the run-time system, I was thinking of a library which
could provide Ada equivalents for SDLs process and service
constructs. When providing a process set, the library user could
choose to have a process set where each process was a co-procedure
(i.e. one task handles many connections) or choose to have a process
set where each process was a task (i.e. one task handles one
connection). The choice could be mde by instantiating from different
packages or inheriting from different classes.

If this library also could provide a general way of implementing state
machines (a tagged type for each state?), it would provide powerful
infrastructure for networking applications.

> 
> The #1 obstacle is my regular job ;-)
> 
> Thanks for the reassurance that my thinking is sound, I need it...
> 
> Regards,
> Wojtek

- Mark Lorenzen