pc

代码说明：

说明：  天津大学并行计算大作业代码及实验报告。 包括： 1.利用Pthread并行实现求Pi和Jacobi迭代 2.利用MPI并行实现Jacobi迭代 3.hadoop下的Mapreduce实现Wordcount算法(Tianjin University of parallel computing job code and lab reports. Include: (1) the use of parallel implementation Pthread seeking Pi and Jacobi iteration 2 use MPI parallel implementation of Jacobi iteration 3.hadoop under Mapreduce achieve Wordcount algorithm.)

文件列表：

并行计算
........\3011216070_李晨_Lab12
........\.....................\1
........\.....................\.\pi并行.c,930,2014-03-18
........\.....................\.\多线程求pi.doc,125952,2014-03-25
........\.....................\2
........\.....................\.\jacobi串行.cpp,1098,2014-03-23
........\.....................\.\jacobi并行.cpp,2113,2014-03-25
........\.....................\.\多线程求Jacobi迭代.doc,1801216,2014-03-25

........\3011216070_李晨_Lab34
........\.....................\3
........\.....................\.\3_mpi求jacobi.doc,209920,2014-04-25
........\.....................\.\Jacobi_Mpi.cpp,3544,2014-04-13
........\.....................\.\OUTPUT,107732,2014-04-25
........\.....................\4
........\.....................\.\4_MapReduce实现WordCount.doc,199680,2014-04-25
........\.....................\.\output,691596,2014-04-25
........\.....................\.\WordCount.java,3499,2014-04-25
........\.....................\四次实验摘要.doc,289280,2014-04-25