The University of Southampton
University of Southampton Institutional Repository

Programming model to develop supercomputer combinatorial solvers

Programming model to develop supercomputer combinatorial solvers
Programming model to develop supercomputer combinatorial solvers

Novel architectures for massively parallel machines offer better scalability and the prospect of achieving linear speedup for sizable problems in many domains. The development of suitable programming models and accompanying software tools for these architectures remains one of the biggest challenges towards exploiting their full potential. We present a multi-layer software abstraction model to develop combinatorial solvers on massively-parallel machines with regular topologies. The model enables different challenges in the design and optimization of combinatorial solvers to be tackled independently (separation of concerns) while permitting problem-specific tuning and cross-layer optimization. In specific, the model decouples the issues of inter-node communication, node-level scheduling, problem mapping, mesh-level load balancing and expressing problem logic. We present an implementation of the model and use it to profile a Boolean satisfiability solver on simulated massively-parallel machines with different scales and topologies.

1530-2016
171-179
Institute of Electrical and Electronics Engineers Inc.
Tarawneh, Ghaith
1b90fbe9-1337-4216-83ba-b01115bf4000
Mokhov, Andrey
7ad0909b-34e8-4f32-908c-b6406b397776
Naylor, Matthew
7f0b28f7-b50f-40cc-b3ed-3821e5ef1230
Rast, Alex
696b5585-ae6d-436e-a3fe-e612b1c8152a
Moore, Simon W.
e9f2be21-1fa3-43aa-a3e2-fc8519f97a00
Thomas, David B.
5701997d-7de3-4e57-a802-ea2bd3e6ab6c
Yakovlev, Alex
d6c94911-c126-4cb7-8f92-d71a898ebbb2
Brown, Andrew
5c19e523-65ec-499b-9e7c-91522017d7e0
Tarawneh, Ghaith
1b90fbe9-1337-4216-83ba-b01115bf4000
Mokhov, Andrey
7ad0909b-34e8-4f32-908c-b6406b397776
Naylor, Matthew
7f0b28f7-b50f-40cc-b3ed-3821e5ef1230
Rast, Alex
696b5585-ae6d-436e-a3fe-e612b1c8152a
Moore, Simon W.
e9f2be21-1fa3-43aa-a3e2-fc8519f97a00
Thomas, David B.
5701997d-7de3-4e57-a802-ea2bd3e6ab6c
Yakovlev, Alex
d6c94911-c126-4cb7-8f92-d71a898ebbb2
Brown, Andrew
5c19e523-65ec-499b-9e7c-91522017d7e0

Tarawneh, Ghaith, Mokhov, Andrey, Naylor, Matthew, Rast, Alex, Moore, Simon W., Thomas, David B., Yakovlev, Alex and Brown, Andrew (2017) Programming model to develop supercomputer combinatorial solvers. In Proceedings - 46th International Conference on Parallel Processing Workshops, ICPPW 2017. Institute of Electrical and Electronics Engineers Inc. pp. 171-179 . (doi:10.1109/ICPPW.2017.35).

Record type: Conference or Workshop Item (Paper)

Abstract

Novel architectures for massively parallel machines offer better scalability and the prospect of achieving linear speedup for sizable problems in many domains. The development of suitable programming models and accompanying software tools for these architectures remains one of the biggest challenges towards exploiting their full potential. We present a multi-layer software abstraction model to develop combinatorial solvers on massively-parallel machines with regular topologies. The model enables different challenges in the design and optimization of combinatorial solvers to be tackled independently (separation of concerns) while permitting problem-specific tuning and cross-layer optimization. In specific, the model decouples the issues of inter-node communication, node-level scheduling, problem mapping, mesh-level load balancing and expressing problem logic. We present an implementation of the model and use it to profile a Boolean satisfiability solver on simulated massively-parallel machines with different scales and topologies.

This record has no associated files available for download.

More information

Published date: 14 August 2017
Venue - Dates: 46th International Conference on Parallel Processing Workshops, ICPPW 2017, , Bristol, United Kingdom, 2017-08-14

Identifiers

Local EPrints ID: 453673
URI: http://eprints.soton.ac.uk/id/eprint/453673
ISSN: 1530-2016
PURE UUID: 935e19b1-2251-4300-9eca-f2e40c4e1b39
ORCID for David B. Thomas: ORCID iD orcid.org/0000-0002-9671-0917

Catalogue record

Date deposited: 20 Jan 2022 17:45
Last modified: 10 Jun 2022 01:57

Export record

Altmetrics

Contributors

Author: Ghaith Tarawneh
Author: Andrey Mokhov
Author: Matthew Naylor
Author: Alex Rast
Author: Simon W. Moore
Author: David B. Thomas ORCID iD
Author: Alex Yakovlev
Author: Andrew Brown

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×