Parallelization of computations for generating combinations

DSpace/Manakin Repository

Show full item record

Title Parallelization of computations for generating combinations
Autor: Novikov, Sergey
URI: http://hdl.handle.net/11331/3436
Date: 2017
Źródło: Studia Informatica : systemy i technologie informacyjne. Nr 21 (2017), s. 47-62
Abstract: An effective sequential algorithm and two parallel algorithms for generating combinations without repetitions of m out n of objects, represented by Boolean vectors, are proposed. One of them allows one to calculate starting and ending combinations for the subset, generated by each computing processor. The second algorithm firstly generates short (m-component) vectors on several computing processors. After that, by using special [n/m]-component vectors, it connects the short vectors into ncomponent Boolean vectors, each of which containing of exactly m units.

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Uznanie autorstwa-Na tych samych warunkach 3.0 Polska Except where otherwise noted, this item's license is described as Uznanie autorstwa-Na tych samych warunkach 3.0 Polska

Search DSpace


Advanced Search

Browse

My Account

Statistics