Efficient Data-Driven Task Allocation for Future Many-Cluster On-chip Systems
| Autor: | Antoni Portero, Alberto Scionti, Somnath Mazumdar |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Hardware architecture
Computer science business.industry Locality 020206 networking & telecommunications 02 engineering and technology 020202 computer hardware & architecture Scheduling (computing) Data-driven Instruction set Allocator Embedded system 0202 electrical engineering electronic engineering information engineering Interposer business Execution model |
| Zdroj: | HPCS |
| Popis: | Continuous demand for higher performance is adding more pressure on hardware designers to provide faster machines with low energy consumption. Recent technological advancements allow placing a group of silicon dies on top of a conventional interposer (silicon layer), which provides space to integrate logic and interconnection resources to manage active processing cores. However, such large resource availability requires an adequate Program eXecution Model (PXM) as well as an efficient mechanism to allocate resources in the system. From this perspective, fine-grain data-driven PXMs represent an attractive solution to reduce the cost of synchronising concurrent activities. The contribution of this work is twofold. First, a hardware architecture called TALHES - a Task ALlocator for HEterogeneous System is proposed to support scheduling of multi-threaded applications (adhering to an explicit data-driven PXM). TALHES introduces a Network-on-Chip (NoC) extension: i) while on-chip 2D-mesh NoCs are used to support locality of computations in the execution of a single task; ii) a global task scheduler integrated into the silicon interposer orchestrates application tasks among different clusters of cores (eventually with different computing capabilities). The second contribution of the paper is a simulation framework that is tailored to support the analysis of such fine-grain data-driven applications. In this work, Linux Containers are used to abstract and efficiently simulate clusters of cores (i.e., a single die), as well as the behaviour of the global scheduling unit. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|