Conference paper
Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
This paper studies batch arrival MX/G/1 priority queues without and with (multiple or single) vacations. Applying the delay busy cycle analysis, we explicity derive the Laplace-Stieltjes transforms and the first two moments of the waiting time distributions for the nonpreemptive (head-of-the-line) and preemptive resume priority queues. Conservation laws for batch arrival systems are also mentioned. The results in this paper cover many previous results as special cases. © 1991.
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Leo Liberti, James Ostrowski
Journal of Global Optimization
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
T. Graham, A. Afzali, et al.
Microlithography 2000