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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Concurrency and computation Jg. 36; H. 6
Hauptverfasser:	Passos, Fernanda G. O., Rebello, Vinod E. F.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 10.03.2024
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!