The zip file Bench_opt.zip is containing task graph examples with
known optimal schedule length for given multiprocessor
architecture. The file names are ogra<n>_<r>_<p>.td, where <n>
should be substituted with the number of task in that file, <r>
with edge existence density, while <p> should be replaced with the
number of processors for which the optimal solution is given.


In each file, data are written in following format:

- first row contains the value for the number of tasks n;

- next n rows contain following data: task index i=1,...,n, task
duration t_i, i=1,...,n, number of successors n_{succ} and list of
n_{succ} pairs s_j  c_{ij} representing index of j-th successor
and corresponding communication.

Possible values for <p> are:

- 2 meaning scheduling onto 2-processor system;

- 4 represent 2-dimensional hypercube;

- 6 is used to describe 2X3 mesh of processors;

- 8 represent 3-dimensional hypercube;

- 9 is used to describe 3X3 mesh of processors;

- 12 is used to describe 3X4 mesh of processors;

- 16 represent 4-dimensional hypercube;

Moreover, one can define the completely connected multiprocessor
architecture with p processors, the length of optimal schedule
will not change.

The lengths of optimal schedules are given in the following table.
They depend only on n and not on the values for p and r (density).

---------------------------------------------------------------------
|n       | 50 | 100| 150 | 200 | 250 | 300 | 350 | 400 | 450 |500   |
---------------------------------------------------------------------
|SL_{opt}| 600| 800| 1000| 1200| 1400| 1600| 1800| 2000| 2200| 2400 |
---------------------------------------------------------------------