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 "energy efficient multiprocessor scheduling for flow time and makespan"):
  Abstract: We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power s^@a when running at speed s, for @a>1. A scheduling algorithm needs to decide at any time both processor allocations and processor speeds for a set of parallel jobs with time-varying parallelism. The objective is to minimize the sum of the total energy consumption and certain performance metric, which in this paper includes total flow time and makespan. For both objectives, we present instantaneous parallelism-clairvoyant (IP-clairvoyant) algorithms that are aware of the instantaneous parallelism of the jobs at any time but not their future characteristics, such as remaining parallelism and work. For total flow time plus energy, we present an O(1)-competitive algorithm, which significantly improves upon the best known non-clairvoyant algorithm. In the case of makespan plus energy, we present an O(ln^1^-^1^/^@[email protected]?P)-competitive algorithm, where P is the total number of processors. We show that this algorithm is asymptotically optimal by providing a matching lower bound. In addition, we study non-clairvoyant scheduling for total flow time plus energy, and present an algorithm that is O([email protected]?P)-competitive for jobs with arbitrary release time and O(ln^1^/^@[email protected]?P)-competitive for jobs with identical release time. Finally, we prove an @W(ln^1^/^@[email protected]?P) lower bound on the competitive ratio of any non-clairvoyant algorithm.

Includes members:
  Member "nonclairvoyant speed scaling for flow and energy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scheduling to minimize energy and flow time in broadcast scheduling")
  Member "non clairvoyant batch sets scheduling fairness is fair enough":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable hierarchical scheduling for malleable parallel jobs on multiprocessor based systems")

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.DS(Data Structures and Algorithms)