Optimizing the time cost of the parallel structures with a limited number of processors
Tahany A. Fergany, Reda A.A. Ammar, M.R. Neilforoshan-Dardashti · 2002
We develop an allocation algorithm that, in conjunction with optimal scheduling algorithms, yields the minimum time cost for a parallel structure. We assume a shared memory environment and a limited number of processors that is less than the degree of parallelism of the parallel structure.>