Background PJM Dynamic Transfer Business Rules for Generators The NERC Glossary of Terms [i] defines a Dynamic Transfer as the provision of the

engineering, energy accounting (including inadvertent interchange), and administration required to electronically move all or a portion of the real energy services associated with a generator out of one Balancing Authority (BA) Area into another. Dynamic Transfers includes both Dynamic Schedules and Pseudo Ties, which are further defined below. The NERC Glossary of Terms [i] defines a Dynamic Interchange Schedule or Dynamic Schedule as a telemetered reading or value that is updated in real-time and used as a schedule in the Area Control Error (“ACE”) equation and the integrated value of which is treated as a schedule for interchange accounting purposes. Dynamic Interchange Schedules or Dynamic Schedules are commonly used for scheduling jointly owned generation to or from another Balancing Authority Area. The NERC Glossary of Terms [i] defines a Pseudo Tie as a telemetered reading or value that is updated in real-time and used as a “virtual ” tie line flow in the AGC/ACE equation but for which no physical tie or energy metering actually exists. The integrated value is used as a metered MWh value for interchange accounting purposes

Timed Multitasking for Real-Time Embedded Software

this article, we introduce an event-triggered programming model -- timed multitasking (TM), which also takes a time-centric approach to real-time programming but controls timing properties through deadlines and events rather than time triggers. By doing so, each piece of information is processed exactly once, and the tasks can be aperiodic. This model takes advantage of an actor-oriented software architecture [3] and embraces timing properties at design time, so that designers can specify when the computational results are produced to the physical world or to other actors. The specification is then compiled into stylized real-time tasks, and a run-time sys- tem further ensures the function and timing determinism during execution. As long as there are sufficient resources, the computation will always produce predictable values at a predictable tim