Task Scheduling Under Contention is a computational framework within the domain of distributed systems that orchestrates the execution of tasks across shared resources by prioritizing fairness, efficiency, and resilience in the presence of simultaneous access demands.
53
Publications
1.9K
Citations
158
Authors
88
Institutions
Publications per year
2017–2026
15
Parents
Publications
53
Scalable I/O-Aware Job Scheduling for Burst Buffer Enabled HPC Clusters
Stephen Herbein, Dong H. Ahn, Don Lipari et al. · 2016 · 75 citations · Full text
Joint scheduling for optical grid applications
Yan Wang, Yaohui Jin, Wei Guo et al. · Journal of Optical Networking · 2007 · 61 citations
1–5 of 53
Authors
158
- RP
4
h-index
- RI
2
h-index
- MS
2
h-index
- MB
2
h-index
- HY
2
h-index
1–5 of 158
Institutions
88
University of Waterloo
Waterloo, Canada
3 h-index
5 publications
115 citations
Wayne State University
Detroit, United States
2 h-index
4 publications
103 citations
Shanghai Jiao Tong University
Shanghai, China
2 h-index
8 publications
390 citations
National University of Singapore
Singapore, Singapore
2 h-index
4 publications
84 citations
University of Kansas
Lawrence, United States
2 h-index
3 publications
77 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
2 h-index
2 publications
44 citations
Uppsala University
Uppsala, Sweden
2 h-index
5 publications
75 citations
University of Auckland
Auckland, New Zealand
2 h-index
4 publications
256 citations
1–8 of 88
Venues
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 3 publications · 114 citations
3
h-index
- IEEE Transactions on Computers
3 publications · 59 citations
3
h-index
- ACM Transactions on Embedded Computing Systems
TECS · 2 publications · 54 citations
2
h-index
- Parallel Computing
2 publications · 82 citations
2
h-index
- IEEE Transactions on Industrial Informatics
1 publications · 43 citations
1
h-index
1–5