Abstract
In Universal Mobile Telecommunications Systems radio access, information packets of different services and users are sent across the air interface organized into radio frames. A radio frame is divided into a fixed number of time slots, different packets can share the same time slot and exactly one slot must be assigned to each packet. The packets of different services have divisible sizes and the slot capacity is limited. Quality of Service requirements set time intervals within which each packet must be scheduled. In this work, we address the problem of scheduling packets related to two different services to the time slots of a radio frame. The problem is a variant of the High-Multiplicity Multiprocessor Scheduling Problem in which there are two classes of jobs with divisible sizes, and the jobs must satisfy assignment restrictions. Two polynomial—time scheduling algorithms, maximizing the number of scheduled packets, and the weighted throughput, are provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adachi, F., M. Sawahashi, and K. Okawa, “Tree Structured Generation of Orthogonal Spreading Codes with Different Lengths for Forward Link of DS-CDMA Mobile,” Electronic Letters, 33(1), 27–28 (1997).
Aerts, J., J. Korst, and F. Spieksma, “Approximation of a retrieval problem for parallel disks,” in Proceedings of the 5-th CIAC Conference, Rome, 2003.
Agnetis, A., G. Brogi, G. Ciaschetti, P. Detti, and G. Giambene, “Optimal Packet Scheduling in UTRA-TDD,” IEEE Communications Letters, 7(3), 112–114 (2003).
Coffman, E. G., M. R. Garey, and D. S. Johnson, “Bin Packing with Divisible Item Sizes,” Journal on Complexity, 3(4), 406–428 (1987).
Holma, H. and A. Toskala, WCDMA for UMTS, John Wiley & Sons, Chichester, England, 2000.
Hochbaum, D. and R. Shamir, “Strongly polynomial algorithms for the high multiplicity scheduling problem,” Operations Research, 39(4), 648–653 (1991).
Huang, V. and W. Zhuang, “Optimal Resource Management in Packet-Switching TDD CDMA Systems,” IEEE Personal Communications, 2000.
Leung, J. Y.-T., “On scheduling independent tasks with restricted execution times,” Operations Research, 30(1), 163–171 (1982).
McCormick, S. T., S. R. Smallwood, and F. C. R. Spieksma, “A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths,” Mathematics of Operations Research, 26(1), 31–49 (2001).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Detti, P., Agnetis, A. & Ciaschetti, G. Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. J Sched 8, 255–273 (2005). https://doi.org/10.1007/s10951-005-6814-0
Issue Date:
DOI: https://doi.org/10.1007/s10951-005-6814-0