Offline Non-preemptive Scheduling
Offline Non-Preemptive Scheduling is a deterministic scheduling paradigm within real-time and batch processing systems wherein all job characteristics, including arrival times, execution requirements, and deadlines, are known a priori, and once initiated, each job executes to completion without interruption.
13
Publications
347
Citations
38
Authors
28
Institutions
Publications per year
2017–2026
4
Parents
13
Minimizing makespan and total completion time in MapReduce-like systems
Yuqing Zhu, Yiwei Jiang, Weili Wu et al. · 2014 · 49 citations
1–5 of 13
38
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 38
28
University of Kaiserslautern
Kaiserslautern, Germany
2 h-index
3 publications
53 citations
University of Washington Tacoma
Tacoma, United States
1 h-index
2 publications
98 citations

Renmin University of China
Beijing, China
1 h-index
1 publications
49 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
11 citations
École Centrale de Nantes
Nantes, France
1 h-index
2 publications
118 citations

University College Cork
Cork, Ireland
1 h-index
2 publications
62 citations

The University of Texas at El Paso
El Paso, United States
1 h-index
1 publications
50 citations

Nantes Université
Nantes, France
1 h-index
2 publications
118 citations
1–8 of 28
2 publications · 39 citations
2
h-index
1 publications · 15 citations
1
h-index
1 publications · 50 citations
1
h-index
Conference · 1 publications · 59 citations
1
h-index
1–4