Predictability for real-time command and control

Abstract

Abstract

The power of SIMDs vs. MIMDs in real-time scheduling

“…The AAS program was canceled in June 1994 after expenditure of several billion dollars [17]. On the other hand, the ability of associative SIMDs to successfully handle the air traffic control problem have been demonstrated [12,17].…”

“…The motivation for this section is the results reported in [12,17] on real-time scheduling for the air traffic control (ATC) problem using an associative SIMD computer. A polynomial time algorithm is given in [12] for the ATC scheduling problem using the ASC model and static scheduling.…”

“…A polynomial time algorithm is given in [12] for the ATC scheduling problem using the ASC model and static scheduling. In contrast, the air traffic control scheduling problem on a multiprocessor and many other similar scheduling problems are either known or believed to be NP-hard.…”

“…In fact, problems similar to this example occur in the air traffic control problem frequently and can be solved efficiently on the ASC model [12,17].…”

“…The scheduling problem becomes intractable in most cases [7]. In contrast with MIMDs, the ASC schedules real-time tasks for air traffic control statically [12,17]. It takes advantage of its synchronous data parallel capabilities and uses predefined precedence to assure enough time to complete worst-case time tasks.…”