Skip to main content
Log in

An integrated DBP for streams with (m, k)-firm real-time guarantee

  • Systems Science & Engineering
  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

(m,k)-firm real-time or weakly hard real-time (WHRT) guarantee is becoming attractive as it closes the gap between hard and soft (or probabilistic) real-time guarantee, and enables finer granularity of real-time QoS through adjustingm andk. For multiple streams with (m, k)-firm constraint sharing a single server, an, on-line priority assignment policy based on the most recentk-length history of each stream called distance based priority (DBP) has been proposed to assign priority. In case of priority equality among these head-of-queue instances, Earliest Deadline First (EDF) is used. Under the context of WHRT schedule theory, DBP is the most popular, gets much attention and has many applications due to its straightforward priority assignment policy and easy implementation. However, DBP combined with EDF cannot always provide good performance, mainly because the initial, DBP does not underline the rich information on deadline met/missed distribution, specially streams in various failure states which will travel different distances to restore success states. Considering how to effectively restore the success state of each individual stream from a failure state, an integrated DBP utilizing deadline met/missed distribution is proposed in this paper. Simulation results validated the performance improvement of this proposal.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Atiquzzaman, M., Hassan, M., 2001. Guest editorial: Adaptive real-time multimedia transmission over packet switching networks.Real-Time Imaging,7(3): 219–220.

    Article  Google Scholar 

  • Bernat, G., Burns, A., 2001. Weakly hard real-time systems.IEEE Transactions on Computers,50(4):308–321.

    Article  MathSciNet  MATH  Google Scholar 

  • Bernat, G., Cayssials, R., 2001. Guaranteed On-Line weakly Hard Real-Time Systems. Proceedings of IEEE Conference on Real-Time Systems, p.25–35.

  • Giorgio, C.B., 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Application. Kluwer Academic Publisher.

  • Chou, C.C., Shin, K.G., 1997. Statistical real-time channels on multi-access bus networks.IEEE Transaction on Parallel and Distributed Systems,7(8):769–780.

    Article  Google Scholar 

  • Cruz, R.L., 1991. A calculus for network delay, Part I.IEEE Transactions on Information Theory,37(1):114–131.

    Article  MathSciNet  MATH  Google Scholar 

  • Hamdaoui, M., Ramanathan, P., 1995. A dynamic priority assignment technique for streams with (m, k)-firm deadlines.IEEE Transactions on Computers,44(4): 1443–1451.

    Article  MATH  Google Scholar 

  • Hamdaoui, M., Ramanathan, P., 1997. Evaluating dynamic failure probability for streams with (m, k)-firm deadline.IEEE Transactions on Computers,46(12):1325–1337.

    Article  MathSciNet  Google Scholar 

  • Koren, G., Shasha, D., 1995. Skip-over: Algorithms and Complexity for Overloaded Systems that Allow Skips. Proceedings of Real-Time Systems Symposium, p. 110–117.

  • Kuo, T.W., Mok, A.K., 1991. Load Adjustment in Adaptive Real-time. Proceedings of 12th IEEE Real-Time System Symposium, p. 160–170.

  • Lee, C., Rajkumar, R., Mercer, C., 1996. Experiences with Processor Reservation and Dynamic QoS in Real-Time. Proceedings of Multimedia.

  • Lehoczky, J.P., 1990. Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines. Proceedings of IEEE Real-Time Systems Symposium, p. 201–209.

  • Lindsay, W., Ramanathan, P., 1997. DBP-M, A Technique for Meeting End-to-end (m, k)-Firm Guarantee Requirements in Point-to-point Networks. Proceedings of IEEE Conference on Local Networks, p. 294–303.

  • Nagarajan, R., Kurose, J., Towsley, D., 1994. Finite-horizon statistical quality of service measure for high-speed networks.Journal of High Speed Network,3(4):351–373.

    Article  Google Scholar 

  • Nakajima, T., 1998. Resource Reservation for Adaptive QoS Mapping in Real-time Mach. Proceedings of 6th International Workshop on Parallel and Distributed Real-time System.

  • Poggi, E.M., Song, Y.Q., Koubâa, A., Wang, Z., 2003. Matrix-DBP for (m, k)-firm Real-time Guarantee. Proceedings of Real-Time and Embedded System, Paris, France, p.457–482.

  • Quan, G., Hu, X., 2000. Enhanced Fixed-priority Scheduling with (m, k)-firm Guarantee. Proceedings of IEEE Real-Time Systems Symposium, p. 79–88.

  • Ramamritham, K., 1996. Where do time constraints come from and where do they go?International Journal of Database Management,7(2):4–10.

    Google Scholar 

  • Ramanathan, P., 1999. Overload management in real-time control applications using (m, k)-firm guarantee.IEEE Transactions on Parallel and Distributed Systems,10(6):549–559.

    Article  Google Scholar 

  • Rom, R., Sidi, M., 1990. Multiple Access Protocols Performance and Analysis. Springer-Verlag, New York.

    Book  MATH  Google Scholar 

  • Song, Y.Q., Koubâa, A., Simonot, F., 2002. Switched Ethernet for Real-time Industrial Communication: Modelling and Message Buffering Delay Evaluation. Proceedings of 4th IEEE WFCS, p.27–30.

  • Song, Y.Q., 2003. Gestion Dynamique de la QdS Temps-réel Selon (m, k)-firm. Report in Ecole Temps Réel, Toulouse, France, ETR’03.

  • Striegel, A., Manimaran, G., 2000. Best-effort scheduling of (m, k)-firm real-time streams in multihop networks.Computer Communications,23(13):1292–1300.

    Article  Google Scholar 

  • Striegel, A., Manimaran, G., 2002. Packet scheduling with delay and loss differentiation.Computer Communications,25(1):21–31.

    Article  Google Scholar 

  • Striegel, A., Manimaran, G., 2003. Dynamic class-based queue banagement for scalable media servers.Journal of Systems & Software,66:119–128.

    Article  Google Scholar 

  • Takagi, H., 1990. Queuing Analysis of Polling System: An Update in Stochastic Analysis of Computer and Communication System. Elsevier Science North Holland, Amsterdam, p.267–318.

    Google Scholar 

  • Wang, Z., Song, Y.Q., Poggi, E.M., Sun, Y.X., 2002. Survey of Weakly Hard Real-time Schedule Theory and its Application. Proceedings of International Symposium on Distributed Computing and Applications to Business, Engineering and Science, p.429–437.

  • West, R., Schwan, K., Poellabauer, C., 1999. Scalable Scheduling Support for Loss and Delay Constrained Media Streams. Proceedings of IEEE Real-Time Technology and Applications Symposium.

  • West, R., Poellabauer, C., 2000. Analysis of A Window-con-strained Scheduler for Real-time and Best-effort Packet streams. Proceeding of 21st IEEE Real-Time Systems.

  • Zhang, Z.L., Nelakuditi, S., Aggarwal, R., Tsang, R.P., 2001. Efficient selective frame discard algorithms for stored video delivery across resource constrained networks.Real-Time Imaging,7(3):255–273.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhi Wang.

Additional information

Project supported by the National Natural Science Foundation of China (No.60203030) and Advanced Research Program of France-China (Nos. PRA S101-04, PRA S103-02)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Z., Chen, Jm. & Sun, Yx. An integrated DBP for streams with (m, k)-firm real-time guarantee. J. Zhejiang Univ. Sci. A 5, 816–826 (2004). https://doi.org/10.1631/jzus.2004.0816

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.2004.0816

Key words

Document code

CLC number

Navigation