Publication details
Distribuované výpočty složitých stavových prostorů
| Title in English | Distributed computation of complex state spaces |
|---|---|
| Authors | |
| Year of publication | 2005 |
| Type | Article in Proceedings |
| Conference | Širokopásmové sítě a jejich aplikace |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | state space seach; latency; distributed computing |
| Description | Searching in complex state spaces is a computationally expensive task suitable for distributed environment. We focus on the TDS seach algorithm featuring complete independence on communication latency. We present an extension of the algorithm, allowing also a comlete reconstruction of a discrete state space, preserving the ansynchronicity of the original algorithm. The extended algorithm was successfully used in an interacitve VR chemical application -- simulation of processes which cannot be done on-line. Instead, we search the entire state space of the interaction in advance. We also present results of measurements of real behaviour of the algorithm. |
| Related projects: |