Now 1097 visitors
Today:115 Yesterday:1123
Total: 5203 391S 104P 46R
2025-12-13, Week 50
Member Login
Welcome Message
Statistics
Committee
TACT Journal Homepage
Call for Paper
Paper Submission
Find My Paper
Author Homepage
Paper Procedure
FAQ
Registration / Invoice
Paper Archives
Outstanding Papers
Proceedings
Presentation Assistant
Hotel & Travel Info
Photo Gallery
Scheduler Login
Seminar
Archives Login
Sponsors
























IEEE/ICACT20230136 Question.3
Questioner: chen.jy@siat.ac.cn    2023-02-21 ¿ÀÈÄ 4:40:29
IEEE/ICACT20230136 Answer.3
Answer by Auhor lizihu@bupt.edu.cn   2023-02-21 ¿ÀÈÄ 4:40:29
You mentioned the subtask sorting algorithm on Slide.10, where you get the priority of each subtask by topological sorting it. What I do not understand is that topological sorting itself is a way to get the priority of the edge subtasks? What's the principle he's based on? Based on what characteristics or metrics? Thank you for your question. Because the input to this model is multiple DNN tasks, and each DNN task is composed of different subtasks. When a DNN task is detected, the getter can get the priority of each DNN task. Topological sort is the local priority of subtasks in the DNN task. We use the formula to get the global priority of each subtask in the input. When uninstalling DNN tasks, we consider not only the topological priority of each subtask, but also the priority of different DNN tasks.

Select Voice