Jeff Edmonds
Abstract
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always services the page where the aggregate waiting times of the outstanding requests for that page is maximized. We provide the first non-trivial analysis of the worst case performance of LWF. On the negative side, we show that LWF is not s-speed O(1)-competitive for s < 1+√5/2. On the positive side, we show that LWF is 6-speed O(1)-competitive.
- Acharya, S., and Muthukrishnan, S. 1998. Scheduling on-demand broadcasts: new metrics and algorithms. In MobiCom '98: Proceedings of the 4th annual ACM/IEEE International Conference on Mobile Computing and Networking. ACM, New York, 43--54. Google Scholar
Digital Library
- Aksoy, D., and Franklin, M. J. 1998. Scheduling for large-scale on-demand data broadcasting. In INFOCOM. 651--659.Google Scholar
- Ammar, M. H., and Wong, J. W. 1985. The design of teletext broadcast cycles. Perform. Eval. 5, 4, 235--242.Google ScholarCross Ref
- Bansal, N., Charikar, M., Khanna, S., and Naor, J. S.2005. Approximating the average response time in broadcast scheduling. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. ACM, New York. 215--221. Google ScholarDigital Library
- Bartal, Y., and Muthukrishnan, S. 2000. Minimizing maximum response time in scheduling broadcasts. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 558--559. Google ScholarDigital Library
- Chrysanthis, P., Liberatore, V., and Pruhs, K. 2002. Middleware support for multicast-based data dissemination: A working reality. In Proceedings of the IEEE Workshop on Reliable Dependable Systems. IEEE Computer Society Press, Los Alamitos, Calif.Google Scholar
- DirecPC website http://www.direcpc.com.Google Scholar
- Dykeman, H., Ammar, M., and Wong, J. 1986. Scheduling algorithms for videotex systems under broadcast delivery. In Proceedings of the IEEE International Conference on Communications (Toronto, Canada). 1847--1851.Google Scholar
- Edmonds, J. 1999. Scheduling in the dark. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 179--188. Google ScholarDigital Library
- Edmonds, J., and Pruhs, K. 2003. Multicast pull scheduling: When fairness is fine. Algorithmica 36, 3, 315--330.Google ScholarDigital Library
- Erlebach, T., and Hall, A. 2004. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. J. Scheduling 7, 3, 223--241. Google ScholarDigital Library
- Gandhi, R., Khuller, S., Kim, Y. A., and Wan, Y.-C. J. 2004. Algorithms for minimizing response time in broadcast scheduling. Algorithmica 38, 4, 597--608. Google ScholarDigital Library
- Gandhi, R., Khuller, S., Parthasarathy, S., and Srinivasan, A. 2002. Dependent rounding in bipartite graphs. In Proceedings of the Symposium on Foundations of Computer Science (Washington, D.C.). IEEE Computer Society Press, Los Alamitos, Calif., 323--332. Google ScholarDigital Library
- Hall, A., and Täubig, H. 2003. Comparing push- and pull-based broadcasting. In Proceedings of the International Workshop on Experimental and Efficient Algorithms (WEA'03). Lecture Notes in Computer Science, vol. 2647. Springer-Verlag, New York, 148--164. Google ScholarDigital Library
- Kalyanasundaram, B., and Pruhs, K. 2000. Speed is as powerful as clairvoyance. J. ACM 47, 4, 617--643. Google ScholarDigital Library
- Kalyanasundaram, B., Pruhs, K., and Velauthapillai, M. 2000. Scheduling broadcasts in wireless networks. J. Scheduling 4, 6, 339--354.Google ScholarCross Ref
- Kaplan, H., Tarjan, R. E., and Tsioutsiouliklis, K. 2001. Faster kinetic heaps and their use in broadcast scheduling. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 836--844. Google ScholarDigital Library
- Kenyon, C., Schabanel, N., and Young, N. 2000. Polynomial-time approximation schemes for data broadcast. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 659--666. Google ScholarDigital Library
- Phillips, C. A., Stein, C., Torng, E., and Wein, J. 2002. Optimal time-critical scheduling via resource augmentation. Algorithmica 32, 2, 163--200.Google ScholarDigital Library
- Pruhs, K., Sgall, J., and Torng, E. 2004. Online scheduling. In Handbook of Scheduling: Algorithms, Models and Performance Analysis, J. Leung and J. Anderson, Eds. CRC press.Google Scholar
- Pruhs, K., and Uthaisombut, P. 2005. A comparison of multicast pull models. Algorithmica 42, 3-4, 289--307.Google ScholarDigital Library
- Wong, M. 1988. Broadcast delivery. In Proceedigns of the IEEE, vol. 76, no. 12, 1566--1577.Google ScholarCross Ref
- Xu, J., Lee, D. L., Hu, Q., and Lee, W. 2002. Data broadcast. In Handbook of Wireless Networks and Mobile Computing, I. Stojmenovic, Ed. Wiley, New York, 243--265. Google ScholarDigital Library
Index Terms
- A maiden analysis of longest wait first
Recommendations
SRPT optimally utilizes faster machines to minimize flow time
We analyze the shortest remaining processing time (SRPT) algorithm with respect to the problem of scheduling n jobs with release times on m identical machines to minimize total flow time. It is known that SRPT is optimal if m = 1 but that SRPT has a ...
Optimal on-line flow time with resource augmentation
Special issue: Efficient algorithmsWe study the problem of scheduling n jobs that arrive over time. We consider a non-preemptive setting on a single machine. The goal is to minimize the total flow time. We use extra resource competitive analysis: an optimal off-line algorithm which ...
Multicast Pull Scheduling: When Fairness Is Fine
We investigate server scheduling policies to minimize average user perceived latency in pull-based client-server systems (systems where multiple clients request data from a server) where the server answers requests on a multicast/ broadcast channel. We ...
Comments