Enhancements to datagen algorithm to gain additional performance
One example method includes receiving, from a caller, a call for a data stream of a specified size, initializing the data stream by specifying a first prime number and a second prime number, both of which may be 32-bit primes, and by specifying an available amount of data. The method further includes generating data of the data stream using the first prime number and the second prime number, and transmitting the data of the data stream to the caller until either the data stream has fulfilled the call, or until the available amount of data becomes zero. During the transmitting, the method includes maintaining a running counter that starts at the available amount of data, and decrementing the counter by the amount of data sent to the caller.
1 . A method, comprising:
receiving, from a caller, a call for a data stream of a specified size;
initializing the data stream by specifying a first prime number and a second prime number, and by specifying an available amount of data;
generating data of the data stream using the first prime number and the second prime number;
transmitting the data of the data stream to the caller until either:
the data stream has fulfilled the call; or
until the available amount of data becomes zero; and
during the transmitting, maintaining a running counter that starts at the available amount of data, and decrementing the counter by the amount of data sent to the caller, and wherein the data stream is generated relatively faster than would be the case if a check of available data were performed each time a discrete portion of the data stream was generated.
2 . The method as recited in claim 1 , wherein when (1) the available amount of data becomes zero, and (2) the specified size of the call exceeds an amount of data that has been sent to the caller, the method further comprises changing one of the prime numbers, setting the available amount of data to the specified available amount, and generating additional data using the prime number that was changed.
3 . The method as recited in claim 2 , wherein the method is repeated until the call has been fulfilled.
4 . The method as recited in claim 1 , wherein the available amount of data is an amount of data that can be generated using the first prime number and the second prime number without repeating any data.
5 . The method as recited in claim 1 , wherein when the specified size of the call is less than the available amount of data, and when all the data required by the call has been sent to the caller, the available amount is updated to a new available amount that comprises a difference between (1) the available amount specified at the initializing and (2) the amount of data required by the call.
6 . The method as recited in claim 1 , wherein the available amount of data specified at the initializing is a function of a 32-bit address space that is used to generate data of the data stream.
7 . The method as recited in claim 1 , wherein the datastream is generated in discrete portions of 8 bytes each.
8 . The method as recited in claim 1 , wherein the initializing further comprises specifying a seed value.
9 . The method as recited in claim 1 , wherein the first prime number is a 32-bit prime number, and the second prime number is a 32-bit prime number.
10 . A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:
receiving, from a caller, a call for a data stream of a specified size;
initializing the data stream by specifying a first prime number and a second prime number, and by specifying an available amount of data;
generating data of the data stream using the first prime number and the second prime number;
transmitting the data of the data stream to the caller until either:
the data stream has fulfilled the call; or
until the available amount of data becomes zero; and
during the transmitting, maintaining a running counter that starts at the available amount of data, and decrementing the counter by the amount of data sent to the caller, and wherein the data stream is generated relatively faster than would be the case if a check of available data were performed each time a discrete portion of the data stream was generated.
11 . The non-transitory storage medium as recited in claim 10 , wherein when (1) the available amount of data becomes zero, and (2) the specified size of the call exceeds an amount of data that has been sent to the caller, the operations further comprise changing one of the prime numbers, setting the available amount of data to the specified available amount, and generating additional data using the prime number that was changed.
12 . The non-transitory storage medium as recited in claim 11 , wherein the operations are repeated until the call has been fulfilled.
13 . The non-transitory storage medium as recited in claim 10 , wherein the available amount of data is an amount of data that can be generated using the first prime number and the second prime number without repeating any data.
14 . The non-transitory storage medium as recited in claim 10 , wherein when the specified size of the call is less than the available amount of data, and when all the data required by the call has been sent to the caller, the available amount is updated to a new available amount that comprises a difference between (1) the available amount specified at the initializing and (2) the amount of data required by the call.
15 . The non-transitory storage medium as recited in claim 10 , wherein the available amount of data specified at the initializing is a function of a 32-bit address space that is used to generate data of the data stream.
16 . The non-transitory storage medium as recited in claim 10 , wherein the datastream is generated in discrete portions of 8 bytes each.
17 . The non-transitory storage medium as recited in claim 10 , wherein the initializing further comprises specifying a seed value.
18 . The non-transitory storage medium as recited in claim 10 , wherein the first prime number is a 32-bit prime number, and the second prime number is a 32-bit prime number.