A different approach for real-time Command and Control problems is presented, using the Air Traffic Control problem as an example.  Current ATC approaches use “dynamic” scheduling algorithms, which by their very nature are unpredictable.  The current ATC approach is extremely expensive. The April 19, 1999 issue of USA Today places the cost at $41 billion, and the system is not meeting current specifications. The current problems with ATC are predicted by theoretical results in Real-Time Scheduling.  M. Klein et al state “an efficient real-time multiprocessor scheduling algorithm is not expected” [1].  J. Stankovic, [5] indicates that a polynomial time multiprocessor schedule for a C&C problem like ATC is unlikely. Our approach uses synchronous set processing of jobs in this real-time database problem and embodies the qualities of speed, predictability, adaptability and reliability.  We show that an associative SIMD processor (AP) using synchronous set processing can complete all ATC tasks before their deadline.