An Operational Performance Model of Breadth-First Search
نویسندگان
چکیده
We introduce queueing network models for characterizing and modeling the performance of graph programs. We show that graph programs can be modelled as a queuing network whose behaviour can be mapped to a queueing network of the underlying architecture. Operational analysis of these queueing networks allows us to systematically analyze performance and identify performance bottlenecks. We demonstrate the methodology by examining a breadth-first search (BFS) implementation on both CPU and GPU.
منابع مشابه
Flexible Search Strategies in Prolog CHR
We extend the refined operational semantics of the Constraint Handling Rules language to support the implementation of different search strategies. Such search strategies are necessary to build efficient Constraint Logic Programming systems. This semantics is then further refined so that it is more suitable as a basis for a trailing based implementation. We propose a source to source transforma...
متن کاملClassical search strategies for test case generation with Constraint Logic Programming
Test case generation for concurrent reactive systems on the grounds of symbolic execution basically amounts to searching their state space. As in the case of model checkers, different search strategies (depth-first, breadth-first, best-first, tabu) together with different strategies for storing visited states have a significant impact on the performance of the generation algorithm. We present e...
متن کاملHeuristics and exact methods for number partitioning
Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from branch-and-bound, breadth first search, and beam search. A new set of benchmark instances for this problem is also proposed. The behavior of the new method on t...
متن کاملA discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملNew insights into breadth-first search edge ordering of regular networks for terminal-pair reliability analysis
In the binary decision diagram–based terminal-pair network reliability analysis, the size of binary decision diagram heavily depends on the chosen edge ordering. From a theoretical point of view, finding the best ordering is an intractable task. Therefore, heuristics have been used to obtain reasonably good orderings. Among them, the breadth-first search heuristic typically outperforms other he...
متن کامل