Hybrid Algorithm for Multiprocessor Scheduling with Makespan Minimization and Constraint on Interprocessor Data Exchange

Авторы: Balashov Vasily, Kostenko Valery, Fedorenko Ilya, Savitsky Ilya, Sun Chumin, Gao Jiexing, Li Zhou, Sun Jie
Сборник: 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)
Год издания: 2023
Место издания: IEEE
Первая страница: 2525
Последняя страница: 2531
DOI: 10.1109/CoDIT58514.2023.10284178
Аннотация: In this paper we address the problem of static scheduling for multiprocessor systems, with minimization of makespan, and constraint on the number of interprocessor data transfers. Such problems arise during development of real-time data processing systems, such as telecommunication and control systems. A hybrid algorithm is proposed, combining greedy approach to construction of the initial solution and simulated annealing for its refinement. A specialized operation was developed, aimed at filling idle intervals in the schedule during simulated annealing phase. Experimental evaluation results are presented, demonstrating the advantage of the hybrid algorithm over both standalone greedy algorithm and simulated annealing with straightforward construction of the initial solution.
Добавил в систему: Балашов Василий Викторович

№	Имя	Описание	Имя файла	Размер	Добавлен
1.	Полный текст	https://ieeexplore.ieee.org/document/10284178	Hybrid_Algorithm_for_Multiprocessor_Scheduling_with_Makespa…	632,7 КБ	25 октября 2023 [vbalashov]

	ИСТИНА	Войти в систему Регистрация
	Интеллектуальная Система Тематического Исследования НАукометрических данных
	Главная Поиск Статистика О проекте Помощь

ИСТИНА