September 2001
Intermediate to advanced
580 pages
12h 30m
English
book
Linux for IBM eServer zSeries and S/390: Distributions
by Michael MacIsaac, Ronald Annuss, Wolfgang Engel, Chris Gombola, Timothy Nunes, Mark Post, Don Stubbs, Egon Terwedow, Craig Vernon
Content preview from Linux for IBM eServer zSeries and S/390: Distributions
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Chapter 18. High Availability using clusters 323
18.4 Scheduling algorithms
The LVS project has implemented four scheduling algorithms under the 2.2.16
kernel for selecting real servers:
Round-Robin Scheduling - This algorithm directs the connection to a
different server in a round-robin manner. All servers are consider equal.
Weighted Round-Robin Scheduling - This algorithm can treat real servers
with a weight depending on their capacity. For example, if you have three
servers ABC and you give them weights 4,3,2 respectively, a sample
scheduling sequence would be ABCABCABA... This algorithm is not as taxing
as the dynamic scheduling algorithms.
Least-Connection Scheduling - This algorithm directs network connections
to the real servers ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.