Consider the parallel formulation of bitonic sort for a mesh-connected parallel computer. Compute the exact parallel run time of the following formulations:
a. One that uses the row-major mapping shown in Figure 9.11(a) for a mesh with storeand-forward routing.
b. One that uses the row-major snakelike mapping shown in Figure 9.11(b) for a mesh with store-and-forward routing.
c. One that uses the row-major shuffled mapping shown in Figure 9.11(c) for a mesh with store-and-forward routing.
Also, determine how the above run times change when cut-through routing is used.