Yuan Zhong

Affiliations:
  • Columbia University, Industrial Engineering and Operations Research Department, New York, NY, USA
  • University of California Berkeley, CA, USA (2013)
  • Massachusetts Institute of Technology, Cambridge, MA, USA (PhD 2012)


According to our database1, Yuan Zhong authored at least 18 papers between 2010 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Resource Allocation and Rate Gains in Practical Full-Duplex Systems.
IEEE/ACM Trans. Netw., 2017

2016
Robust Scheduling for Flexible Processing Networks.
CoRR, 2016

Experimental Analysis of Algorithms for Coflow Scheduling.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints.
Queueing Syst. Theory Appl., 2015

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Asymptotic optimality of BestFit for stochastic bin packing.
SIGMETRICS Perform. Evaluation Rev., 2014

On Queue-Size Scaling for Input-Queued Switches.
CoRR, 2014

Efficient coflow scheduling with Varys.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

Robust scheduling and congestion control for flexible queueing networks.
Proceedings of the International Conference on Computing, Networking and Communications, 2014

Adaptive Stream Processing using Dynamic Batch Sizing.
Proceedings of the ACM Symposium on Cloud Computing, 2014

Robust scheduling in a flexible fork-join network.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

Scheduling tasks with precedence constraints on multiple servers.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
A large-scale service system with packing constraints: minimizing the number of occupied servers.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

An infinite server system with general packing constraints: Asymptotic optimality of a greedy randomized algorithm.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Optimal queue-size scaling in switched networks.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012

2011
Optimal scaling of average queue sizes in an input-queued switch: an open problem.
Queueing Syst. Theory Appl., 2011

2010
Qualitative properties of alpha-weighted scheduling policies.
Proceedings of the SIGMETRICS 2010, 2010


  Loading...