This Article 
 Bibliographic References 
 Add to: 
Component-Oriented Radars with Probabilistic Timing Guarantees
July 2006 (vol. 17 no. 7)
pp. 723-735

Abstract—In recent years, many modern phased-array radars are built with commercial off-the-shelf components, and the functions of many hardware components are also reimplemented by software modules. In such systems, radar tasks could be modeled as distributed real-time tasks which require end-to-end deadline guarantees and have precedence constraints. Different from most previous work on either algorithms with restrictions in resource utilization or heuristics without analytical ways for schedulability guarantees, the objective of this paper is to propose a joint real-time scheduling algorithm for both transmitter/receiver and signal processor workloads with an analytical framework for offline probabilistic analysis and online admission control. The strength of our approach is verified by analysis results and a series of experiments based on a real phased-array radar for air defense frigates [CHECK END OF SENTENCE].

[1] L. Abeni and G. Butazzo, “QoS Guarantee Using Probabilistic Deadlines,” Proc. IEEE Euromicro Conf. Real-Time Systems, pp. 242-249, June 1999.
[2] L. Abeni and G. Buttazzo, “Integrating Multimedia Applications in Hard Real-Time Systems,” Proc. 18th IEEE Real Time Systems Symp., pp. 4-13, Dec. 1998.
[3] T.P. Baker, “Multiprocessor EDF and Deadline Monotonic Schedulability Analysis,” Proc. 24th IEEE Real-Time Systems Symp., pp. 120-129, Dec. 2003.
[4] A. Barbato and P. Giustiniani, “An Improved Scheduling Algorithm for a Naval Phased Array Radar,” Proc. Radar 92 Int'l Conf., pp. 42-45, 1992.
[5] S. Baruah, J. Goossens, and G. Lipari, “Implementing Constant-Bandwidth Servers upon Multiprocessor Platforms,” Proc. Eighth IEEE Real-Time and Embedded Technology and Applications Symp., pp. 154-163, Sept. 2002.
[6] R.A. Baugh, Computer Control of Modern Radars. RCAM&SR-Moorestown Library, 1973.
[7] C. Bergenhem, M. Jonsson, B. Gorden, and A. Ahlander, “Heterogeneous Real-Time Services in High-Performance System Area Networks— Application Demands and Case Study Definitions,“ Technical Report IDE-0254, School of Information Science, Computer and Electrical Eng. (IDE), Halmstad Univ., 2002.
[8] R. Bettati and J.W.-S. Liu, “End-to-End Scheduling to Meet Deadlines in Distributed Systems,” Proc. Second IEEE Int'l Conf. Distributed Computing Systems, pp. 452-459, Dec. 1990.
[9] M. Brahumi and D.J. Worthington, “Queueing Models for Out-patient Appointment Systems— A Case Study,“ J. Operational Research Soc., vol. 42, pp. 733-746, 1991.
[10] C. Chang and T.-C. Wang, “Use Object-Oriented Paradigm to Design a Programmable Radar Digital Signal Processor,” Proc. Workshop Object-Oriented Technology and Applications, 1997.
[11] J.P. Chawla, S.I. Marcus, and M.A. Shayman, “Stability of Wireless Networks for Mode S Radar,” Proc. 32nd Conf. Information Sciences and Systems, 1998.
[12] D. Chen, A.K. Mok, and S.K. Baruah, “Scheduling Distributed Real-Time Tasks in the DGMF Model,” Proc. IEEE Real Time Technology and Applications Symp., pp. 14-22, Mar. 2000.
[13] S.K. Dhall, “Scheduling Periodic-Time-Critical Jobs on Single Processor and Multiprocessor Computing Systems,“ PhD thesis, Univ. of Illinois Urbana, 1977.
[14] S.D. Elton and B.J. Slocumb, “Robust Parameter Estimation for Periodic Point Process Signals Using Circular Statistics,” Proc. Signal Processing VIII, Theories and Applications (EUSIPCO), 1996.
[15] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman & Co., 1979.
[16] R.V. Hogg and E.A. Tanis, Probability and Statistical Inference. Prentice Hall, 2001.
[17] J.A. Hoogeveen, J.K. Lenstra, and B. Veltman, “Preemptive Scheduling in a Two-Stage Multiprocessor Flow Shop Is NP-Hard,” European J. Operational Research, vol. 89, no. 1, pp. 172-175, 1996.
[18] A.G. Huizing and A.A.F. Bloemen, “An Efficient Scheduling Algorithm for a Multifunction Radar,” Proc. IEEE Int'l Radar Conf., pp. 359-364, 1996.
[19] A. Izquierdo-Fuente and J.R. Casar-Corredera, “Approach to Multifunction Radar Scheduling Simulation,” Proc. IEEE Telesystems Conf., pp. 67-70, 1994.
[20] K. Jeffay and S. Goddard, “A Theory of Rate-Based Execution,” Proc. 20th IEEE Real-Time Systems Symp., pp. 304-314, Dec. 1999.
[21] B. Kao and H. Garcia-Molina, “Deadline Assignment in a Distributed Soft Real-Time System,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1268-1274, 1997.
[22] L. Kleinrock, Queueing Systems Volume II: Computer Applications. Wiley-Interscience, 1976.
[23] J.W. Layland, Real-Time System. Prentice Hall, 2000.
[24] C.-G. Lee, P.-S. Kang, C.-S. Shih, and L. Sha, “Radar Dwell Scheduling Considering Physical Characteristics of Phased Array Antenna,” Proc. IEEE 24th Real-Time Systems Symp., pp. 14-24, Dec. 2003.
[25] C.G. Lee, C.S. Shih, and L. Sha, “Service Class-Based Online QoS Management in Surveillance Radar Systems,” Proc. 22nd IEEE Real-Time Systems Symp., pp. 139-150, Dec. 2001.
[26] K.J. Lin, S. Natarajan, and J.W.-S. Liu, “Imprecise Results: Utilizing Partial Computations in Real-Time Systems,” Proc. Eighth IEEE Real-Time Systems Symp., pp. 210-217, Dec. 1987.
[27] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment, J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[28] X. Liu and S. Goddard, “Resource Sharing in an Enhanced Rate-Based Execution Model.,” Proc. 15th Euromicro Conf. Real-Time Systems, pp. 131-140, 2003.
[29] A.K. Mok, “Fundamental Design Problems for the Hard Real-Time Environment,“ PhD thesis, Massachussetts Inst. of Tech nology, 1983.
[30] A.K. Mok and D. Chen, “A Multiframe Model for Real-Time Tasks” IEEE Trans. Software Eng, vol. 23, no. 10, pp. 635-645, Oct. 1997.
[31] R.L. Nevin and F.W. Schatz, “AN/APG-67 Multimode Radar Development,” Proc. IEEE Int'l Radar Conf., pp. 1-8, 1985.
[32] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case,” Proc. IEEE Infocom, pp. 915-924, 1992.
[33] “Rapid Prototyping of Application Specific Signal Processors, (RASSP),”, 2000.
[34] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1175-1185, Sept. 1990.
[35] C.-S. Shih, S. Gopalakrishnan, P. Ganti, M. Caccamo, and L. Sha, “Template-Based Real-Time Dwell Scheduling with Energy Constraint,” Proc. Ninth IEEE Real-Time and Embedded Technology and Applications Symp., May 2003.
[36] J.F. Shortle, P.H. Brill, M.J. Fischer, D. Gross, and D.M.B. Masi, “An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue,” Informs J. Computing, vol. 16, no. 2, pp. 152-161, 2004.
[37] M. Spuri, G. Buttazzo, and F. Sensini, “Scheduling Aperiodic Tasks in Dynamic Scheduling Environment,” Proc. 16th IEEE Real-Time Systems Symp., 1995.
[38] L.H. Su, “A Hybrid Two-Stage Flowshop with Limited Waiting Time Constraints,” Computers and Industrial Eng., vol. 44, no. 3, pp. 409-424, 2003.
[39] E.J. Watson, Laplace Transforms and Applications, 1981.

Index Terms:
Phased-array radar, real-time task scheduling, probabilistic performance guarantee, distributed systems, dwell scheduling.
Chin-Fu Kuo, Ya-Shu Chen, Tei-Wei Kuo, Phone Lin, Cheng Chang, "Component-Oriented Radars with Probabilistic Timing Guarantees," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 723-735, July 2006, doi:10.1109/TPDS.2006.80
Usage of this product signifies your acceptance of the Terms of Use.