Permutations of a set are used in many practical problems. There are some algorithms for generating permutations of a set, e.g. a reverse alphabetical order algorithm, an algorithm based on adjacent transpositions, an algorithm determining permutations from their reductions... But these algorithms are rather long and difficult to parallelize. In this paper we point out that the set of all permutations of a set is isomorphic to the set of their inversion vectors. Thus, we construct a new algorithm determining permutations from their inversion vectors. The algorithm is simpler and shorter than existing ones. Furthermore, this algorithm is easy to parallelize. We parallelize the proposed algorithm by one of two methods. The first one is tasks dividing: 1) finding an inversion vector, and 2) determining a permutation from the just found inversion vector. Two these tasks are performed in parallel with equal computing amounts. The second parallelizing method is based on splitting the sequence of all desirable permutations into subsequences and then concurrently generating the subsequences.