Search Results - parallel permutation generation algorithm*
Search alternatives:
- parallel permutation »
- generation algorithm »
-
1
A permutation parallel algorithm under exchange restriction with message passing interface
Published 2014“…Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
Get full text
Get full text
Conference or Workshop Item -
2
Parallel strategy for starter sets to list all permutation based on cycling restriction
Published 2011“…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
A new parallel model for starter sets generation via exchanging two elements
Published 2019“…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
Get full text
Get full text
Article -
4
The division free parallel algorithm for finding determinant
Published 2013“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text
Article -
5
New Sequential and Parallel Division Free Methods for Determinant of Matrices
Published 2013“…The computation times in the newly developed sequential methods were dominated by generating starter sets. Therefore, two parallel strategies were developed to parallelise this algorithm so as to reduce the computation times. …”
Get full text
Get full text
Get full text
Thesis
