Author:
Wang Weina,Harchol-Balter Mor,Jiang Haotian,Scheller-Wolf Alan,Srikant R.
Funder
Division of Electrical, Communications and Cyber Systems
Division of Computing and Communication Foundations
Division of Civil, Mechanical and Manufacturing Innovation
Army Research Office
Office of Naval Research Global
Defense Threat Reduction Agency
Microsoft
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Management Science and Operations Research,Computer Science Applications
Reference53 articles.
1. Baccelli, F.: Two parallel queues created by arrivals with two demands: the M/G/2 symmetrical case. Technical Report RR-0426, INRIA (1985)
2. Baccelli, F., Makowski, A.M.: Simple computable bounds for the fork–join queue. Technical Report RR-0394, INRIA (1985)
3. Baccelli, F., Makowski, A.M., Shwartz, A.: The fork–join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Adv. Appl. Probab. 21, 629–660 (1989)
4. Bramson, M., Lu, Y., Prabhakar, B.: Asymptotic independence of queues under randomized load balancing. Queueing Syst. 71(3), 247–292 (2012)
5. Chen, Y., Alspaugh, S., Katz, R.: Interactive analytical processing in big data systems: a cross-industry study of MapReduce workloads. Proc. VLDB Endow. 5(12), 1802–1813 (2012)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献