We consider the framework of Parameterized Complexity, and we investigate the issue of which problems do admit efficient fixed parameter parallel algorithms by introducing two different degrees of efficiently parallelizable parameterized problems, PNC and FPP. We sketch both some FPP-algorithms solving natural parameterized problems and a useful tool for proving ... more >>>