Advertisement

Determining Actual Response Time in P-FRP

  • Chaitanya Belwal
  • Albert M. K. Cheng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6539)

Abstract

A purely functional model of computation, called Priority-based Functional Reactive Programming (P-FRP), has been introduced as a new paradigm for building real-time software. Unlike the classical preemptive model of real-time systems, preempted events in P-FRP are aborted and have to restart when higher priority events have completed, making the response time of events dependent on the execution pattern of higher priority events. Though methods to determine approximate values for the response time of P-FRP events have been presented, no convenient method has yet been established to determine actual response time. A common method for computing actual response time in the preemptive model does not give guaranteed results in P-FRP. A simulation based approach is computationally expensive and not feasible in most practical situations. We show that an exhaustive enumeration technique for idle periods is a more efficient technique, and can be easily adopted to determine actual response time in P-FRP.

Keywords

real-time systems embedded systems response time schedulability analysis functional programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson, J.H., Ramamurthy, S., Jeffay, K.: Real-time computing with Lock-free Shared Objects. ACM Transactions on Comp. Sys. 5(6), 388–395 (1997)Google Scholar
  2. 2.
    Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8(5), 284–292 (1993)CrossRefGoogle Scholar
  3. 3.
    Belwal, C., Cheng, A.M.K.: Determining Actual Response Time in P-FRP. Technical Report: UH-CS-10-05, Dept. Of Computer Science, University of Houston (2010)Google Scholar
  4. 4.
    Bini, E., Baruah, S.K.: Efficient Computation of Response Time Bounds under Fixed-priority Scheduling. In: Proc. of the 15th Conference on Real-Time and Network Systems, pp. 95–104 (2007)Google Scholar
  5. 5.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Red-Black Trees. In: Introduction to Algorithms, 2nd edn., ch. 13, pp. 273–301. MIT Press/McGraw-Hill (2001)Google Scholar
  6. 6.
    Davis, R.I., Burns, A.: Response Time Upper Bounds for Fixed Priority Real-Time Systems. In: RTSS 2008, pp. 407–418 (2008)Google Scholar
  7. 7.
    Elliott, C., Hudak, P.: Functional reactive animation. In: ICFP 1997, pp. 263–273 (1997)Google Scholar
  8. 8.
    Fahmy, S.F., Ravindran, B., Jensen, E.D.: Response time analysis of software transactional memory-based distributed real-time systems. ACM SAC Operating Systems (2009)Google Scholar
  9. 9.
    Hammond, K.: Chapter 1 – Is it Time for Real-Time Functional Programming. In: Gilmore, S. (ed.) Trends in Functional Programming, vol. 4. Intellect Ltd. (2005)Google Scholar
  10. 10.
  11. 11.
    Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. ACM SIGARCH Computer Architecture New 21(2), 289–300 (1993)CrossRefGoogle Scholar
  12. 12.
    Joseph, M., Pandya, P.: Finding Response Times in a Real-Time System. BCS Computer Journal 29(5), 390–395 (1986)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kaiabachev, R., Taha, W., Zhu, A.: E-FRP with Priorities. In: EMSOFT 2007, pp. 221–230 (2007)Google Scholar
  14. 14.
    Liu, C.L., Layland, L.W.: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Peterson, J., Hager, G.D., Hudak, P.: A Language for Declarative Robotic Programming. In: ICRA 1999. IEEE, Los Alamitos (1999)Google Scholar
  16. 16.
    Peterson, J., Hudak, P., Reid, A., Hager, G.D.: FVision: A Declarative Language for Visual Tracking. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, p. 304. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  17. 17.
    Ras, J., Cheng, A.: Response Time Analysis for the Abort-and-Restart Task Handlers of the Priority-Based Functional Reactive Programming (P-FRP) Paradigm. In: RTCSA 2009 (2009)Google Scholar
  18. 18.
    Sha, L., Rajkumar, R., Lehoczky, J.P.: Priority Inheritance Protocols: An approach to Real Time Synchronization. Transactions on Computers 39(9), 1175–1185 (1990)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Swaine, M.: It’s Time to Get Good at Functional Programming. Dr. Dobbs Journal (December 2008), http://www.drdobbs.com
  20. 20.
    Wan, Z., Taha, W., Hudak, P.: Real - time FRP. In: ICFP 2001, pp. 146–156. ACM Press, New York (2001)Google Scholar
  21. 21.
    Wan, Z., Taha, W., Hudak, P.: Task Driven FRP. In: Adsul, B., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol. 2257, p. 155. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  22. 22.
    Wan, Z., Hudak, P.: Functional reactive programming from first principles. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 242–252 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chaitanya Belwal
    • 1
  • Albert M. K. Cheng
    • 1
  1. 1.Department of Computer ScienceUniversity of HoustonUSA

Personalised recommendations