38 #ifndef __GECODE_SEARCH_PARALLEL_BAB_HH__ 39 #define __GECODE_SEARCH_PARALLEL_BAB_HH__ 43 namespace Gecode {
namespace Search {
namespace Parallel {
61 virtual void run(
void);
172 cur->constrain(*
best);
208 for (
unsigned int i=0;
i<
engine().workers();
i++) {
209 unsigned long int r_d = 0ul;
220 cur->constrain(*
best);
unsigned int workers(void) const
Return number of workers.
Path path
Current path ins search tree.
virtual ~BAB(void)
Destructor.
Worker * worker(unsigned int i) const
Provide access to worker i.
void idle(void)
Report that worker is idle.
Statistics statistics(void)
Return statistics.
static void run(Runnable *r)
Construct a new thread and run r.
void path(Home home, int offset, const IntVarArgs &x, IntVar s, IntVar e, IntPropLevel ipl)
Post propagator such that x forms a Hamiltonian path.
void acquire(void)
Acquire the mutex and possibly block.
void * ralloc(size_t s)
Allocate s bytes from heap.
Space * clone(bool share_data=true, bool share_info=true, CloneStatistics &stat=unused_clone) const
Clone space.
void * mark(void *p)
Return marked pointer for unmarked pointer p.
void block(void)
Block all workers.
void reset(unsigned int l)
Reset stack and set no-good depth limit to l.
void signal(void)
Signal the event.
Parallel branch-and-bound search worker
void better(Space *b)
Accept better solution b.
void release(void)
Release the mutex.
BAB(Space *s, const Options &o)
Initialize for space s with options o.
Gecode::IntArgs i(4, 1, 2, 3, 4)
virtual void constrain(const Space &b)
Constrain future solutions to be better than b.
unsigned int d
Distance until next clone.
bool idle
Whether the worker is idle.
virtual void constrain(const Space &best)
Constrain function for best solution search.
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
Space * cur
Current space being explored.
virtual ~Worker(void)
Destructor.
void find(void)
Try to find some work.
Support::Event e_search
Event for search (solution found, no more solutions, search stopped)
Space * best
Best solution found so far.
bool signal(void) const
Whether search state changed such that signal is needed.
Parallel depth-first search engine
int mark
Number of entries not yet constrained to be better.
No-goods recorded from restarts.
Heap heap
The single global heap.
Parallel branch-and-bound engine
BAB & engine(void) const
Provide access to engine.
void solution(Space *s)
Report solution s.
Parallel depth-first search worker
SpaceStatus status(StatusStatistics &stat=unused_status)
Query space status.
Support::DynamicQueue< Space *, Heap > solutions
Queue of solutions.
Engine & _engine
Reference to engine.
Gecode toplevel namespace
Worker ** _worker
Array of worker references.
Space * best
Best solution so far.
virtual void run(void)
Start execution of worker.
NoGoods & nogoods(void)
Return no-goods.
Support::Mutex m_search
Mutex for search.