human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a data driven approach to dynamically adjust resource alocation for compute clusters"):
  Abstract: Nowadays, data-centers are largely under-utilized because resource allocation is based on reservation mechanisms which ignore actual resource utilization. Indeed, it is common to reserve resources for peak demand, which may occur only for a small portion of the application life time. As a consequence, cluster resources often go under-utilized. #R##N#In this work, we propose a mechanism that improves cluster utilization, thus decreasing the average turnaround time, while preventing application failures due to contention in accessing finite resources such as RAM. Our approach monitors resource utilization and employs a data-driven approach to resource demand forecasting, featuring quantification of uncertainty in the predictions. Using demand forecast and its confidence, our mechanism modulates cluster resources assigned to running applications, and reduces the turnaround time by more than one order of magnitude while keeping application failures under control. Thus, tenants enjoy a responsive system and providers benefit from an efficient cluster utilization.

Includes members:
  Member "don t cry over spilled records memory elasticity of data parallel applications and its application to cluster scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "black or white how to develop an autotuner for memory based analytics extended version")
  Member "era a framework for economic resource allocation for the cloud":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online revenue maximization for server pricing")
  Member "flexible scheduling of distributed analytic applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decentralized gradient methods does topology matter")
  Member "revisiting size based scheduling with estimated job sizes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scheduling with inexact job sizes the merits of shortest processing time first")
  Member "variational gaussian process state space models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fedloc federated learning framework for cooperative localization and location data processing")
  Member "os assisted task preemption for hadoop":
    also connected through other hyperedges:
      (none)
  Member "psbs practical size based scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scheduling with inexact job sizes the merits of shortest processing time first")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DC(Distributed, Parallel, and Cluster Computing)