Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer and Automation Engineering, 4th (ICCAE 2012)

Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

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...

1. Introduction
2. Related Work
3. Proposed Binary Search Based Method
4. Experimental Setup and Results
5. Conclusion and Future Enhancement
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal