Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yanxing Yang

dblp:367/9488 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 44% Parallel and multicore computing · 28% Electronic design automation · 28%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
real-time scheduling
0.712023
Brief Industry Paper: Towards Efficient Task Scheduling for AUTOSAR using Parallel Pruning · RTSS 2023
Parallel and multicore computing
task scheduling
0.712023
Brief Industry Paper: Towards Efficient Task Scheduling for AUTOSAR using Parallel Pruning · RTSS 2023
Embedded and real-time systems › cyber-physical system platforms
autonomous driving systems
0.212023
Brief Industry Paper: Towards Efficient Task Scheduling for AUTOSAR using Parallel Pruning · RTSS 2023
Embedded and real-time systems
cyber-physical system platforms
0.212023
Brief Industry Paper: Towards Efficient Task Scheduling for AUTOSAR using Parallel Pruning · RTSS 2023

Methods — techniques the papers use, named apart from their topics

search-based optimization · 0.7parallel pruning · 0.7
YearPublicationVenuePosition
2023 Brief Industry Paper: Towards Efficient Task Scheduling for AUTOSAR using Parallel Pruning
abstract
As a standardized software framework and open E/E system architecture, the AUTomotive Open System ARchitecture (AUTOSAR) has been widely applied to autonomous driving systems to enable real-time control. However, due to the increasing design complexity and the lack of efficient algorithms and design automation tools, it is difficult to quickly figure out an optimal task scheduling scheme for an AUTOSAR-based system. To address this problem, we introduce a novel task scheduling method that can parallelly search for an optimal solution with the help of our proposed pruning strategy. Experimental results on a real-world AUTOSAR-based autonomous driving system demonstrate that our approach can achieve much better task scheduling solutions than the ones obtained manually and significantly reduce the overall task scheduling time.
Yanxing Yang, Nan Zhang 0019, Dengke Yan, Xian Wei, Junlong Zhou, Mingsong Chen 0001
RTSS1