34namespace Gecode {
namespace Search {
namespace Par {
39 template<
class Tracer>
44 template<
class Tracer>
54 template<
class Tracer>
58 template<
class Tracer>
70 for (
unsigned int i=1; i<
workers(); i++)
75 for (
unsigned int i=0U; i<
workers(); i++)
83 template<
class Tracer>
88 path.reset((s != NULL) ? ngdl : 0);
104 template<
class Tracer>
120 template<
class Tracer>
124 for (
unsigned int i=0U; i<engine().workers(); i++) {
125 unsigned long int r_d = 0ul;
147 template<
class Tracer>
151 for (
unsigned int i=0U; i<
workers(); i++)
160 template<
class Tracer>
175 if (
this != engine().
worker(0))
179 switch (engine().
cmd()) {
186 engine().ack_terminate();
188 engine().wait_terminate();
193 engine().ack_reset_start();
195 engine().wait_reset();
197 engine().ack_reset_stop();
207 }
else if (cur != NULL) {
217 if (
path.entries() > 0) {
221 }
else if (*tracer.ei()) {
226 unsigned int nid = tracer.
nid();
227 switch (cur->status(*
this)) {
231 tracer.wid(), nid, *cur);
244 tracer.wid(), nid, *cur);
248 (void) cur->choice();
254 engine().solution(s);
260 if ((d == 0) || (d >= engine().
opt().c_d)) {
267 const Choice* ch =
path.push(*
this,cur,c,nid);
270 tracer.wid(), nid, *cur, ch);
281 }
else if (!
path.empty()) {
282 cur =
path.recompute(d,engine().
opt().a_d,*
this,tracer);
306 template<
class Tracer>
317 for (
unsigned int i=1U; i<
workers(); i++)
334 template<
class Tracer>
358 template<
class Tracer>
Choice for performing commit
void rfree(void *p)
Free memory block starting at p.
void * ralloc(size_t s)
Allocate s bytes from heap.
No-goods recorded from restarts.
void invalidate(void)
Invalidate edge information (for stealing)
void init(unsigned int wid, unsigned int nid, unsigned int a)
Initialize.
unsigned int nid(void) const
Return parent node id.
@ DFS
Engine is a DFS engine.
SearchTracer * tracer
Tracer object for tracing search.
Parallel depth-first search worker
void find(void)
Try to find some work.
void reset(Space *s, unsigned int ngdl)
Reset worker to restart at space s.
DFS & engine(void) const
Provide access to engine.
virtual void run(void)
Start execution of worker.
Parallel depth-first search engine
virtual Statistics statistics(void) const
Return statistics.
void solution(Space *s)
Report solution s.
virtual void reset(Space *s)
Reset engine to restart at space s.
DFS(Space *s, const Options &o)
Initialize for space s with options o.
Worker * worker(unsigned int i) const
Provide access to worker i.
Worker ** _worker
Array of worker references.
virtual NoGoods & nogoods(void)
Return no-goods.
virtual ~DFS(void)
Destructor.
Parallel depth-first search worker
Engine & _engine
Reference to engine.
NoGoods & nogoods(void)
Return no-goods.
Statistics statistics(void)
Return statistics.
Space * cur
Current space being explored.
Tracer tracer
Search tracer.
Space * steal(unsigned long int &d, Tracer &myt, Tracer &ot)
Hand over some work (NULL if no work available)
unsigned int d
Distance until next clone.
bool idle
Whether the worker is idle.
Path< Tracer > path
Current path ins search tree.
Parallel depth-first search engine
void idle(void)
Report that worker is idle.
const Options & opt(void) const
Provide access to search options.
Support::Event e_reset_ack_stop
Event for reset acknowledgment stopped.
Support::Event e_search
Event for search (solution found, no more solutions, search stopped)
Support::DynamicQueue< Space *, Heap > solutions
Queue of solutions.
void stop(void)
Report that worker has been stopped.
void block(void)
Block all workers.
Support::Mutex m_wait_reset
Mutex for waiting for reset.
Support::Mutex m_search
Mutex for search.
Support::Event e_reset_ack_start
Event for reset acknowledgment started.
Cmd cmd(void) const
Return current command.
void release(Cmd c)
Release all workers.
bool signal(void) const
Whether search state changed such that signal is needed.
void terminate(void)
For engine to peform thread termination.
volatile unsigned int n_busy
Number of busy workers.
unsigned int workers(void) const
Return number of workers.
@ C_RESET
Perform reset operation.
@ C_WAIT
Run into wait lock.
Search tree edge for recomputation
unsigned int truealt(void) const
Return true number for alternatives (excluding lao optimization)
unsigned int nid(void) const
Return node identifier.
const Choice * choice(void) const
Return choice.
static void engine(SearchTracer *tracer, SearchTracer::EngineType t, unsigned int n)
Register engine.
void reset(void)
Reset information.
void wait(void)
Wait until the event becomes signalled.
void signal(void)
Signal the event.
void release(void)
Release the mutex.
void acquire(void)
Acquire the mutex and possibly block.
static void run(Runnable *r)
Construct a new thread and run r.
static void sleep(unsigned int ms)
Put current thread to sleep for ms milliseconds.
Heap heap
The single global heap.
SpaceStatus status(StatusStatistics &stat=unused_status)
Query space status.
Space * clone(CloneStatistics &stat=unused_clone) const
Clone space.
@ SS_BRANCH
Space must be branched (at least one brancher left)
@ SS_SOLVED
Space is solved (no brancher left)
@ SS_FAILED
Space is failed
const unsigned int initial_delay
Initial delay in milliseconds for all but first worker thread.
Gecode toplevel namespace
void path(Home home, const IntVarArgs &x, IntVar s, IntVar e, IntPropLevel ipl=IPL_DEF)
Post propagator such that x forms a Hamiltonian path.
#define GECODE_NEVER
Assert that this command is never executed.