Scheduling space-sharing for internet advertising

Journal of Scheduling

Volumn 5, Issue 2, 2002, Pages 103-119

  Adler, Micah ^a   Gibbons, Phillip B ^b   Matias, Yossi ^c  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bin packing; Internet advertising; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTERNET; MARKETING;

BIN PACKING PROBLEM; SPACE-SHARING;

SCHEDULING;

EID: 0242606641     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.74     Document Type: Article

References (19)

1. Homepage of DoubleClick. See: http://www.doubleclick.net, 1998.
2. Homepage of NetGravity. See: http://www.netgravity.com, 1998.
3. Homepage of W3.COM. See: http://www.w3.com/home, 1998.
4. Coffman E, Garey M, Johnson D. Bin packing with divisible item sizes. Journal of Complexity 1987; 3: 406-428.
5. Baker B, Coffman E, Rivest R. Orthogonal packings in two dimensions. SIAM Journal of Computing 1980; 9(4):846-855.
6. Coffman E, Garey M, Johnson D, Tarjan R. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing 1980; 9:808-826.
7. Baker B, Schwarz J. Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing 1983; 12(3):508-525.
8. Chakrabarti S, Muthukrishnan S. Resource scheduling for parallel database and scientific applications. In Proceedings of the Eighth ACM Symposium on Parallel Algorithms and Architectures June 1996; 329-335.
9. Garey M, Graham R. Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing 1975; 4(2):187-200.
10. Feldmann A, Kao M, Sgall J, Teng S. Optimal online scheduling of parallel jobs with dependencies. In Proceedings of the 25th ACM Symposium on the Theory of Computing 1993; 642-651.
11. Hall L, Shmoys D, Wein J. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms 1996; 142-151.
12. Ludwig W, Tiwari P. Scheduling malleable and nonmalleable parallel tasks. In Proceedings of the Fifth ACM-SIAM Symposium on Discrete Algorithms 1994; 167-176.
13. Shmoys D, Wein J, Williamson D. Scheduling parallel machines online. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science 1991; 131-140.
14. Turek J, Schwiegelshohn U, Wolf J, Yu P. Scheduling parallel tasks to minimize average response time. In Proceedings of the Fifth ACM-SIAM Symposium on Discrete Algorithms 1994; 112-121.
15. Turek J, Wolf J, Yu P. Approximate algorithms for scheduling parallelizable tasks. In Proceeding of the Fourth ACM Symposium on Parallel Algorithms and Architectures, 1992; 323-332.
16. Schwiegelshohn U. Preemptive weighted completion time scheduling of parallel jobs. Proceedings of ESA 96, Lecture Notes in Computer Science 1996; 1136:39-51.
17. Bellcore. Adapt/x advertiser(tm) product overview. See http://www.bellcore.com/ADAPTX/ADVERTISER/index. htm, 1998.
18. Kenyon C, Rabani Y, Sinclair A. Biased random walks, lyapunov functions, and stochastic analysis of best fit bin packing. Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms 1996; 351-358.
19. Homepage of PointCast. See: http://www.pointcast.com, 1998.