Parstab:

Timing suite.  Measure effective # of processors (guesses/forces per
second, or choice points per second).  Plot total time, compute time,
communication time, and comm prep time against this.

Handle failure of a node

What happens when there is no work?

Transfer strat and options with PVM, like we do with programs

Have master keep track of depth in tree of lowest choice point for
each slave.  Use for assigning work.

Transfer things as shorts if <64K atoms

Raw transfer

would barriers be useful?


Others:

Test various options to smodels.  Make run-time.

Either make body size dynamic, or check for overflow.

Time models individually in sderes.

Get newest lparse.

Improve parallel (PVM) implementation of stable.
  Test speed with no logging-over-NFS.
  Detect need for -lsocket and -lnsl on SysV machines (e.g. Solaris) in
   Config.

Find out why stable (without stratification) is often much slower
than smodels.

Progress reporting (percent of search tree, for example)

Prove that the dim queue cannot grow past the program size

Provide an `explanation' of each stack push and each backtrack
in stable.

Include manpages for the functions in liblp.

