Phil Trinder

Phil Trinder
Are you Phil Trinder?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Phil Trinder
Affiliation
Location

Pubs By Year

Pub Categories

 
Computer Science - Distributed; Parallel; and Cluster Computing (1)

Publications Authored By Phil Trinder

Branch and bound searches are a common technique for solving global optimisation and decision problems, yet their irregularity, search order dependence, and the need to share bound information globally makes it challenging to implement them in parallel, and to reason about their parallel performance. We identify three key parallel search properties for replicable branch and bound implementations: Sequential Lower Bound, Non-increasing Runtimes, and Repeatability. We define a formal model for parallel branch and bound search problems and show its generality by using it to define three benchmarks: finding a Maximum Clique in a graph, 0/1 Knapsack and Travelling Salesperson (TSP). Read More