Constraint-based Placement

Constraint-Based Placement is a workload placement strategy that belongs to the class of optimization-based placement methods, distinguished by its incorporation of hard and soft constraints—such as resource availability, latency requirements, energy limits, and policy rules—to determine feasible and optimal allocations of services or workloads in edge computing environments.

55

Publications

2.6K

Citations

183

Authors

85

Institutions

Publications per year

2017–2026

18

Authors

183

  1. EF
    Evangeline F. Y. Young

    Chinese University of Hong Kong, Hong Kong SAR China

    3 publications · 119 citations

    3

    h-index

  2. BH
    Bill Halpin

    Intel (United States), United States

    3 publications · 133 citations

    3

    h-index

  3. DT
    David T. Westwick

    University of Calgary, Canada

    2 publications · 56 citations

    2

    h-index

  4. AK
    Andrew Kennings

    University of Waterloo, Canada

    2 publications · 56 citations

    2

    h-index

  5. TS
    Tal Shaked

    University of Washington, United States

    2 publications · 72 citations

    2

    h-index

1–5 of 183

Venues

  1. Cluster Computing

    2 publications · 55 citations

    2

    h-index

  2. Journal of Network and Computer Applications

    JNCA · 2 publications · 57 citations

    2

    h-index

  3. Computer Networks

    2 publications · 82 citations

    2

    h-index

  4. 2

    h-index

  5. IEEE Transactions on Industrial Informatics

    1 publications · 15 citations

    1

    h-index

1–5