A parallel algorithm is scalable if the concurrent efficiency can be held
constant as the number of processors increases by increasing the problem size.
The isoefficiency function, , gives the
problem size necessary to maintain some fixed efficiency, ,
as increases.
, gives the
problem size necessary to maintain some fixed efficiency, 
,
as 
increases.