arrow
Return

Efficient task spawning for shared memory and message passing in many-core architectures

delete2017-06-01
delete3
PRE
AI
A
Aurang Zaib *
T
Thomas Wild
A
Andreas Herkersdorf
J
Jan Heißwolf
J
Jürgen Becker
A
Andreas Weichslgartner
J
Jürgen Teich
DOI:10.1016/j.sysarc.2017.03.004delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Modern many-core systems consist of large number of processing cores and introduce more and more parallelism. The (PGAS) programming model is a popular approach for exploiting this parallelism of architectures while offering flexibility of both shared memory and message passing paradigms. On the architecture design front, (NoCs) have become an integral part of the communication infrastructure due to their good scalability. In order to exploit task level parallelism on modern many-core architectures, the applications spawn more and more tasks to the available computing resources. The applications require less communication and synchronization delays for better performance. However, the distributed nature of NoCs poses a challenge to keep data communication and synchronization latency within the desired bound and hence results in higher task spawning overhead. We proposed an approach based on hardware-assisted task spawning on many-core systems [1]. In the current article, we present an extended version of our work for hardware-managed task spawning, keeping in view the communication requirements of both shared memory and message passing programming models. The proposed hardware support, integrated into the network interface architecture, reduces the synchronization overhead for task spawning. The software is offloaded from task spawning which results in an increase in the overall performance. The simulation results highlight that the proposed task spawning approach improves the overall performance up to 40% in comparison to an existing state-of-the-art approach [2]. To underline the applicability, we implemented an FPGA prototype to investigate real world applications. The investigations show that the proposed concept offers a low overhead in terms of implementation area cost on FPGA and ASIC platforms. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Partitioned global address space
Network on Chip
Network interface
Task spawning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Systems Architecture cover
Journal of Systems Architecture
IF:
4.1
Papers:
3.0K
Citations:
4.2K

Organization

K
karlsruhe institute of technology
Scholars:
2.0W
Papers: 1.4W
Citations: 23
H
Helmholtz Association
Scholars:
13.2W
Papers: 10.7W
Citations: 145
T
Technical University of Munich
Scholars:
5.2W
Papers: 3.9W
Citations: 6.2W
researcher View more organizations