Supporting Non-Contiguouse Processor Allocation in Mesh-based CMPs

Please enable javascript in your browser.

Asadinia, Marjan | 2010

687 Viewed

Type of Document: M.Sc. Thesis
Language: English
Document No: 41525 (52)
University: Sharif University of Technology, International Campus, Kish Island
Department: Science and Engineering
Advisor(s): Sarbazi-Azad, Hamid
Abstract:
In this thesis, we propose a processor allocation mechanism for run-time assignment of a set of communicating tasks of input applications onto the processing nodes of a Chip Multiprocessor (CMP), when the arrival order and execution life-time of the input applications are not known a priori. This mechanism targets the on-chip communication and aims to reduce the power and latency of the Network-on-Chip (NoC). In this work, we benefit from the advantages of non-contiguous processor allocation mechanisms, by allowing the tasks of the input application to be mapped onto disjoint regions (sub-meshes) and then virtually connecting them by bypassing the router pipeline stages of inter-region routers. Among different existing contiguous and non-contiguous processor allocation techniques, we have chosen and implemented four schemes: Best Fit (BF) and Stack-Based Allocation (SBA) algorithms as contiguous techniques and Greedy-Available-Busy-List (GABL) algorithm and Run-time Incremental Mapping as non-contiguous techniques. Experimental results show considerable improvements over contiguous and non-contiguous methods
Keywords:
Processor Allocation ; Efficiency ; Power ; Network-on-Chip (NOC) ; Contiguous Allocation Algorithm ; Non-Contiguous Allocation Algorithm

No TOC