blob: cefe3a6a5c1893f8fc22e9be109ba6c5ef830714 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
// -*- C++ -*-
//=============================================================================
/**
* @file LB_Round_Robin_Strategy.h
*
* $Id$
*
* @author Ossama Othman <ossama@uci.edu>
*/
//=============================================================================
#ifndef LB_ROUND_ROBIN_STRATEGY_H
#define LB_ROUND_ROBIN_STRATEGY_H
#include "ace/pre.h"
#include "LB_Balancing_Strategy.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "orbsvcs/LoadBalancingS.h"
#include "ace/Synch.h"
// Forward declarations
class TAO_LB_ReplicaProxy;
// @@ Ossama: is this the kind of data structure that you want to use
// in this case? I mean the iterator is invalidated on each insertion
// and extraction, the class is not thread safe and it is hard to find
// the element with the least load... Then again the number of
// servers should be small (say around 10), and additions/removals
// rare, so the data structure is probably not a real problem.
typedef ACE_Unbounded_Set<TAO_LB_ReplicaProxy *> TAO_LB_ReplicaProxySet;
typedef ACE_Unbounded_Set_Iterator<TAO_LB_ReplicaProxy *> TAO_LB_ReplicaProxySetIterator;
/**
* @class TAO_LB_Round_Robin_Strategy
*
* @brief Round Robin load balancing strategy
*/
class TAO_LoadBalancing_Export TAO_LB_Round_Robin_Strategy
: public TAO_LB_Balancing_Strategy
{
// = DESCRIPTION
// Simple load balancing strategy that causes requests to be
// forwarded to next Replica in the set, i.e. in a "round robin"
// fashion.
public:
/// Constructor.
TAO_LB_Round_Robin_Strategy (void);
/// Destructor
~TAO_LB_Round_Robin_Strategy (void);
// = The Load_Balancing_Strategy methods
virtual CORBA::Object_ptr replica (CORBA_Environment &ACE_TRY_ENV)
ACE_THROW_SPEC ((CORBA::SystemException));
virtual int insert (TAO_LB_ReplicaProxy *);
virtual int remove (TAO_LB_ReplicaProxy *);
private:
/// Set containing the ReplicaProxy servants.
TAO_LB_ReplicaProxySet proxies_;
ACE_Unbounded_Set_Iterator<TAO_LB_ReplicaProxy *> next_replica_;
/// Lock used to ensure access to state within this class is atomic.
TAO_SYNCH_MUTEX lock_;
};
#include "ace/post.h"
#endif /* LB_ROUND_ROBIN_STRATEGY_H */
|
