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

Celý popis

Podrobná bibliografia

Vydané v:	Concurrency and computation Ročník 36; číslo 6
Hlavní autori:	Passos, Fernanda G. O., Rebello, Vinod E. F.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 10.03.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!