| Contents | Index |
T = codistributed.true(n)
T = codistributed.true(m, n, ...)
T
= codistributed.true([m, n, ...])
T = true(n, codist)
T = true(m, n, ..., codist)
T
= true([m, n, ...], codist)
T = codistributed.true(n) creates an n-by-n codistributed array of logical ones.
T = codistributed.true(m, n, ...) or T = codistributed.true([m, n, ...]) creates an m-by-n-by-... codistributed array of logical ones.
Optional arguments to codistributed.true must be specified after the required arguments, and in the following order:
codist — A codistributor object specifying the distribution scheme of the resulting array. If omitted, the array is distributed using the default distribution scheme. For information on constructing codistributor objects, see the reference pages for codistributor1d and codistributor2dbc.
'noCommunication' — Specifies that no interworker communication is to be performed when constructing the array, skipping some error checking steps.
T = true(n, codist) is the same as T = codistributed.true(n, codist). You can also use the optional arguments with this syntax. To use the default distribution scheme, specify a codistributor constructor without arguments. For example:
spmd
T = true(8, codistributor1d());
endT = true(m, n, ..., codist) and T = true([m, n, ...], codist) are the same as T = codistributed.true(m, n, ...) and T = codistributed.true([m, n, ...]), respectively. You can also use the optional arguments with this syntax.
With four labs,
spmd(4)
T = true(1000, codistributor());
endcreates a 1000-by-1000 codistributed true array T, distributed by its second dimension (columns). Each lab contains a 1000-by-250 local piece of T.
spmd(4)
codist = codistributor('1d', 2, 1:numlabs);
T = true(10, 10, codist);
endcreates a 10-by-10 codistributed true array T, distributed by its columns. Each lab contains a 10-by-labindex local piece of T.
codistributed.false | distributed.true | true

See how to solve large problems with minimal effort and reduce simulation time.
Get free kit| © 1984-2012- The MathWorks, Inc. - Site Help - Patents - Trademarks - Privacy Policy - Preventing Piracy - RSS |