.png){kind=icon}
返回
Task Preemption Based on Petri Nets
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2964382.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A business process is a logically related set of business tasks. Each task contains multiple activities, and each activity has its corresponding performers. To improve the efficiency of processes, some scheduling operations will be conducted between performers, thus causing the phenomenon of task preemption. In view of this phenomenon, a Logical Time Petri net (LTPN) is proposed to describe task preemption in concurrent business process systems. By classifying place and transition sets, the relationship between activities and performers are modeled, and then the assignment and triggering of tasks are realized. Note that we consider both the priority of the control place and time constraints, which better describe the task preemption process in business flow. In addition, we propose a novel scheduling algorithm for the task preemption model. Effectiveness and applicability of the proposed methods are verified by a case study.
Keyword:
Business processes
task preemption
logical time Petri nets
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏GPUart - An application-based limited preemptive GPU real-time scheduler for embedded systemsGPUart-一种基于应用的嵌入式系统有限抢占式GPU实时调度器
PREAI
分享收藏
查看更多内容