human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "dynamic loop scheduling using mpi passive target remote memory access"
  Abstract: Scientific applications often contain large computationally-intensive parallel loops. Loop scheduling techniques aim to achieve load balanced executions of such applications. For distributed-memory systems, existing dynamic loop scheduling (DLS) libraries are typically MPI-based, and employ a master-worker execution model to assign variably-sized chunks of loop iterations. The master-worker execution model may adversely impact performance due to the master-level contention. This work proposes a distributed chunk-calculation approach that does not require the master-worker execution scheme. Moreover, it considers the novel features in the latest MPI standards, such as passive-target remote memory access, shared-memory window creation, and atomic read-modify-write operations. To evaluate the proposed approach, five well-known DLS techniques, two applications, and two heterogeneous hardware setups have been considered. The DLS techniques implemented using the proposed approach outperformed their counterparts implemented using the traditional master-worker execution model.

Connected through hyperedge HE-1 (induced by source paper "online research report rdlb a novel approach for robust dynamic load balancing of scientific applications with parallel independent tasks"):
  with members:
    - "openmp loop scheduling revisited making a case for more schedules"
    - "sil an approach for adjusting applications to heterogeneous systems under perturbations"
    - "performance reproduction and prediction of selected dynamic loop scheduling experiments"
    - "efficient generation of parallel spin images using dynamic loop scheduling"

Connected through hyperedge HE-2 (induced by source paper "rdlb a novel approach for robust dynamic load balancing of scientific applications with parallel independent tasks"):
  with members:
    - "openmp loop scheduling revisited making a case for more schedules"
    - "sil an approach for adjusting applications to heterogeneous systems under perturbations"
    - "performance reproduction and prediction of selected dynamic loop scheduling experiments"
    - "efficient generation of parallel spin images using dynamic loop scheduling"

Connected through hyperedge HE-3 (induced by source paper "hierarchical dynamic loop self scheduling on distributed memory systems using an mpi mpi approach"):
  with members:
    - "openmp loop scheduling revisited making a case for more schedules"
    - "efficient generation of parallel spin images using dynamic loop scheduling"

Question: Please tell me which class the center node 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)