Work Stealing with Private Integer-Vector-Matrix Data Structure for Multi-core Branch-and-Bound Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Concurrency and Computation: Practice and Experience Year : 2016

Work Stealing with Private Integer-Vector-Matrix Data Structure for Multi-core Branch-and-Bound Algorithms

Abstract

In this paper, the focus is put on multi-core Branch-and-Bound algorithms for solving large scale permutation-based optimization problems. We investigate five work stealing (WS) strategies with a new data structure called Integer-Vector-Matrix (IVM). In these strategies, each thread has a private IVM allowing the local management of a set of subproblems enumerated using a factorial system. The WS strategies differ in the way the victim thread is selected and the granularity of stolen work units (intervals of factoradics). To assess the efficiency of the private IVM-based WS approach, the five WS strategies have been extensively experimented on the flowshop scheduling permutation problem and compared to their conventional linked-list-based counterparts. The obtained results demonstrate that the IVM-based WS outperforms the linked-list-based one in terms of CPU time, memory usage and number of performed WS operations.

Dates and versions

hal-01248336 , version 1 (25-12-2015)

Identifiers

Cite

Jan Gmys, Rudi Leroy, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens. Work Stealing with Private Integer-Vector-Matrix Data Structure for Multi-core Branch-and-Bound Algorithms. Concurrency and Computation: Practice and Experience, 2016, ⟨10.1002/cpe.3771⟩. ⟨hal-01248336⟩
138 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More