user/sven/linux.git - Linux Kernel

Age	Commit message (Collapse)	Author
2011-07-26	atomic: use <linux/atomic.h>	Arun Sharma
	This allows us to move duplicated code in <asm/atomic.h> (atomic_inc_not_zero() for now) to <linux/atomic.h> Signed-off-by: Arun Sharma <asharma@fb.com> Reviewed-by: Eric Dumazet <eric.dumazet@gmail.com> Cc: Ingo Molnar <mingo@elte.hu> Cc: David Miller <davem@davemloft.net> Cc: Eric Dumazet <eric.dumazet@gmail.com> Acked-by: Mike Frysinger <vapier@gentoo.org> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2004-03-13	RPC: Sync rpc_set_timeo() up to the 2.4.x version. In particular, this will	Trond Myklebust
	ensure that the timeout shift is clamped to a maximum value of 8. RPC: Fix by Olaf Kirch to the rpc scheduler to ensure sync tasks respect the "intr" mount flag.
2003-10-07	UDP round trip timer fix. Modify Karn's algorithm so that	Trond Myklebust
	we inherit timeouts from previous requests. This means that we lengthen the window of time during which we accept updates to the RTO estimate if we see an update. Scheme proposed by Brian Mancuso, but it is standard for TCP congestion control implementations.
2003-08-21	Back out some congestion control changes that were causing trouble,	Trond Myklebust
	among other things, for the "soft" mount option.
2002-11-08	[PATCH] RTO estimator cleanup patch	Chuck Lever
	clean up RPC client's RTO estimator.
2002-11-08	[PATCH] fix jiffies wrap in new RPC RTO estimator	Chuck Lever
	the new RPC RTO estimator has some jiffies wrap problems.
2002-07-16	[PATCH] RPC over UDP congestion control updates [2/8]	Trond Myklebust
	Implement a count of the number of timeouts that have occured since we last recorded a successful reply from the server. For the moment this information is merely used in order to improve the estimate of whether or not the server is down. It will be used in patch 3/8 in order to improve the timeout backoff algorithm.
2002-07-16	[PATCH] RPC over UDP congestion control updates [1/8]	Trond Myklebust
	Implement the basic round trip timing algorithm in order to adapt the timeout values for the most common NFS operations to the server's rate of response. Algorithm is described in Van Jacobson's paper 1998 paper on http://www-nrg.ee.lbl.gov/nrg-papers.html, and is the same as is used for most TCP stacks. Following the *BSD code, we implement separate rtt timers for GETATTR, LOOKUP, READ/READDIR/READLINK, and WRITE. In addition to this, there is one extra timer for the COMMIT operation. All the remaining RPC calls use the current system in which a fixed timeout value gets set by the 'timeo' mount option. In case of a timeout, the current exponential backoff algoritm is implemented. Subsequent patches will improve this...