From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,adb9b9207aecb4b3 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news2.google.com!proxad.net!news.tele.dk!news.tele.dk!small.news.tele.dk!not-for-mail Sender: malo@0x5358c09a.boanxx18.adsl-dhcp.tele.dk Newsgroups: comp.lang.ada Subject: Re: epoll Ada binding References: <311c6b78.0410181100.76f4e8ab@posting.google.com> <311c6b78.0410182103.110885b7@posting.google.com> From: Mark Lorenzen Date: 20 Oct 2004 22:48:00 +0200 Message-ID: User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Organization: TDC Totalloesninger NNTP-Posting-Host: 83.88.192.154 X-Trace: 1098305248 dtext02.news.tele.dk 157 83.88.192.154:39752 X-Complaints-To: abuse@post.tele.dk Xref: g2news1.google.com comp.lang.ada:5547 Date: 2004-10-20T22:48:00+02:00 List-Id: Wojtek Narczynski 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