Is it possible to parallelize permpos?

And it does exactly what I want. However, it stalls about when permpos(16,32) is there a way to parallelize this so that it will run faster?

 採用された回答

Jan
Jan 2012 年 7 月 25 日
編集済み: Jan 2012 年 7 月 25 日

1 投票

See Answers: generating exhaustive permutations for a list of C-Mex files for the memory efficient creation of large permutations/combinations. If your data have integer values, use an integer type to save memory and run-time.
You can create one permutation after the other without repetitions. See. e.g. FEX: nextperm, but as far as I can see, this does not allow repetitions of the elements.
Other useful submission:
You see, searching the FEX is a good idea.

1 件のコメント

Jenn Lee
Jenn Lee 2012 年 7 月 25 日
Thank you very much, I'll look into these

サインインしてコメントする。

その他の回答 (1 件)

Walter Roberson
Walter Roberson 2012 年 7 月 24 日

0 投票

It appears to me that permpos(16,32) would be getting pretty close to the point of filling 32 bits worth of address space (4 Gb). How big do you need to go, and what are you going to do with the output when you get it? Are you using a 64 bit version of MATLAB ?

3 件のコメント

Jenn Lee
Jenn Lee 2012 年 7 月 24 日
It is 64-bit 2011 version.
I take the output and compare each vector's distance from all hadamard vectors of equal size.
Walter Roberson
Walter Roberson 2012 年 7 月 24 日
And generating all of them at once is an efficient algorithm??
Anyhow you did not answer about what size you wanted to go to?
Jenn Lee
Jenn Lee 2012 年 7 月 24 日
Hm, I haven't figured out how big I need to go yet.
I need to be unique, and I'm not sure how to know they are unique unless I have all of the generated at once.

サインインしてコメントする。

カテゴリ

ヘルプ センター および File ExchangeMatrix Indexing についてさらに検索

質問済み:

2012 年 7 月 24 日

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by