Catching the Microburst Culprits with Snappy Xiaoqi Chen Princeton University

First Page		Document Content
Date: 2018-10-24 08:56:38 Statistical randomness Meteorology Scheduling algorithms Operations research Computing Network performance Computer networking Abstract data types Queue Monitor FIFO Scheduling		Catching the Microburst Culprits with Snappy Xiaoqi Chen Princeton University Add to Reading List Source URL: www.research.att.com Download Document from Source Website File Size: 1,94 MB Share Document on Facebook

	Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling Ioannis Caragiannis1 , Vasilis Gkatzelis2 , and Cosimo Vinci3 1 University of Patras, Rion-Patras, Greece DocID: 1xTKO - View Document
	The Optimal Property of Polynomial Based Diffusion-Like Algorithms in Dynamic Load Balancing Y. F. Hu and R. J. Blake Abstract. Diffusion type algorithms [1, 3, 13] are some of the most popular algorithms for scheduling DocID: 1v2jh - View Document
	Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs Magn´ us M. Halld´orsson ICE-TCS, School of Computer Science, Reykjavik University, Iceland.∗ DocID: 1uQNw - View Document
	Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments? Johannes Maschler, Martin Riedler, and G¨ unther R. Raidl Institute of Computer Graphics and Algorithms, TU Wien, Vienna, Austria { DocID: 1ux0o - View Document
	Evaluating Scheduling Algorithms on Distributed Computational Grids Ryan J. Wisnesky Abstract. This paper presents the results of a simulation study of a heterogeneous computational grid using different scheduling algori DocID: 1upDw - View Document