219351 Web Application Development Homework
Message Passing Programming with C (bubblesort MPI)
Complie
mpicc hw3.c -o hw3Execute with np = 2
mpiexec -np 2 ./hw3 Array is NOT sorted
9 8 7 6 5 4 3 2 1 0
Array is sorted
Elapsed time MPI_Wtime is 9.431626
Execute with np = 4
mpiexec -np 4 ./hw3 Array is NOT sorted
9 8 7 6 5 4 3 2 1 0
Array is sorted
Elapsed time MPI_Wtime is 4.091237
Sequential vs MapReduce (Use web-Google.txt as the input file)
Problems
- 5. Sequential - for every given node, how many nodes contains links to it
- 6. MapReduce - for every given node, how many nodes contains links to it
- 7. Sequential - for every given node, say X, a list of nodes that X can reach in two links
- 8. MapReduce - for every given node, say X, a list of nodes that X can reach in two links
PIG - MapReduce (Use web-Google.txt as the input file)
- 4. - for every given node, how many nodes contains links to it
- 5. - for every given node, say X, a list of nodes that X can reach in two links
| Fullname | StudentID |
|---|---|
| Supanut Apikulvanich | 5610501016 |
| Apichan Chaiyuttasart | 5610502888 |
| Manatsawin Hanmongkolchai | 5610545757 |
| Nut Kaewnak | 5610545676 |
| Piyaphat Tulakoop | 5610545731 |