Topology-aware Scheduling

Topology-Aware Scheduling is a task scheduling strategy in distributed heterogeneous systems that belongs to the class of resource allocation methods and is distinguished by its explicit consideration of the underlying system's hardware topology—such as interconnect latency, memory hierarchy, and compute node proximity—to optimize performance, efficiency, or fault tolerance in cluster environments.

64

Publications

2.7K

Citations

193

Authors

110

Institutions

Publications per year

2017–2026

16

Authors

193

  1. YS
    Yi-Sheng Su

    Chang Jung Christian University, Taiwan

    3 publications · 52 citations

    3

    h-index

  2. CJ
    Charles J. Colbourn

    Arizona State University, United States

    3 publications · 60 citations

    3

    h-index

  3. VR
    Violet R. Syrotiuk

    Arizona State University, United States

    3 publications · 60 citations

    3

    h-index

  4. LT
    Leandros Tassiulas

    University of Thessaly, Greece

    2 publications · 185 citations

    2

    h-index

  5. AM
    Asif Muhammad

    National University of Computer and Emerging Sciences, Pakistan

    2 publications · 42 citations

    2

    h-index

1–5 of 193

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 129 citations

    4

    h-index

  2. IEEE/ACM Transactions on Networking

    TON · 3 publications · 427 citations

    3

    h-index

  3. IEEE Transactions on Mobile Computing

    TMCCI · 2 publications · 28 citations

    2

    h-index

  4. IEEE Transactions on Vehicular Technology

    2 publications · 65 citations

    2

    h-index

  5. IEEE Transactions on Wireless Communications

    2 publications · 45 citations

    2

    h-index

1–5