Browse by author
Lookup NU author(s): Dr Ghaith Tarawneh,
Dr Andrey Mokhov,
Professor Alex Yakovlev
This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by IEEE, 2017.
For re-use rights please refer to the publisher's terms and conditions.
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.
Author(s): Tarawneh G, Mokhov A, Naylor M, Rast A, Moore SW, Thomas DB, Yakovlev A, Brown A
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Tenth International Workshop on Parallel Programming Models and Systems Software
Year of Conference: 2017
Online publication date: 07/09/2017
Acceptance date: 23/06/2017
Date deposited: 09/10/2017
Notes: Held in conjunction with ICPP 2017: The 46th International Conference on Parallel Processing
Series Title: International Conference on Parallel Processing Workshop. Proceedings