Generating system of random-number sequences for a parallel computer system
AssigneeFujitsu Limited
InventorsMasahide Fujisaki, Motoi Okuda
Life of this patent
Estimating the term…
Abstract
In a parallel computer system comprising a plurality of processor elements, a parent processor element generates random-number initial values, and distributes the random-number initial values to child processor elements using a communication mechanism or a shared memory; and child processor elements conduct processing to generate random-number sequences in accordance with the maximum length shift register sequence (M-sequence) method using the distributed random-number initial values as seeds.
Claims17
A method of generating random-number sequences in a parallel computer system comprising a plurality of processor elements, said method comprising:
- defining a first set of processor elements required to generate random numbers and defining a second set of processor elements, coupled to said first set of processor elements and operable for generating random-number initial values;
- generating, by one of said second set of processor elements, p.times.v.times.k pieces of random-number initial values, wherein p is a parameter of a primitive irreducible polynomial prescribing random-number generation, v is a predetermined value not less than 1, and k is a number of said first set of processor elements
- allocating to said first set of processor elements respective random-number initial values;
- and
- generating random numbers A.sub.n, by one of said first set of processor elements, through bit-by-bit logical operation of random-number values A.sub.n-pv and A.sub.n-rv using p.times.v pieces allocated thereto from said p.times.v.times.k pieces of said generated random-number initial values, wherein q is defined as a parameter of a primitive irreducible polynomial prescribing random-number generation, r is defined as one of q and (p-q), and n is defined as being greater than or equal to p.times.v+1.
A method of generating random-number sequences in a parallel computer system comprising a plurality of processor elements, interconnected and generating random-number initial values, said method comprising:
- defining a first set of processor elements, selected from said plurality of processor elements and each thereof required to generate random numbers;
- generating p.times.v.times.k pieces of random-number initial values, by each of said plurality of processor elements and in accordance with a first algorithm wherein p is a parameter of a primitive irreducible polynomial prescribing random-number generation, v is a predetermined value not less than 1, and k is a number of said first set of processor elements;
- allocating to said first set of processor elements respective said random-number initial values;
- extracting, by said first set of processor elements, p.times.v pieces of the respective random-number initial values allocated thereto;
- and
- generating, by said first set of processor elements, random numbers A.sub.n through bit-by-bit logical operation of random-number values A.sub.n-pv and A.sub.n-rv using p.times.v pieces of said extracted random-number initial values, wherein if q is defined as a parameter of a primitive irreducible polynomial prescribing random-number generation, r is defined as one of q and (p-q), and n is .gtoreq.p.times.v+1.
Dependencies are inferred from the claim text.