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 "doing it all with bounded work and communication"):
  Abstract: Abstract   We consider the Do-All problem, where p cooperating processors need to complete t similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of workcomplexity and communication complexity. When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work    O  (  t  +  p  log  ⁡  p    (    p  log  ⁡  p    +    t  log  ⁡  t      )  )    and a nonconstructive algorithm that has work    O  (  t  +  p    log    2    ⁡  p  )   . The latter result is close to the lower bound    Ω  (  t  +  p  log  ⁡  p  /  log  ⁡  log  ⁡  p  )    on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by c p, for some positive constant    c    1   . We also present a nonconstructive algorithm that has effort    O  (  t  +    p    1.77    )   .

Includes members:
  Member "solving the at most once problem with nearly optimal effectiveness":
    also connected through other hyperedges:
      (none)
  Member "performing work efficiently in the presence of faults":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fault tolerant parallel scheduling of arbitrary length jobs on a shared channel")

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)