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

Authors: Treschev I. A.

Annotation: 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

Viktor N. Maslennikov

Executive Secretary of the Editor’s Office

 Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia

  Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02

  vnmas@tusur.ru

Subscription for updates