Publication: On using gray codes to improve the efficiency of the parallel exhaustive search algorithm for the knapsack problem
Дата
2019
Авторы
Journal Title
Journal ISSN
Volume Title
Издатель
Аннотация
© 2019 IEEE In previous papers, we stated that splitting the lexicographic sequence into equal parts does not yield uniform workload distribution for a parallel computational system. One of the options we have considered is breaking the packing vectors space into classes based on the vectors' Hamming weight, and then split each of the classes into equal parts. In this paper, we investigate another load balancing technique based on using the Gray codes instead of the lexicographic sequence. As only one element of the packing changes on every step, we can calculate the packing weight dynamically. Thus, the time needed to weigh a packing becomes both shorter and more uniform. We study the properties of the Gray codes and analyze their impact on the algorithm run time and efficiency of parallel computation.
Описание
Ключевые слова
Цитирование
Natalia, K. On using gray codes to improve the efficiency of the parallel exhaustive search algorithm for the knapsack problem / Natalia, K., Mikhail, K., Georgii, B. // Proceedings of the 2019 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2019. - 2019. - P. 1821-1825. - 10.1109/EIConRus.2019.8657131
URI
https://www.doi.org/10.1109/EIConRus.2019.8657131
https://www.scopus.com/record/display.uri?eid=2-s2.0-85063533023&origin=resultslist
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Alerting&SrcApp=Alerting&DestApp=WOS_CPL&DestLinkType=FullRecord&UT=WOS:000469452600424
https://openrepository.mephi.ru/handle/123456789/16752
https://www.scopus.com/record/display.uri?eid=2-s2.0-85063533023&origin=resultslist
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Alerting&SrcApp=Alerting&DestApp=WOS_CPL&DestLinkType=FullRecord&UT=WOS:000469452600424
https://openrepository.mephi.ru/handle/123456789/16752