An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems

Summary Backtracking branch‐and‐prune (BP) algorithms and their variants are exhaustive search tree techniques widely employed to solve optimization problems in many scientific areas. However, they characteristically often demand significant amounts of computing power for problem sizes representativ...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 36; no. 6
Main Authors:	Passos, Fernanda G. O., Rebello, Vinod E. F.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 10.03.2024
Subjects:	Algorithms autonomic computing Computer networks Distributed processing heterogeneous distributed systems Middleware parallel branch‐and‐prune algorithms search tree algorithms Searching self‐configuring parallel algorithms System effectiveness Workload Workloads
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!