Dispatching in perfectly-periodic schedules

Journal of Algorithms

Volumn 49, Issue 2, 2003, Pages 219-239

  Brakerski, Zvika ^a   Dreizin, Vladimir ^a   Patt Shamir, Boaz ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC POWER UTILIZATION; ENERGY EFFICIENCY; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIALS; TREES (MATHEMATICS);

LINEAR TIME COMPLEXITY; PERFECTLY-PERIODIC SCHEDULES;

ALGORITHMS;

EID: 0242539978     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00089-0     Document Type: Article

References (19)

1. S. Acharya. R. Alonso, M. Franklin, S. Zdonik, Broadcast disks: Data management for asymmetric communications environments, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995, pp. 199-210.
2. M.H. Ammar, J.W. Wong, The design of teletext broadcast cycles, Performance Evaluation 5 (4) (1985) 235-242.
3. M.H. Ammar, J.W. Wong, On the optimality of cyclic transmission in teletext systems, IEEE Trans. Commun. 35(1)(1987)68-73.
4. S. Anily, C.A. Glass, R. Hassin, The scheduling of maintenance service, Discrete Appl. Math. 80 (1998) 27-42.
5. A. Bar-Noy, R. Bhatia, J.S. Naor, B. Schieber, Minimizing service and operation cost of periodic scheduling, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 11-20.
6. A. Bar-Noy, A. Nisgav, B. Patt-Shamir, Nearly optimal perfectly-periodic schedules, Distributed Computing 15 (4) (2002) 207-220.
7. A. Bar-Noy, B. Patt-Shamir, I. Ziper, Broadcast disks with polynomial cost functions, in: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '00), Vol. 2, 2000, pp. 575-584.
8. S.K. Baruah, N.K. Cohen, C.G. Plaxton, D.A. Varvel, Proportionate progress: A notion of fairness in resourse allocation, Algorithmica 15 (1996) 600-625.
9. Bluetooth technical specifications, version 1.1., Available from http://www.bluetooth.com/, February 2001.
10. T.M. Cover, J.A. Thomas, Elements of Information Theory, Wiley-Interscience, New York, 1991.
11. V. Dreizin, Efficient periodic scheduling by trees. Master's thesis, Department of Electrical Engineering, Tel Aviv University, 2001, available from http://www.eng.tau.ac.il/̃vld/Th.html.
12. C. Kenyon, N. Schabanel, N. Young, Polynomial-time approximation scheme for data broadcast, in: Proceeding of the 32th Annual ACM Symposium on Theory of Computing (STOC-00), 2000, pp. 659-666.
13. S. Khanna, S. Zhou, On indexed data broadcast, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), New York, 1998, pp. 463-472.
14. C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, J. ACM 20 (1) (1973) 46-61.
15. C.J. Su, L. Tassiulas, Broadcast scheduling for information distribution, in: Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '97), Vol. 1. 1997, pp. 109-117.
16. R. Tijdeman, The chairman assignment problem, Discrete Math. 32 (1980) 323-330.
17. N. Vaidya, S. Hameed, Data broadcast: On-line and off-line algorithms, Technical Report 96-017, Department of Computer Science, Texas A&M University, 1996.
18. N. Vaidya, S. Hameed. Log time algorithms for scheduling single and multiple channel data broadcast, in: Proceedings of the 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM '97), 1997, pp. 90-99.
19. W. Wei, C. Liu, On a periodic maintenance problem, Oper. Res. Lett. 2 (1983) 90-93.