潮流计算中的数学方法——牛顿—拉夫逊法

本文介绍了一种解非线性代数方程组的数学方法——牛顿-拉夫逊法,并将其应用于电力系统潮流计算中。采用本文方法的计算结果表明该教学方法在电力系统潮流问题中是收敛的;同时计算结果与电力专业软件的计算结果保持了一致,从而验证了结果的正确性。     

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.