08-11-2010
HA Cluster solution for Linux - which one to use?
Hi all experts,
I need your kind suggestions or feedback on choice of clustering software for red hat linux nodes running certain applications which I need to make highly available.
Minimum requirement is 2 nodes; all nodes shall be active-active running distinct applications e.g. node 1 runs application ABC and node 2 runs application PQR, node 1 is back up node for PQR and node 2 for ABC. Node 1 and node 2 do not have any shared storage required, they access back end database which is protected by Oracle's dataguard.
I need to have cost-effective HA with minimum downtime. There are various HA solutions available in market - SteelEye, Veritas Cluster, Red Hat cluster suite, IBM HACMP etc. and I have almost narrowed down to Red Hat Cluster(for it being cheaper) vs Veritas (for it being feature rich).
Any experiences with clustering? Any pros and cons of these two cluster software (with references would be appreciated) would be of great help?
Dear mods, if this thread is not suitable for this sub-forum; kindly advise where to post within this forum
5 More Discussions You Might Find Interesting
1. UNIX for Advanced & Expert Users
Dear All Experts,
Would like to know the maturity/ stability of Redhat Linux AS 3.0 and Solaris.
My organization need to setup cluster solution. We are well-versed with Veritas Cluster on Solaris.
We are thinking of waiting for certification support of the various ISV like Oracle, Veritas... (3 Replies)
Discussion started by: izy100
3 Replies
2. Linux
All,
I am most familiar with Solaris, and I am in the process of learning Linux (Fedora 5), and one of my tasks is to replace our current NAS solution. We currently use EMC Celerra, but it is way too expensive for what we use it for. So I have looked into Linux.
We mostly we have a Windows... (1 Reply)
Discussion started by: kjbaumann
1 Replies
3. Red Hat
Hi ,
I am a complete newbie to linux, I have been given a job to install a mail solution (postfix if possible) I would like to know how should I go about installing..)
Can any one provide me some steps to go about it..
i have read about postfix and the installation steps, it seems there are... (1 Reply)
Discussion started by: anilhk
1 Replies
4. High Performance Computing
Hi, I am not sure if the term "cluster" fits my situation or not. I have 5 Linux computers, each has different a host-name, and my users have to remember those the computer names to login and find out which computers have free CPUs, so they can run their jobs on those computers have free CPUs.
... (4 Replies)
Discussion started by: hiepng
4 Replies
5. Red Hat
Can some one tell me free cluster solution avaialable for RHEL5 we just want to test the clustering on RHEL. (6 Replies)
Discussion started by: fugitive
6 Replies
LEARN ABOUT DEBIAN
tree::node
Node(3pm) User Contributed Perl Documentation Node(3pm)
NAME
Tree::RedBlack::Node - Node class for Perl implementation of Red/Black tree
SYNOPSIS
use Tree::RedBlack; my $t = new Tree::RedBlack; $t->insert(3, 'dog'); my $node = $t->node(3); $animal = $node->val;
DESCRIPTION
A Tree::RedBlack::Node object supports the following methods:
key ()
Key of the node. This is what the nodes are sorted by in the tree.
val ($)
Value of the node. Can be any perl scalar, so it could be a hash-ref, f'rinstance. This can be set directly.
color ()
Color of the node. 1 for "red", 0 or undef for "black".
parent ()
Parent node of this one. Returns undef for root node.
left ()
Left child node of this one. Returns undef for leaf nodes.
right ()
Right child node of this one. Returns undef for leaf nodes.
min ()
Returns the node with the minimal key starting from this node.
max ()
Returns the node with the maximal key starting from this node.
successor ()
Returns the node with the smallest key larger than this node's key, or this node if it is the node with the maximal key.
predecessor ()
Similar to successor. WARNING: NOT YET IMPLEMENTED!!
You can use these methods to write utility routines for actions on red/black trees. For instance, here's a routine which writes a tree out
to disk, putting the byte offsets of the left and right child records in the record for each node.
sub dump {
my($node, $fh) = @_;
my($left, $right);
my $pos = tell $fh;
print $fh $node->color ? 'R' : 'B';
seek($fh, 8, 1);
print $fh $node->val;
if ($node->left) {
$left = dump($node->left,$fh);
}
if ($node->right) {
$right = dump($node->right,$fh);
}
my $end = tell $fh;
seek($fh, $pos+1, 0);
print $fh pack('NN', $left, $right);
seek($fh, $end, 0);
$pos;
}
You would call it like this:
my $t = new Tree::RedBlack;
...
open(FILE, ">tree.dump");
dump($t->root,*FILE);
close FILE;
As another example, here's a simple routine to print a human-readable dump of the tree:
sub pretty_print {
my($node, $fh, $lvl) = @_;
if ($node->right) {
pretty_print($node->right, $fh, $lvl+1);
}
print $fh ' 'x($lvl*3),'[', $node->color ? 'R' : 'B', ']', $node->key, "
";
if ($node->left) {
pretty_print($this->left, $fh, $lvl+1);
}
}
A cleaner way of doing this kind of thing is probably to allow sub-classing of Tree::RedBlack::Node, and then allow the Tree::RedBlack
constructor to take an argument saying what class of node it should be made up out of. Hmmm...
AUTHOR
Benjamin Holzman <bholzman@earthlink.net>
SEE ALSO
Tree::RedBlack
perl v5.10.0 2008-07-31 Node(3pm)