TY - GEN
T1 - Prioritized Asynchronous Calls for Parallel Processing on Responsive MultiThreaded Processor
AU - Lopez, Tomas A.
AU - Yamasaki, Nobuyuki
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - With the advent of parallel processors for embedded systems, it is very important to design new runtime and system features so that embedded software developers can take advantage of the increased throughput and responsiveness without the hindrances of low-level synchronization and data sharing. In this paper, we design and implement a fully-prioritized, work-conserving, and event-driven parallel computing runtime on Responsive MultiThreaded Processor (RMTP), a simultaneous multi-threading (SMT) processing platform with priority for real-time systems, which implements hardware-based resource allocation and context switching. The proposed runtime achieves low-cost forks and fine-grained prioritized scheduling by using special-purpose hardware functionalities on the RMTP, and also reduces resource over-subscription penalties while allowing for dynamic parallelism by employing a continuation-stealing execution strategy. We evaluate the performance of the proposed system with a set of benchmarks derived from the MiBench suite, and show that meaningful speedup can be achieved even when the degree of parallelism at each level is dynamically varied.
AB - With the advent of parallel processors for embedded systems, it is very important to design new runtime and system features so that embedded software developers can take advantage of the increased throughput and responsiveness without the hindrances of low-level synchronization and data sharing. In this paper, we design and implement a fully-prioritized, work-conserving, and event-driven parallel computing runtime on Responsive MultiThreaded Processor (RMTP), a simultaneous multi-threading (SMT) processing platform with priority for real-time systems, which implements hardware-based resource allocation and context switching. The proposed runtime achieves low-cost forks and fine-grained prioritized scheduling by using special-purpose hardware functionalities on the RMTP, and also reduces resource over-subscription penalties while allowing for dynamic parallelism by employing a continuation-stealing execution strategy. We evaluate the performance of the proposed system with a set of benchmarks derived from the MiBench suite, and show that meaningful speedup can be achieved even when the degree of parallelism at each level is dynamically varied.
KW - asynchronous call
KW - continuation-stealing
KW - futures
KW - parallel computing
KW - prioritized execution
KW - real-time systems
KW - runtime
UR - http://www.scopus.com/inward/record.url?scp=85148590072&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85148590072&partnerID=8YFLogxK
U2 - 10.1109/CANDAR57322.2022.00014
DO - 10.1109/CANDAR57322.2022.00014
M3 - Conference contribution
AN - SCOPUS:85148590072
T3 - Proceedings - 2022 10th International Symposium on Computing and Networking, CANDAR 2022
SP - 46
EP - 55
BT - Proceedings - 2022 10th International Symposium on Computing and Networking, CANDAR 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th International Symposium on Computing and Networking, CANDAR 2022
Y2 - 21 November 2022 through 22 November 2022
ER -