Many-Core Approaches to Combinatorial Problems: case of the Langford problem - Archive ouverte HAL Access content directly
Journal Articles Supercomputing Frontiers and Innovations Year : 2016

Many-Core Approaches to Combinatorial Problems: case of the Langford problem

(1) , (1) , (1) , (2, 1)
1
2

Abstract

As observed from the last TOP500 list - November 2015 -, GPUs-accelerated clusters emerge as clear evidence. But exploiting such architectures for combinatorial problem resolution remains a challenge. In this context, this paper focuses on the resolution of an academic combinatorial problem, known as the Langford pairing problem, which can be solved using several approaches. We first focus on a general solving scheme based on CSP (Constraint Satisfaction Problem) formalism and backtrack called the Miller algorithm. This method enables us to compute instances up to L(2, 21) using both CPU and GPU computational power with load balancing. As dedicated algorithms may still have better computation efficiency we took advantage of Godfrey’s algebraic method to solve the Langford problem and implemented it using our multiGPU approach. This allowed us to recompute the last open instances, L(2, 27) and L(2, 28), respectively in less than 2 days and 23 days using best-effort computation on the ROMEO supercomputer with up to 500,000 GPU cores.
Fichier principal
Vignette du fichier
93-742-1-PB.pdf (851.82 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01698255 , version 1 (01-02-2018)

Identifiers

Cite

M. Krajecki, J Loiseau, F Alin, C. Jaillet. Many-Core Approaches to Combinatorial Problems: case of the Langford problem. Supercomputing Frontiers and Innovations , 2016, 3 (2), ⟨10.14529/jsfi160202⟩. ⟨hal-01698255⟩

Collections

URCA CRESTIC
55 View
103 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More