Runtime Scheduling
Runtime Scheduling is a computational management strategy that dynamically allocates tasks to heterogeneous processing resources in distributed reconfigurable accelerator systems during program execution, distinguished by its adaptability to real-time workload variations and hardware reconfiguration capabilities.
367
Publications
16.5K
Citations
1.2K
Authors
335
Institutions
Publications per year
2017–2026
84
367
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul et al. · 1995 · 1K citations · Full text
Swift: Fast, Reliable, Loosely Coupled Parallel Computation
Yong Zhao, Mihael Hategan, Ben Clifford et al. · 2007 · 355 citations
1–5 of 367
1.2K
8
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 1.2K
335
University of California San Diego
San Diego, United States
12 h-index
40 publications
5.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
32 publications
2.3K citations
IMEC
Leuven, Belgium
10 h-index
41 publications
2K citations
University of California, Berkeley
Berkeley, United States
9 h-index
20 publications
1.5K citations
Universidad Complutense de Madrid
Madrid, Spain
9 h-index
27 publications
978 citations
University of Tennessee at Knoxville
Knoxville, United States
8 h-index
26 publications
1.8K citations

University of Edinburgh
Edinburgh, United Kingdom
8 h-index
20 publications
694 citations
University of California, Irvine
Irvine, United States
8 h-index
19 publications
682 citations
1–8 of 335
11 publications · 1.1K citations
11
h-index
TPDS · 8 publications · 261 citations
8
h-index
TECS · 8 publications · 248 citations
8
h-index
6 publications · 103 citations
6
h-index
6 publications · 887 citations
6
h-index
1–5