Proceedings of TUSUR University / Archive / Issue of Journal № 1, 2 part [19], 2009 / Using of parallel backtracking, as graph marking in wide tree traverse, on systems with SMP-architecture for solving search problems

Using of parallel backtracking, as graph marking in wide tree traverse, on systems with SMP-architecture for solving search problems

Download article in PDF format

Abstract
Authors and copyright holders

Abstract: Methods of constructing parallel algorithms for tasks, which could be solved with backtrack algorithm, oriented on the SMP-architecture, are proposed in this paper. These methods are used for building multithreaded applications. Experimental results concerning the methods for classic tasks on backtrack are given.

Keywords: cryptography, reboric problems, recourse, multithreading

Authors and copyright holders:

Treschev I. A.

—

For citation:
Treschev I. A. Using of parallel backtracking, as graph marking in wide tree traverse, on systems with SMP-architecture for solving search problems. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2009, no. 1(19), – p. 2. pp. 24–26.

Last issue