DIB
DIB is a tool for organizing distributed backtracking, such as is needed in optimization, constraint satisfaction, combinatorial search, and game playing. You write application code that knows how to build the backtrack tree, and DIB will invoke your code and distribute navigation through the tree across multiple cpus. Expect perfect speedup if your algorithm has no cutoffs. This version uses PVM to do the underlying communication.
|
Current Version: not numbered
License Type: GPL
|
Home Site:
Source Code Availability:
Available Binary Packages:
Targeted Platforms: Software/Hardware Requirements:
|
Other Links:
Mailing Lists/USENET News Groups: User Comments:
See A Screen Shot? (Not Yet)
|