DocumentCode
1995686
Title
Processor Allocation Problem for NoC-Based Chip Multiprocessors
Author
Zydek, Dawid ; Selvaraj, Henry
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Nevada, Las Vegas, NV
fYear
2009
fDate
27-29 April 2009
Firstpage
96
Lastpage
101
Abstract
Chip multiprocessors (CMPs) have become the primary approach to build high-performance microprocessors. Such systems require fast and efficient communication that can only be realized using network on chip (NoC), particularly for large systems. Allocation and management of on-chip processors are also important factors to achieve high efficiency. Designing processor allocator, job scheduler and NoC are major issues for future CMPs. In this paper we analyze architectures of NoC for CMPs. Such NoC parameters as topology, flow control and routing are studied and proposed for CMPs implementation. Modern processor allocation algorithms together with scheduling techniques are reviewed and suggested. Hardware structure of NoC-based CMPs is introduced for the recommended solutions. We propose hardware implementation of processor allocator and job scheduler, and place them together with on-chip processors on the same die.
Keywords
microprocessor chips; network routing; network topology; network-on-chip; NoC-based chip multiprocessors; high-performance microprocessors; job scheduler; network on chip; on-chip processors; processor allocation problem; Computer architecture; Delay; Distributed computing; Hardware; Job design; Network-on-a-chip; Operating systems; Processor scheduling; Routing; Scheduling algorithm; CMPs; NoC; allocation algorithms; hardware implementation; scheduling techniques;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-3770-2
Electronic_ISBN
978-0-7695-3596-8
Type
conf
DOI
10.1109/ITNG.2009.182
Filename
5070599
Link To Document