10-18-2006
Thanks for the information. I knew there was a way to doit. Again many thanks.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
If you have two or more servers load balancing, are the servers mirroring one another? If images, etc., are uploaded, will they be stored on all the servers so that if one server goes down, the images will be served up by another server? (1 Reply)
Discussion started by: wvmlt
1 Replies
2. Ubuntu
Hi guys, I wonder if someone would be able to assist with my problem. I have just set up a load balancer for a company I am working for. HTTP redirection is working fine, however they also want to load balance SSH and FTP too.
At the moment the perlbal config looks like;
CREATE POOL webhttp
... (1 Reply)
Discussion started by: JayC89
1 Replies
3. Solaris
Is it possible to do a load balancing ( incoming and outgoing )with with IPMP in solaris 10 like sun trunking ? If yes what are the steps involved in it , i know how to do the failover IPMP both link based and probe based but i 'm looking for possible load balancing (3 Replies)
Discussion started by: fugitive
3 Replies
4. SuSE
Hi,
How i can build Network Load Balancing (NLB) Server between two openSuse Server (for example Web Server)?
thanks. (1 Reply)
Discussion started by: skynet_boy
1 Replies
5. Web Development
Hi All,
I have one webserver which has an application for a set of internal users can be accessed by _http://server1.com
I am planning to load balance this application. For that I have cloned this server and build a new one which can be accessed using _http://server2.com]Server2.com. Also i... (2 Replies)
Discussion started by: Tuxidow
2 Replies
6. Linux
Hi,
We have 2 pools of servers. Lets call them A and B and they would contain 2 servers each. Pool A will be hosting www.example.com/app/v1 and pool B will be hosting www.example.com/app/v2. Clients will be requesting right url (/v1 or /v2) but will be hitting just one IP.
I'd like to:
1)... (3 Replies)
Discussion started by: chrisfb
3 Replies
7. IP Networking
Hello everybody
How can i Load Balance two slow ppp(gprs) connections with iptables . (4 Replies)
Discussion started by: rink
4 Replies
8. UNIX for Advanced & Expert Users
Hi,
Currently we have 3 old and 3 new servers catering to Live traffic. As my component move from legacy interfaces to MQ one, we want to have load balancing of old interfaces available on MQ interface as well.
For this, we want to send only 30% of all MQ traffic on 3 OLD Live servers, and want... (1 Reply)
Discussion started by: senkerth
1 Replies
9. UNIX for Advanced & Expert Users
Hi,
I am working on development project where I have to migrate many jobs from Tidal to Autosys R11.
During this project we came across the following requirements.
1. There are 3 real machines. There could be many jobs activated simultaneously, but only one job should execute at a time and... (0 Replies)
Discussion started by: sujeetp
0 Replies
10. Shell Programming and Scripting
Dear All,
Can any one help me for this request?
There is a case. I have 20 files which I need to FTP to 5 servers. I want to know if there is any possibility to make a load balancer which transfers files in round robin manner to 5 servers.
As per theoretical algorithm, what I think, flow can... (9 Replies)
Discussion started by: Zaib
9 Replies
LEARN ABOUT DEBIAN
hash_destroy
HASH(3pub) C Programmer's Manual HASH(3pub)
NAME
hash_create, hash_destroy, hash_install, hash_lookup, hash_uninstall, hash_iter - generic hash tables
SYNOPSIS
#include <publib.h>
Hashtab *hash_create(unsigned long (*fun)(void *),
int (*cmp)(const void *, const void *));
void hash_destroy(Hashtab *ht);
void *hash_install(Hashtab *ht, void *data, size_t size);
void *hash_lookup(Hashtab *ht, void *data);
int hash_uninstall(Hashtab *ht, void *data);
int hash_iter(Hashtab *ht, int (*doit)(void *, void *), void *param);
DESCRIPTION
These functions implement generic hash tables. The table is created by hash_create and destroyed by hash_destroy. The fun argument is a
pointer to the hashing function, which must convert a datum to an unsigned long, which is then converted to an index into the hashing ta-
ble. cmp is a qsort(3)-like comparison functions, used to compare to (wannabe) hash table elements.
hash_install installs a new datum into the table. A pointer to the data and the size of the data are given as the arguments. If the size
is 0, only the pointer value is copied to the table. Otherwise a copy of the data is made into dynamically allocated memory.
hash_lookup attempts to find a datum in the hash table. A pointer to another datum is given as the argument. The comparison function
should compare equal (return 0) the desired datum and this datum (but the argument needn't be a fully initialized datum, although that is
up to the writer of the comparison function). There cannot be two elements in the hash table that are equal (the comparison function
returns 0 for them). It is up to the user to handle collisions.
hash_uninstall removes an element from a table. The argument is a pointer to a datum that identifies the element.
hash_iter goes through every element in the hash table and calls the doit function for each. The first argument it provides to doit is the
element in question, the second is whatever was given to hash_iter as param. If doit returns -1 or 0 for any element in the hash table,
hash_iter immediately returns without going through the remaining elements in the hash table. Any other return value from doit is ignored.
RETURNS
hash_create returns a pointer to the new hash table, or NULL if it fails.
hash_install returns a pointer to an element in the table (either the installed one, or one that was already installed, if one tries to
install the same datum twice).
hash_uninstall returns 0 if it found the element in the array, or -1 if it didn't.
hash_lookup return a pointer to the element it finds, or NULL if it doesn't find anything beautiful.
hash_iter returns -1, 0, or 1. If hash_iter receives a return value of -1 or 0 for some element from doit, hash_iter immediately returns
-1 or 0, respectively. In all other cases hash_iter returns 1.
SEE ALSO
publib(3), qsort(3), bsearch(3)
AUTHOR
Lars Wirzenius (lars.wirzenius@helsinki.fi)
Publib C Programmer's Manual HASH(3pub)