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@0x5358c0d0.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: 19 Oct 2004 10:47:02 +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.208 X-Trace: 1098175593 dtext02.news.tele.dk 181 83.88.192.208:5176 X-Complaints-To: abuse@post.tele.dk Xref: g2news1.google.com comp.lang.ada:5436 Date: 2004-10-19T10:47:02+02:00 List-Id: Wojtek Narczynski writes: > Hello, > > > The goal for my programming exercise is to be able to handle 10 - 100 > > 000 concurrent connections effectively :). > > I am currently working on a modified runtime that will use IO readiness > for task scheduling. I have basic task switching working. I am able to > create 10K tasks, but I don't know if it is going to work for 100K tasks, > because of memory consumption. But my goal is to handle many connections > maintaining the task-based way to program. Epoll is one of the bits I am > going to miss, so if your work will be Modified GPL, please talk to me. > > Regards, > Wojtek It would be very impressive if you succeed in making an efficient task-based implementation with 10000 concurrent connections. - Mark Lorenzen