J
Jing Li
Researcher at New Jersey Institute of Technology
Publications - 43
Citations - 1115
Jing Li is an academic researcher from New Jersey Institute of Technology. The author has contributed to research in topics: Scheduling (computing) & Directed acyclic graph. The author has an hindex of 14, co-authored 36 publications receiving 881 citations. Previous affiliations of Jing Li include Harbin Institute of Technology & Washington University in St. Louis.
Papers
More filters
Journal ArticleDOI
Multi-core real-time scheduling for generalized parallel task models
TL;DR: A new task decomposition method is proposed that decomposes each parallel task into a set of sequential tasks and achieves a resource augmentation bound of 4 and 5 when the decomposed tasks are scheduled using global EDF and partitioned deadline monotonic scheduling, respectively.
Proceedings ArticleDOI
Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks
TL;DR: The federated scheduling algorithm proposed in this paper is a generalization of partitioned scheduling to parallel tasks and shows that if on unit-speed cores, a task set has total utilization of at most m and the critical-path length of each task is smaller than its deadline, then Federated scheduling can schedule that task set.
Journal ArticleDOI
Parallel Real-Time Scheduling of DAGs
TL;DR: This paper addresses the problem of realtime scheduling for a general model of deterministic parallel tasks, where each task is represented as a directed acyclic graph (DAG) with nodes having arbitrary execution requirements, and proves processor-speed augmentation bounds for both preemptive and nonpreemptive real- time scheduling for general DAG tasks on multi-core processors.
Proceedings ArticleDOI
Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks
TL;DR: Simulations confirm that the GEDF is not only safe under the capacity augmentation bound for various randomly generated task sets, but also performs surprisingly well and usually outperforms an existing scheduling technique that involves task decomposition.
Proceedings ArticleDOI
A real-time scheduling service for parallel tasks
TL;DR: This work describes the design and implementation of a scheduler and runtime dispatcher for a new concurrency platform, RT-OpenMP, whose goal is the execution of real-time workloads with intra-task parallelism.