Chris
What you are observing is the effects of the delay on the operation of
the TCP stacks and the way your 'sleep' works.
You are introducing delay (the sleep time is a 'minimum' and then at
least one o/s jiffy) - that represents one limit. The other limit is
delay/bandwidth product of
On 1 November 2010 09:55, Neil Davies semanticphilosop...@gmail.com wrote:
How accurate do you need this control of throughput? To get really accurate
rates we had to write our own specialist rate regulated thread library which
accounts for any scheduling delay and can even spin if you want low
Hi all,
I like to announce a new version of the network package,
network-2.2.3. You can install the latest version by running:
cabal update cabal install network
This version marks the end of the network-bytestring package, which
has now been merged into the network package. This means
On 31 October 2010 16:14, Johan Tibell johan.tib...@gmail.com wrote:
This version marks the end of the network-bytestring package, which
has now been merged into the network package. This means that
efficient and correct networking using ByteStrings is available as
part of the standard network
(Er, that should be (speed/4), not (speed*4). x4 the block size should
be x4 the delay.)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
