Non-preemptive Scheduling Model
A Non-Preemptive Scheduling Model is a task scheduling model in which once a task is assigned to a processing unit, it must execute to completion without interruption or rescheduling until termination.
81
Publications
4.3K
Citations
206
Authors
120
Institutions
Publications per year
2017–2026
20
Parents
81
Scheduling fixed-priority tasks with preemption threshold
Yun Wang, M. Saksena · 2003 · 270 citations
1–5 of 81
206
3
h-index
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 330 citations
2
h-index
2
h-index
2
h-index
1–5 of 206
120
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
176 citations
New Jersey Institute of Technology
Newark, United States
2 h-index
3 publications
46 citations
Stanford University
Stanford, United States
2 h-index
2 publications
124 citations

University of Tehran
Tehran, Iran
2 h-index
4 publications
78 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
3 publications
1.1K citations
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
210 citations
University of Kaiserslautern
Kaiserslautern, Germany
2 h-index
2 publications
39 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
125 citations
1–8 of 120
3 publications · 170 citations
4
h-index
JAP · 3 publications · 117 citations
3
h-index
2 publications · 40 citations
2
h-index
Repository · 2 publications · 79 citations
2
h-index
TPDS · 2 publications · 212 citations
2
h-index
1–5