Supporting Non-Contiguouse Processor Allocation in Mesh-based CMPs, M.Sc. Thesis Sharif University of Technology ; Sarbazi-Azad, Hamid (Supervisor)
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...
Cataloging briefSupporting Non-Contiguouse Processor Allocation in Mesh-based CMPs, M.Sc. Thesis Sharif University of Technology ; Sarbazi-Azad, Hamid (Supervisor)
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...
Find in contentBookmark |
|