@inproceedings{22,
  abstract     = {{This paper describes a data structure and a heuristic to plan and map arbitrary resources in complex combinations while applying time dependent constraints. The approach is used in the planning based workload manager OpenCCS at the Paderborn Center for Parallel Computing (PC\(^2\)) to operate heterogeneous clusters with up to 10000 cores. We also show performance results derived from four years of operation.}},
  author       = {{Keller, Axel}},
  booktitle    = {{Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)}},
  editor       = {{Klusáček, D. and Cirne, W. and Desai, N.}},
  isbn         = {{978-3-319-77398-8}},
  keywords     = {{Scheduling Planning Mapping Workload management}},
  location     = {{Orlando, FL, USA}},
  pages        = {{132--151}},
  publisher    = {{Springer}},
  title        = {{{A Data Structure for Planning Based Workload Management of Heterogeneous HPC Systems}}},
  doi          = {{10.1007/978-3-319-77398-8_8}},
  volume       = {{10773}},
  year         = {{2018}},
}

