International Conference on Computer and Automation Engineering, 4th (ICCAE 2012)
30 A Novel Binary Search Based Method to Find Minimal Number of Cores Required to Obtain Minimal Makespan, Given Makespan and Given Utilization of Cores for a DAG Application
Download citation file:
Scheduling is one of the core steps to efficiently exploit the full capabilities of a multicore machine and is an NP-complete problem. The number of cores on a chip is proliferating now to take advantage of improvement in VLSI technology. Not all applications can effectively utilize all cores on the chip, hence it would be advantageous to multiprogram the processor and spacepartition the cores among applications being multiprogrammed. The objectives then could be to obtain minimal makespan, desired makespan or desired utilization of cores for a given DAG. We have proposed and experimented a binary search based method to find...