Build recursion in parallel?

Question

Problem

Let's define a simple recursion.

f[1] = 1;
f[n_] := f[n] = f[n - 1]*n;

If I evaluate f in parallel

ParallelTable[f[i], {i, 10}];

and then query f

?f
Global`f
f[1]=1
f[n_]:=f[n]=f[n-1] n

Question

How can I tell the sub kernels to build up the recursion, so that

?f

Global`f

f[1]=1
....
f[10]=3628800

f[n_]:=f[n]=f[n-1] n

Thanks !

PS: of course the actual function is not that trivial.

Answer 1

@sebhofer provides a partial answer via the command

SetSharedFunction[f] 

which collects to the master kernel the accumulated downvalues. On the other hand, the slave kernels seem unaware of these.

Indeed

ParallelTable[f[i], {i, 5000}]; 
Table[f[i], {i, 5000}]; // Timing 

(* {0.005126,Null} *)

which suggests the master kernel does remember the previous definitions. On the other hand,

ParallelTable[f[i], {i, 5000}]; // Timing 

(* {6.69067,Null} *)

still takes quite some time.