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á bibliografie

Vydáno v:	Concurrency and computation Ročník 36; číslo 6
Hlavní autoři:	Passos, Fernanda G. O., Rebello, Vinod E. F.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken Wiley Subscription Services, Inc 10.03.2024
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!