Parallelization of computations for generating combinations
Keywords:sequential algorithm, parallel algorithm, Boolean vector, combinations without repetitions, combinations with repetitions, parallelization of computations
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.
Download data is not yet available.
How to Cite
Novikov, S. (2019). Parallelization of computations for generating combinations. Studia Informatica. System and Information Technology, 21(1-2), 47–62. Retrieved from https://czasopisma.uph.edu.pl/studiainformatica/article/view/175