Task generation algorithm

Figure 3 exhibits what would be perfect load balance for the finite example shown in Figure 2. The largest granularity tasks are done first, then the medium-grained ones finally, the smallest granularity tasks are used to balance the computation. Unfortunately, in many applications it is difficult to reorder the task generation algorithm to actually sequence the tasks in order of granularity. It may be difficult to predict a priori how long a given task will take. The concept of a shared counter can be used to load-balance this computation.

The definition assumes that one party has to generate a value K (usually some sort of key — in the present application the prekey) with a certain probability distribution Corr (for correct ) and needs a generation algorithm gen for this task, and another party wants to be convinced that K is an element of a set Good. The first party is called the prover, the second party the verifier. More precisely, both the distribution and the set are parametrized with security parameters, and there is a precondition that all values generated with the correct distribution are elements of Good. 

Automatic programming is the task of constructing and running an algorithm which can create and test its own computer programs. In its idealised form, GP generates programs in an entirely automatic fashion to solve problems posed by the user. 

In principle, it is possible to use the GENFIS algorithm for the generation of the SPS of any synthon. In practice, as was explained in the preceeding sections, this must lead to a combinatorial explosion for all but trivial tasks. The stabilization permits us to generate directly the synthetic precursors/successors of any given synthon. The STAB(S(A), S(4), Jf) is used to find all stabilizations S (A) e JT of synthon S(2f) with respect to S(T) (X c A) ... 

---