Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
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
FVision: A Declarative Language for Visual Tracking
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Priority assignment in real-time active databases
The VLDB Journal — The International Journal on Very Large Data Bases
Real-time computing with lock-free shared objects
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
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
An Extensible Framework for Real-Time Task Generation and Simulation
RTCSA '11 Proceedings of the 2011 IEEE17th International Conference on Embedded and Real-Time Computing Systems and Applications - Volume 01
Schedulability Analysis of Transactions in Software Transactional Memory Using Timed Automata
TRUSTCOM '11 Proceedings of the 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications
Time petri nets for schedulability analysis of the transactional event handlers of P-FRP
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Worst case response time for real-time software transactional memory
Proceedings of the 2012 ACM Research in Applied Computation Symposium
| Hi-index | 0.00 |
Priority-based Functional Reactive Programming (P-FRP) is a new functional programming formalism for real-time systems. P-FRP allows static priority assignment and guarantees real-time response by preempting lower priority tasks. Due to the state-less nature, preempted tasks are aborted and restarted after higher priority tasks have completed execution. Therefore, the rate-monotonic (RM) priority assignment is not optimal in P-FRP, and it has been unknown whether an optimal fixed priority assignment can even exist for such an execution model. In this paper, we first present the priority assignment characteristics of P-FRP. We then discuss the priority assignment in a task set with two tasks. We derive the conditions when the RM priority assignment is optimal and show that at least one of RM or utilization-monotonic (UM) is the optimal for the task set with two tasks. We prove the optimal priority assignment for a general P-FRP system having more than two tasks exists when the period of the task is a multiple of others. Experimental results using task sets of different sizes are also presented.