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 "reservation based federated scheduling for parallel real time tasks"):
  Abstract: This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federated scheduling approach. We propose a reservation-based algorithm, called reservation-based federated scheduling, that dominates federated scheduling. We provide general constraints for the design of such systems and prove that reservation-based federated scheduling has a constant speedup factor with respect to any optimal DAG task scheduler. Furthermore, the presented algorithm can be used in conjunction with any scheduler and scheduling analysis suitable for ordinary arbitrary-deadline sporadic task sets, i.e., without parallelism.

Includes members:
  Member "push forward global fixed priority scheduling of arbitrary deadline sporadic task systems":
    also connected through other hyperedges:
      (none)
  Member "semi federated scheduling of parallel real time tasks on multiprocessors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dependency graph approach for multiprocessor real time synchronization")
  Member "federated scheduling admits no constant speedup factors for constrained deadline dag task systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dependency graph approach for multiprocessor real time synchronization")
  Member "partitioned multiprocessor fixed priority scheduling of sporadic real time tasks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "period adaptation for continuous security monitoring in multicore real time systems")
  Member "feasibility analysis in the sporadic dag task model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cache where you want reconciling predictability and coherent caching")

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.OS(Operating Systems)