On Thursday 21 August 2003 08:14 pm, John M McIntosh wrote:
> Ah, but with 3.5.x which uses the unix logic for  
> ioRelinquishProcessorForMicroseconds
> aka
> aioPoll(realTimeToWait*1000);
>
> that gets
> a SortedCollection(872->10 95->11 25->1 4->12 1->2 1->13 1->25
> 1->32)
>
> which is interesting...
> I'm wondering if a new linux/bsd folks can run the benchmark and
> report   what they see with the latest unix vm.

d _ Delay forMilliseconds: 1.
((1 to: 1000) collect: [ :i | [d wait] timeToRun]) asBag sortedCounts

a SortedCollection(929->20 16->18 15->22 14->21 10->19 5->17 3->13 
3->23 2->27 1->7 1->16 1->24)

 a SortedCollection(938->20 14->18 14->21 12->19 11->22 3->17 2->23 
1->2 1->10 1->12 1->28 1->41 1->50)

With the 3.2-6 VM (more or less) under Linux, with -xshm

-- 
Ned Konz
http://bike-nomad.com
GPG key ID: BEEA7EFE