... 9 , 2010 MPI/OpenMP 60 1 2 3 ( PARALLEL) #pragma omp parallel [ [ [, ] ] ...] : default(shared | ... include stdio.h int main () { int n =100000, i; double pi, h, sum , x; h = 1.0 / ( double ) n; sum = 0.0; for (i = 1; i = n; i ++) { x = h * (( double )i - 0.5); sum += (4.0 / (1.0 + x*x)); } pi = h * sum ; printf( pi is approximately %.16f , pi); return 0; } 9 , 2010 MPI / OpenMP 84 1 2 3 OpenMP int main () { int n =100, i; double pi, h, sum , x; h = 1.0 / ( double ) n; ...

Еще в разделе: (Показать все результаты (>2) - angel.cmc.msu.ru/ )

... Multi-threaded search engines . ... Unfortunately, most documents on search engines I saw in the Internet were either lists of hyperlinks without any comments, or discussions about how many documents are in the database of ... (here is the name of a search engine) and what method of counting of the number of documents was used. No words about the efficiency, i.e. how many documents on some subject I can find using this search engine, especially in comparison with the other ones. ...

303. About the CCOE at Lomonosov Moscow State University | CUDA Center of Excellence

304. InCO persons In English