Neural scheduler for real-time networks

Abstract

Scheduling problem for real-time systems is known to be intractable, i.e. NP-hard or completely NP for most cases. A neural computation technique is introduced to solve it within a limited time under a hard real-time environment. Although the neural computation can be effectively carried out by a multiprocessor, a special processor is designed to obtain the scheduled result with no overhead.<>