- Tytuł:
- Parallelization of computations for generating combinations
- Autorzy:
- Novikov, S.
- Powiązania:
- https://bibliotekanauki.pl/articles/92810.pdf
- Data publikacji:
- 2017
- Wydawca:
- Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
- Tematy:
-
sequential algorithm
parallel algorithm
Boolean vector
combinations without repetitions
combinations with repetitions
parallelization of computations - Opis:
- 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 n-component Boolean vectors, each of which containing of exactly m units.
- Źródło:
-
Studia Informatica : systems and information technology; 2017, 1-2(21); 47-62
1731-2264 - Pojawia się w:
- Studia Informatica : systems and information technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł