Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
暂无分享,去创建一个
[1] Berthold Vöcking,et al. Balanced allocations: the heavily loaded case , 2000, STOC '00.
[2] Marek Karpinski,et al. On-line Load Balancing for Related Machines , 1997, WADS.
[3] David P. Williamson,et al. Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Paul G. Spirakis,et al. The price of selfish routing , 2001, STOC '01.
[5] Gaston H. Gonnet,et al. On the LambertW function , 1996, Adv. Comput. Math..
[6] David P. Williamson,et al. Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[7] Eli Upfal,et al. Balanced allocations (extended abstract) , 1994, STOC '94.
[8] Ramesh K. Sitaraman,et al. The power of two random choices: a survey of tech-niques and results , 2001 .
[9] Joseph Naor,et al. New algorithms for related machines with temporary jobs , 2000 .
[10] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[11] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[12] B. Vocking. How asymmetry helps load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[13] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[14] Gaston H. Gonnet,et al. Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.
[15] M. Habib. Probabilistic methods for algorithmic discrete mathematics , 1998 .
[16] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[17] Martin Raab,et al. "Balls into Bins" - A Simple and Tight Analysis , 1998, RANDOM.
[18] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.