Online Scheduling of Applications on 3D Stacked Large Chip Multiprocessor

Performance of 3D stacked memory is impressive in multicore system. In three dimensional stacked large chip multiprocessor (3D LCMP), memory and memory network are integrated on top of the processors and processor network. In this paper, we have proposed an online strategy for mapping application´s tasks and data onto 3D LCMP platforms. To meet performance constraints every application demand a set of resources (may be number of processor and amount of memory). An important criteria in allocation is to allocate all required resources as near as possible to reduce the communication overhead. We have proposed approximate nearest approach to allocate resources of a layer with respect to other resource layer (either processor or memory). In our work, we have compared three different strategies to allocate resources to application: in first one processor allocation is preferred over memory allocation, in second one memory allocation is preferred over processor and in third one priority is set depend on requirement of applications. Our experimental analysis shows 21% in average and up to 30% improvement over state of art one layer resource allocation. On demand priority based resource allocation improve 26% over simple processor or memory priority based resource allocation.