DESIGN OF LOW-PASS LADDER NETWORKS WITH MIXED LUMPED AND DISTRIBUTED ELEMENTS BY MEANS OF ARTIFICIAL NEURAL NETWORKS

In this study, we investigate different scheduling algorithms, and compare their performance for systems with multiple priority queues. The scheduler defined in this paper may be thought as the preprocessor in an ATM switch, a network processor in a router or just an ordinary CPU scheduler where multiple processes with different priorities are present in the system. We show that the proposed algorithm outperforms the known scheduling algorithms from the point of balancing the average response times.