mirror of
https://git.haproxy.org/git/haproxy.git/
synced 2025-10-29 23:51:01 +01:00
3758eab71c
When using the round-robin load balancer, the major source of contention is the lbprm lock, that has to be held every time we pick a server. To mitigate that, make it so there are one tree per thread-group, and one lock per thread-group. That means we now have a lb_fwrr_per_tgrp structure that will contain the two lb_fwrr_groups (active and backup) as well as the lock to protect them in the per-thread lbprm struct, and all fields in the struct server are now moved to the per-thread structure too. Those changes are mostly mechanical, and brings good performances improvment, on a 64-cores AMD CPU, with 64 servers configured, we could process about 620000 requests par second, and we now can process around 1400000 requests per second.
57 lines
2.0 KiB
C
57 lines
2.0 KiB
C
/*
|
|
* include/haproxy/lb_fwrr-t.h
|
|
* Types for Fast Weighted Round Robin load balancing algorithm.
|
|
*
|
|
* Copyright (C) 2000-2009 Willy Tarreau - w@1wt.eu
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation, version 2.1
|
|
* exclusively.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#ifndef _HAPROXY_LB_FWRR_T_H
|
|
#define _HAPROXY_LB_FWRR_T_H
|
|
|
|
#include <import/ebtree-t.h>
|
|
#include <haproxy/thread-t.h>
|
|
|
|
/* This structure is used to apply fast weighted round robin on a server group */
|
|
struct fwrr_group {
|
|
struct eb_root curr; /* tree for servers in "current" time range */
|
|
struct eb_root t0, t1; /* "init" and "next" servers */
|
|
struct eb_root *init; /* servers waiting to be placed */
|
|
struct eb_root *next; /* servers to be placed at next run */
|
|
int curr_pos; /* current position in the tree */
|
|
int curr_weight; /* total weight of the current time range */
|
|
};
|
|
|
|
struct lb_fwrr_per_tgrp {
|
|
struct fwrr_group act; /* weighted round robin on the active servers */
|
|
struct fwrr_group bck; /* weighted round robin on the backup servers */
|
|
__decl_thread(HA_RWLOCK_T lock);
|
|
};
|
|
|
|
struct lb_fwrr {
|
|
int next_weight_act; /* total weight of the next time range on active servers, for all trees */
|
|
int next_weight_bck; /* total weight of the next time range on backup servers, for all trees */
|
|
};
|
|
|
|
#endif /* _HAPROXY_LB_FWRR_T_H */
|
|
|
|
/*
|
|
* Local variables:
|
|
* c-indent-level: 8
|
|
* c-basic-offset: 8
|
|
* End:
|
|
*/
|