Date: Mon, 5 Jul 1999 11:09:30 -0400 (EDT) From: Zach Brown <zab@zabbo.net> To: Niall Smart <niall@pobox.com> Cc: Jonathan Lemon <jlemon@americantv.com>, Mike Smith <mike@smith.net.au>, hackers@FreeBSD.ORG Subject: Re: poll() scalability Message-ID: <Pine.LNX.4.10.9907051105200.5548-100000@hoser> In-Reply-To: <3780B8D5.C32D210C@pobox.com>
next in thread | previous in thread | raw e-mail | index | archive | help
> How about a modified sigwaitinfo that will return a number of waiting > siginfo -- of course this introduces the problem of deciding how long > to wait for new additions to the queue before returning. This is you'd just have a 'give me up to X' parameter, if you get a single one under high load they will queue up until you call it next time.. waiting around stinks, these operations usually want low latency. > could buffer siginfo's in user space, although this introduces > complexity if you want the ability to cancel queued signals... yes, that is the hard part :) -- zach - - - - - - 007 373 5963 To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.LNX.4.10.9907051105200.5548-100000>