Real-time database scheduling simplicity

A different paradigm for the field of real-time data processing for command and control (C&C) is needed. Using multiprocessors (MP) all past approaches for real-time database computing have proven intractable whenever the problem requirements have exceeded simple cases. We review reasons why the MP architecture is considered intractable, and then show a simpler architecture where these reasons for intractability are non-existent. We present a solution in terms of a static, non-preemptive schedule using a processor; we designate an associative processor (AP). The AP, a set processor, uses a single thread instruction stream that can operate on an entire set of data with each instruction. The AP eliminates concurrent processes, the nemesis of multiprocessing, and a real-time C&C problem is shown to be schedulable in polynomial time.