(Choose all problems from Section I, Minimum 10 problems from Sections II and III) SECTION I: NETWORKS

Implement the following problems in any high level languages and also analyse the complexity of the algorithms.

1. Implement the fixed channel allocation algorithm with channel borrowing using SM SIMD EREW model. 2. Implement the fixed channel allocation algorithm with hybrid channel borrowing using SM SIMD EREW model. 3. Implement the fixed channel allocation with reassignment using SM SIMD EREW model. 4. Implement Dynamic channel allocation using SM SIMD EREW & CREW models. 5. Implement hybrid channel allocation without channel borrowing using SM SIMD EREW model

SECTION II: NETWORK SECURITY Implement the following problems in any high level languages and also analyse the complexity of the algorithms.

6. Implement ECB mode of Triple DES with 2 keys using SM SIMD EREW algorithm with and without ciphertext stealing 7. Implement ECB mode of Triple DES with 2 keys using SM SIMD CREW algorithm with and without ciphertext stealing 8. Implement ECB mode of Triple DES with 2 keys using Linear array interconnection method with and without ciphertext stealing 9. Implement ECB mode of Triple DES with 2 keys using Tree interconnection method with and without ciphertext stealing 10. Implement ECB mode of Triple DES with 2 keys using 2D mesh interconnection method with and without ciphertext stealing 11. Implement ECB mode of Triple DES with 2 keys using Cube interconnection method with and without ciphertext stealing 12. Implement ECB mode of Triple DES with 2 keys using Random interconnection method with and without ciphertext stealing 13. Implement CTR mode of Triple DES with 2 keys using SM SIMD EREW algorithm

14. Implement CTR mode of Triple DES with 2 keys using SM SIMD CREW algorithm 15. Implement CTR mode of Triple DES with 2 keys using Linear array interconnection method 16. Implement CTR mode of Triple DES with 2 keys using Tree interconnection method 17. Implement CTR mode of Triple DES with 2 keys using 2D mesh interconnection method 18. Implement CTR mode of Triple DES with 2 keys using Cube interconnection method 19. Implement CTR mode of Triple DES with 2 keys using Random interconnection method 20. Implement OFB mode of Triple DES with 2 keys using Linear array interconnection method 21. Implement OFB mode of Triple DES with 2 keys using Tree interconnection method 22. Implement OFB mode of Triple DES with 2 keys using 2D mesh interconnection method 23. Implement OFB mode of Triple DES with 2 keys using shuffle Exchange interconnection method 24. Implement OFB mode of Triple DES with 2 keys using Random interconnection method 25. Implement OFB mode of 128 bit- AES using Linear array interconnection method 26. Implement OFB mode of 128 bit- AES using Tree interconnection method 27. Implement OFB mode of 128 bit- AES using 2D mesh interconnection method 28. Implement OFB mode of 128 bit- AES using shuffle Exchange interconnection method 29. Implement OFB mode of 128 bit AES using Random interconnection method 30. Implement RC4 method using SM SIMD EREW algorithm 31. Implement RC4 method using SM SIMD CREW algorithm 32. Implement RC4 using Linear array interconnection method 33. Implement RC4 using Tree interconnection method 34. Implement Control vector encryption and decryption technique using EREW SIMD array Processors 35. Implement the key distribution method shown in the Fig 1 using EREW SIMD array Processors.

Fig: 1

SECTION III: IMAGE PROCESSING

Implement the following problems in sequential and parallel manner using any high level languages and also analyse the complexity of the algorithm. 36. Given an image, process it (both in sequential and parallel way SM MISD CREW) to detect the edges present in the image using First order operators (Gradient and cross gradient operators). 37. Given an image, process it (both in sequential and parallel way SM MISD CREW) to detect the edges present in the image using First order operators (Prewitt, Sobel). 38. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using Second order derivatives (Laplacian). Analyse the computational complexity for - SM SIMD CRCW, CREW, ERCW, EREW. [Note: generate different masks and parallelize them] 39. Given an image, process it (both in sequential and parallel way- SM SIMD CREW) to detect the edges present in the image using Second order derivatives (Laplacian Of Gaussian (LOG)). [Note: generate different masks and parallelize them] 40. Given an image, process it (both in sequential and parallel way- SM SIMD CREW) to detect the edges present in the image using Second order derivatives (Difference Of Gaussian (DOG)). [Note: generate different masks and parallelize them] 41. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using Kirsch template matching mask. [Note: Parallelize different Masks] 42. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using Robinson compass template matching mask. [Note: Parallelize different Masks] 43. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using Frei-chen template matching mask. [Note: Parallelize different Masks] 44. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using Second order derivatives (Canny edge detection). 45. Given an image, process it (both in sequential and parallel way SM SIMD CREW) to detect the edges present in the image using global thresholding.

46. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using multiple thresholding. 47. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using overlapping adaptive thresholding. 48. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using subregion adaptive thresholding. 49. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using parametric optimal thresholding methods. 50. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using non parametric optimal thresholding methods. 51. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using region growing technique. 52. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using split merge algorithm (Regional adjacency graph). 53. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) to detect the edges present in the image using split merge algorithm (Pyramid Quadtree ). 54. Given an image, process it (both in sequential and parallel way - SM MIMD CREW) and display the objects present in it using Hough transforms for line, circle. 55. Given an image, process it (both in sequential and parallel way SM SIMD CREW) display the objects present in it using Hough transforms for line and also count total number of lines present on the image. 56. Given an image, process it (both in sequential and parallel way - SM SIMD CREW) and display the similar patterns present in the image (pattern fit). 57. Given an image with shadows present in it, detect the shadow region and display it in sequential and parallel algorithms (SM SIMD CREW).