Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Real-time computing with lock-free shared objects
ACM Transactions on Computer Systems (TOCS)
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Functional reactive programming from first principles
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
FVision: A Declarative Language for Visual Tracking
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
A Characterization of Re-execution Costs for Real-Time Abort-Oriented Protocols
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Response Time Analysis of Asynchronous Real-Time Systems
Real-Time Systems
AtomCaml: first-class atomicity via rollback
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Preemptible Atomic Regions for Real-Time Java
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Response time analysis of software transactional memory-based distributed real-time systems
Proceedings of the 2009 ACM symposium on Applied Computing
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Determining actual response time in P-FRP
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Determining Actual Response Time in P-FRP Using Idle-Period Game Board
ISORC '11 Proceedings of the 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing
| Hi-index | 0.00 |
Priority-based Functional Reactive Programming (FRP) is a new declarative approach to modeling and building reactive systems. Preempted tasks in P-FRP are aborted and have to restart when higher priority tasks have completed. Unlike the preemptive model of execution, there is no notion of critical instance in P-FRP. Determination of the actual value of Worst-Case Response Time (WCRT) in P-FRP requires evaluation of an exponential number of release scenarios. Such a 'brute-force' computation is expensive and impractical in several situations. In previous work, researchers have presented a polynomial time algorithm which uses fixed point iteration to compute an approximate upper bound on response time. However, this algorithm fails to converge for several task sets and hence is quite limited in use. In this paper, we present a more robust algorithm that computes response time bounds of P-FRP tasks and guarantees a result for all task sets. Experimental results using synthetic task sets of different sizes have also been presented.