Victor Dodon printesoi
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| -----BEGIN CERTIFICATE----- | |
| MIIEJTCCAw2gAwIBAgIDAjp3MA0GCSqGSIb3DQEBCwUAMEIxCzAJBgNVBAYTAlVT | |
| MRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMRswGQYDVQQDExJHZW9UcnVzdCBHbG9i | |
| YWwgQ0EwHhcNMTQwODI5MjEzOTMyWhcNMjIwNTIwMjEzOTMyWjBHMQswCQYDVQQG | |
| EwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEgMB4GA1UEAxMXUmFwaWRTU0wg | |
| U0hBMjU2IENBIC0gRzMwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCv | |
| VJvZWF0eLFbG1eh/9H0WA//Qi1rkjqfdVC7UBMBdmJyNkA+8EGVf2prWRHzAn7Xp | |
| SowLBkMEu/SW4ib2YQGRZjEiwzQ0Xz8/kS9EX9zHFLYDn4ZLDqP/oIACg8PTH2lS | |
| 1p1kD8mD5xvEcKyU58Okaiy9uJ5p2L4KjxZjWmhxgHsw3hUEv8zTvz5IBVV6s9cQ | |
| DAP8m/0Ip4yM26eO8R5j3LMBL3+vV8M8SKeDaCGnL+enP/C1DPz1hNFTvA5yT2AM |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * =========================================================================== | |
| * | |
| * Filename: sort.cpp | |
| * Author: Dodon Victor, dodonvictor AT gmail DOT com | |
| * Created: 11/22/2012 04:32:15 PM | |
| * Editor: Vim 7.3 | |
| * Compiler: clang 3.2 | |
| * OS: Archlinux x86_64 | |
| * |
printesoi
/ parallel.c
Created
November 2, 2012 17:18
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| for (t = 0; t < iteratii; ++t) { | |
| n_res0 = n_res1 = 0; | |
| p_res0 = p_res1 = 0; | |
| // pentru fiecare negustor | |
| #pragma omp parallel for private(i, j, _c, _v, k, l) schedule(dynamic) | |
| for (i = 0; i < n; ++i) { | |
| for (j = 0; j < n; ++j) { | |
| // calculele | |
| _c = pMax; | |
| _v = pMax; |
NewerOlder