Parallel Scheduling Algorithms
Parallel Scheduling Algorithms is a class of computational methods designed to allocate tasks across multiple processing units in a parallel computing environment, distinguished by their ability to optimize resource utilization and execution time through strategic assignment and ordering of interdependent tasks.
804
Publications
38.5K
Citations
1.6K
Authors
762
Institutions
Publications per year
2017–2026
133
Parents
804
Hybrid scheduling for the parallel solution of linear systems
Patrick Amestoy, Abdou Guermouche, Jean-Yves L’Excellent et al. · Parallel Computing · 2005 · 1.1K citations · Full text
1–5 of 804
1.6K
11
h-index
10
h-index
9
h-index
8
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
6 publications · 972 citations
6
h-index
1–5 of 1.6K
762

Centre National de la Recherche Scientifique
Paris, France
20 h-index
60 publications
3.5K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
16 h-index
26 publications
949 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
13 h-index
23 publications
3.2K citations
IBM (United States)
Armonk, United States
12 h-index
24 publications
1.3K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
11 h-index
22 publications
1.2K citations
Tsinghua University
Beijing, China
11 h-index
19 publications
1.2K citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
11 h-index
18 publications
678 citations

Zhejiang University
Hangzhou, China
10 h-index
18 publications
417 citations
1–8 of 762
42 publications · 2.3K citations
29
h-index
36 publications · 1.9K citations
26
h-index
32 publications · 1.8K citations
25
h-index
TPDS · 22 publications · 1.8K citations
19
h-index
JOS · 18 publications · 719 citations
15
h-index
1–5