Moving to problem sizes too big to be solved on a single
processor, the distributed disk-based solver solves the k = 9 (11
million states) case in little over an hour on 16 processors, while the
k = 10 case (25 million states) takes just over 3 hours. In the
latter case, the total amount of disk I/O across all nodes is in excess
of 1TB (1000 GB), with the nodes jointly processing an average of 91MB
of disk data every second.
The k = 11 (54 million states) case is solved in
17 hours 20 minutes on 16 processors. Here is total amount of disk I/O
required is almost 3TB (3000 GB), with the nodes jointly processing
an average of 42 MB of disk data every second. Solving such a large problem
on a single processor would be a daunting task - besides the huge amount
of computation required, the memory required to store the solution is over
400MB.
[ Home | Previous
| Next]