Need to store a table of the previous p numbers in the sequence, where p is the largest lag. This is known as the lag table.
For LCGs, need only one or two initial seeds to start the recursion relation. For LFGs, need to generate a seed table, i.e. all p initial values in the lag table. Must do this using a different random number generator.
The lag table is accessed and updated using a circular list technique,
where pointers to the 
and 
previous values are stored
and updated, rather than moving the positions of all elements of the
lag table after every iteration.