floyd’salgorithm-全文預覽
【正文】 does this work? Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Pointtopoint Communication ? Involves a pair of processes ? One process sends a message ? Other process receives the message Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Two Data Depositions Rowwise block striped Columnwise block striped Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Designing Parallel Algorithm ? Partitioning ? Communication ? Agglomeration and Mapping Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Floyd’s Algorithm for k ? 0 to n1 for i ? 0 to n1 for j ? 0 to n1 a[i,j] ? min (a[i,j], a[i,k] + a[k,j]) endfor endfor endfor Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Chapter 6 Floyd’s Algorithm Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Parallel Programming with MPI and OpenMP Michael J. Quinn Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Allpairs Shortest Path Problem A E B C D 4 6 1 3 5 3 1 2 0 6 3 6 4 0 7 10 12 6 0 3 7 3 10 0 9 5 12 2 A B C D E A B C D 4 8 1 11 0 E Resulting Adjacency Matrix Containing Distances Copyright 169。 The McGrawHill Companies, Inc. Permission required for reproduction or display. Dynamic 2D Array Creation Heap Runtime Stack Bstorage B Copyright 169。 The McGrawHill Companies, Inc. Permission
黨政相關(guān)相關(guān)推薦
鄂ICP備17016276號-1