This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Quantization of Periodic Task Requests on Multiple Identical Processors
August 2003 (vol. 14 no. 8)
pp. 795-806

Abstract—We simplify the periodic tasks scheduling problem by making a trade off between processor load and computational complexity. A set \big. N\bigr. of periodic tasks, each characterized by its density \big. \rho _i\bigr., contains \big. n\bigr. possibly unique values of \big. \rho _{i}\bigr.. We transform \big. N\bigr. through a process called quantization, in which each \big. \rho _{i}\in_{ } N\bigr. is mapped onto a service level \big. s_{j}\in_{ } L\bigr., where \big. \left|L\right|=l\ll n\bigr. and \big. \rho _{i}\leq s_{j}\bigr. (this second condition differentiates this problem from the p-median problem on the real line). We define the Periodic Task Quantization problem with Deterministic input (PTQ-D) and present an optimal polynomial time dynamic programming solution. We also introduce the problem PTQ-S (with Stochastic input) and present an optimal solution. We examine, in a simulation study, the trade off penalty of excess processor load needed to service the set of quantized tasks over the original set, and find that, through quantization onto as few as 15 or 20 service levels, no more than 5 percent processor load is required above the amount requested. Finally, we demonstrate that the scheduling of a set of periodic tasks is greatly simplified through quantization and we present a fast online algorithm that schedules quantized periodic tasks.

[1] J.H. Anderson and A. Srinivasan, A New Look at Pfair Priorities technical report, Univ. of North Carolina, Sept. 1999.
[2] J.H. Anderson and A. Srinivasan, Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks J. Computer and System Sciences, 2001.
[3] S.K. Baruah, N.K. Cohen, C.G. Plaxton, and D.A. Varvel, Proportionate Progress: A Notion of Fairness in Resource Allocation Algorithmica, vol. 15, no. 6, pp. 600-625, 1996.
[4] S. Baruah, J. Gehrke, and G. Plaxton, "Fast Scheduling of Periodic Tasks on Multiple Resources," Proc. Ninth Int'l Parallel Processing Symp., pp. 280-288. IEEE CS Press, Apr. 1995. Extended version available via anonymous ftp fromas Technical Report TR-95-02.
[5] M.L. Dertouzos and A.K. Mok, Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks IEEE Trans. Software Eng., vol. 15, no. 12, pp. 1497-1505, 1989.
[6] I. Dhillon, A New Algorithm for the Symmetric Tridiagonal Eigenvalue-Eigenvector Problem PhD thesis, Univ. of California, Berkeley, 1997.
[7] R. Hassin and A. Tamir, Improved Complexity Bounds for Location Problems on the Real Line Operations Research Letters, vol. 10, pp. 395-402, 1991.
[8] L.E. Jackson and G.N. Rouskas, Optimal Quantization of Periodic Task Requests on Multiple Identical Processors technical report, North Carolina State Univ., Jan. 2002.
[9] C. Lea and A. Alyatama, Bandwidth Quantization and States Reduction in the Broadband ISDN IEEE/ACM Trans. Networking, vol. 3, pp. 352-360, June 1995.

Index Terms:
Multiprocessor scheduling, periodic tasks scheduling, quantization.
Citation:
Laura E. Jackson, George N. Rouskas, "Optimal Quantization of Periodic Task Requests on Multiple Identical Processors," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 8, pp. 795-806, Aug. 2003, doi:10.1109/TPDS.2003.1225058
Usage of this product signifies your acceptance of the Terms of Use.