ANALYSIS OF AMOUNT OF DATA TRANSFER IN PARALLEL BREADTH-FIRST SEARCH ALGORITHM
Paper describes analysis of data transfer in two different implementations of breadth-first search. First is top-down and second is bottom-up implementation. It is shown that first implementation reveals rather big data transfer overheads in its intermediate iterations while second implementation reveals more balanced and acceptable amount of data transfer.