In my previous posts I discussed the basic difference between parallel programming and single threaded programming. I also showed how controlling access to shared variables can be used to solve some of those problems. For this post, I am going to discuss more difficulties of writing good parallel algorithms.

Here are some definitions used in this post:

• scale: the ability of a program to get faster as more cores are available
• load balancing: how effectively work is distributed over the available cores
• coarse grained parallelism: parallelizing routines at a high level
• fine grained parallelism: parallelizing routines at a low level

Consider the following example

As of 9th of Oct 2009

http://www.mapleprimes.com/mapleranking?sort=desc&order=Points
 

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

In the Belgium lottery they pick 6 numbers out of 42   (  there can't be 2 equals numbers being picked out )
Now for my maple homework , i must do some exercices in maple

1 ) Simulate the lottery
2 ) If you partici

This is a continuation of the new thread that was started with this post.

Code to create a maplet that generates unique random numbers from a sample space could look like:

Hi,

I got something like:

t:=NULL:

for i to nops(S) do

...

...

temp2:=(temp)^(-1) mod t[i]:

...

...

od:

the problem is that since I have assigned t:=NULL

for i=1

there is a problem to run

temp2:=(temp)^(-1) mod t[i]:
 

it becomes

temp2:=(temp)^(-1) mod t[1]:

at that time 't' is actually a number , just a single value, so it cant have subscript.

how do I solve that problem?

Hi,

I am writing an procedure in which has the following:

print( array(  [['p', 'q' , 'e', 'd'],
          seq([p[k],q[k],e[k],d[k]],k=1..nops(M1) )       ]));

that 'p','q','e' and 'd' all have been used within the procedure.

The "print", in the first line     "['p', 'q' , 'e', 'd']" , I would like them to display as texts, how should do that?

Thanks.

casper

Hi,

I can generate 1 random number  by

rand(10^20)():

how can i get, say 6 distinct random numbers in the scacle of 10^20 as well?

Thanks.

casper

How do i print numbers upto 100 that are not multiples of x,y,z?
 

I would be very gratefull for any help
 

Thanks

I just want to reiterate how dynamic programming problems can be solved in Maple.

Especially dynamic programming models that frequently appears in economic models.

First of all it is important to note that is close to impossible to find an easy to understand

and step-by-step road maps to dynamic programming. Why is that ?!  The below Maple

code was basically "discovered" by trial and error and pure stubbornness (caveman 101).