nginx.git - nginx

Age	Commit message (Collapse)	Author	Files	Lines
2019-05-23	Upstream hash: fall back to round-robin if hash key is empty.	Niklas Keller	1	-2/+2

2018-06-14	Upstream: improved peer selection concurrency for hash and ip_hash.	Ruslan Ermilov	1	-1/+7

2017-10-05	Upstream hash: reordered peer checks.	Maxim Dounin	1	-7/+7
	This slightly reduces cost of selecting a peer if all or almost all peers failed, see ticket #1030. There should be no measureable difference with other workloads.
2017-10-05	Upstream hash: limited number of tries in consistent case.	Maxim Dounin	1	-3/+7
	While this may result in non-ideal distribution of requests if nginx won't be able to select a server in a reasonable number of attempts, this still looks better than severe performance degradation observed if there is no limit and there are many points configured (ticket #1030). This is also in line with what we do for other hash balancing methods.
2016-09-22	Upstream: max_conns.	Ruslan Ermilov	1	-0/+9

2016-09-22	Upstream: style.	Maxim Dounin	1	-1/+0

2016-09-16	Upstream hash: fixed missing upstream name initialization.	Vladimir Homutov	1	-0/+1

2015-05-18	Upstream hash: consistency across little/big endianness.	Sergey Kandaurov	1	-4/+15

2015-04-21	Upstream: simplified ip_hash and hash peer selection code.	Ruslan Ermilov	1	-22/+8
	Now that peers are stored as a list, the weighted and unweighted cases became nearly identical.
2015-04-14	Upstreams: locking.	Ruslan Ermilov	1	-0/+16

2015-04-10	Upstream: store peers as a linked list.	Ruslan Ermilov	1	-31/+40
	This is an API change.
2015-04-10	Upstream: track the number of active connections to upstreams.	Ruslan Ermilov	1	-0/+4
	This also simplifies the implementation of the least_conn module.
2015-03-02	Upstream hash: speedup consistent hash init.	Roman Arutyunyan	1	-21/+31
	Repeatedly calling ngx_http_upstream_add_chash_point() to create the points array in sorted order, is O(n^2) to the total weight. This can cause nginx startup and reconfigure to be substantially delayed. For example, when total weight is 1000, startup takes 5s on a modern laptop. Replace this with a linear insertion followed by QuickSort and duplicates removal. Startup for total weight of 1000 reduces to 40ms. Based on a patch by Wai Keen Woon.
2014-06-02	Upstream: generic hash module.	Roman Arutyunyan	1	-0/+631