KD-LBA: a Kernighan Lin-driven logarithmic barrier approach to solve the many-to-many assignment problem and its application in CPU/FPGA scheduling

The many-to-many assignment problem (M- MAP), and the CPU/FPGA scheduling problem are two correlated issues in the field of combinatorial optimization. The framework for Kernighan Lin-driven logarithmic barrier approach (KD-LBA) is made to solve the many-to-many assignment problem. KD-LBA is a deter...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Cluster computing 2021-12, Vol.24 (4), p.3101-3122
Hauptverfasser:	Das, Nitish, P., Aruna Priya
Format:	Artikel
Sprache:	eng
Schlagworte:	Assignment problem Combinatorial analysis Computer Communication Networks Computer Science Field programmable gate arrays Genetic algorithms Logarithms Operating Systems Operations research Performance evaluation Processor Architectures Scheduling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!