System properties
From DCOPolis
The majority of DCOPolis' options are specified through Java system properties. These can be manipulated using the System.setProperty() and System.getProperty() functions. The following is a list of these properties, including their default values.
Contents |
General options
| Property | Values | Default | Description |
|---|---|---|---|
| ALGORITHM | class name | empty | The algorithm that will be used by default. |
| EXIT_ON_COMPLETION | 0 or 1
| 0
| If this is any value other than 0, then DCOPolis will exit immediately after the problem has been solved.
|
| LOG_FILE | filename prefix | empty | If provided, a subdirectory called logs will be created, and a log file prefixed by the given name will contain all output from DCOPolis (from both STDOUT and STDERR).
|
| MIN_NUM_PLATFORMS | integer | 0
| If distributedly instantiating a problem, this option will cause the instantiating instance of DCOPolis to wait until at least MIN_NUM_PLATFORM platforms are discovered. This is useful when used in conjunction with UNIFORM_HOST_DISTRIBUTION for batch processing. |
| NO_GUI | 0 or 1
| 0
| If this is any value other than 0, then the graphical user interface will not be displayed (useful when batch processing and saving to a log file).
|
| PLATFORM | class name | empty | The platform to be used. |
| PROBLEM | class name | empty | A problem to be solved. |
| PROBLEM_FILE | filename | empty | A file to be loaded as a problem and solved. |
| REMOTE_INSTANTIATION | 0 or 1
| 0
| If this is any value other than 0, then DCOPolis will wait until a remote instance of DCOPolis sends an instance of a problem to be solved.
|
| SYNCHRONIZE_CYCLES | 0 or 1
| 1
| If this is any value other than 0, then DCOPolis will ensure that cycle counts remain somewhat consistent between asynchronous agents. DCOPolis does this by automatically appending to each inter-agent message the cycle during which it was sent. When an agent receives such a message, it automatically iterates its current cycle until its cycle is greater than the cycle during which the message was sent.
|
Platform-specific options
Networkless platform
| Property | Values | Default | Description |
|---|---|---|---|
| KILOBYTES_PER_SECOND | natural number | 12800(i.e., the speed of 100BaseT) | The default bandwidth of each simulated network link. |
| MIPS | natural number | 2000
| The default speed (in millions-of-instructions-per-second) of each of the virtual hosts that are to be simulated. |
| REAL_TIME | 0 or 1
| 0
| Causes the simulator to run the simulation in real time. |
TCP platform
| Property | Values | Default | Description |
|---|---|---|---|
| IP | IP address (e.g., "192.168.0.1") | Guessed from ifconfig
| The IP address for the local interface through which this platform is to communicate. The IP and SUBNET_MASK properties are used by the TCPPlatform solely to calculate the broadcast IP. |
| SUBNET_MASK | IP address (e.g., "255.255.255.0") | Guessed from ifconfig
| The subnet mask for the local interface through which this platform is to communicate. The IP and SUBNET_MASK properties are used by the TCPPlatform solely to calculate the broadcast IP. |
| UNIFORM_HOST_DISTRIBUTION | 0 or 1
| 0
| Causes the hosts in the problem to be randomly assigned to the TCPPlatforms on the network according to a uniform distribution. Otherwise, if this property is 0, then the user will be prompted to manually set the mapping between hosts in the problem to actual platforms.
|
Algorithm-specific options
Adopt
| Property | Values | Default | Description |
|---|---|---|---|
| ADOPT_PREPROCESS | 0 or 1
| 1
| Causes Adopt to perform a preprocessing step in which a greedily-generated feasible solution is used as initial bounds for the variables. The overhead of performing this preprocessing is often not worth the effort when the problem is small. |
| BOUNDED_ERROR | natural number | 0
| The maximum deviation from the cost of the optimal solution allowed in the final solution. |
Pseudotree-based algorithms
These algorithms include Adopt, DPOP, and NCBB:
| Property | Values | Default | Description |
|---|---|---|---|
| CHAIN_ORDERING | 0 or 1
| 0
| If any value other than 0, the pseudotree will be generated using a chain ordering (i.e., a linear ordering).
|
Problem-specific options
Graph coloring
| Property | Values | Default | Description |
|---|---|---|---|
| RANDOM_GRAPH_COLORS | natural number | 3
| The number of colors that can be assigned to vertices. |
| RANDOM_GRAPH_EDGE_PROBABILITY | double from 0.0 to 1.0 | 0.5
| The probability that two vertices will be connected in the randomly-generated graph coloring problem. |
| RANDOM_GRAPH_VERTICES | natural number | 6
| The number of vertices in the randomly-generated graph coloring problem. |
