Abstract

The relevance of the topic of this work is the strong growth of multiprocessor systems, for which it is important to solve a large volume of tasks in a minimum time. There are various algorithms for solving such a problem, which can be divided into classes of exact and approximate. The representative of approximate algorithms is the algorithm of the Goldberg model, which gives acceptable results, the modifications of the crossovers of which are studied in this paper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call