Код бенчмарка для lock-free

[yigal_c]

pop-up text

1. #define N1 3
2. #define N2 1000000
5. static int
6. do_rand(unsigned long ctx)
7. {
8. /*
9. * Compute x = (7^5 * x) mod (2^31 - 1)
10. * wihout overflowing 31 bits:
11. * (2^31 - 1) = 127773 * (7^5) + 2836
12. * From "Random number generators: good ones are hard to find",
13. * Park and Miller, Communications of the ACM, vol. 31, no. 10,
14. * October 1988, p. 1195.
15. */
16.     long hi, lo, x;
18.     /* Can't be initialized with 0, so use another value. */
19.     if (ctx == 0)
20.         ctx = 123459876;
21.     hi = ctx / 127773;
22.     lo = ctx % 127773;
23.     x = 16807 * lo - 2836 * hi;
24.     if (x < 0)
25.         x += 0x7fffffff;
26.     return x;
27. }
29. long commonContext;
30. char fill[54];
32. struct Tls
33. {
34.     long individualContext;
35.     long myRandomContext;
36.     int outCounter;
37.     char fill[54];
38. } tls[30];
40. HANDLE manual = CreateEvent(0, TRUE, FALSE, 0);
42. int moda;
43. DWORD WINAPI threadFunc1(LPVOID lpThreadParameter)
44. {
45.     Tls& me = tls[(int) lpThreadParameter];
46.     me.myRandomContext = (int)&lpThreadParameter;
47.     long& C = commonContext;
48.     const int myModa = moda;
49.     WaitForSingleObject(manual, INFINITE);
50.     for(int i=0;i
51.         for(int j=0;j
52.         {
53.             long oldVal = C;
54.             for(;;)
55.             {
56.                 long newVal = InterlockedCompareExchange(&C, do_rand(oldVal), oldVal);
57.                 if (newVal == oldVal)
58.                     break;
59.                 else
60.                 {
61.                     oldVal = newVal;
62.                 }
63.             }
64.             me.myRandomContext = do_rand(me.myRandomContext);
65.             int limit=(me.myRandomContext %myModa);
66.             for(int k=0;k
67.                 me.outCounter+=limit+10;
68.         }
70.     return 0;
71. }
73. CRITICAL_SECTION cs;
77. DWORD WINAPI threadFunc2(LPVOID lpThreadParameter)
78. {
79.     Tls& me = tls[(int) lpThreadParameter];
80.     me.myRandomContext = (int)&lpThreadParameter;
81.     const int myModa = moda;
83.     long& C = commonContext;
84.     WaitForSingleObject(manual, INFINITE);
85.     for(int i=0;i
86.         for(int j=0;j
87.         {
88.             EnterCriticalSection(&cs);
89.             C = do_rand(C);
90.             LeaveCriticalSection(&cs);
91.             me.myRandomContext = do_rand(me.myRandomContext);
92.             int limit =(me.myRandomContext %myModa);
93.             for(int k=0;k
94.                 me.outCounter+=limit+10;
95.         }
97.         return 0;
98. }
100. int step(int n)
101. {
102.     int retval = n / 5;
103.     if (retval==0)
104.         retval = 1;
105.     return retval;
107. }
109. int _tmain(int argc, _TCHAR* argv[])
110. {
111.     InitializeCriticalSection(&cs);
112.     HANDLE threads[100];
113.     unsigned start;
114.     int tnum=8;
115.     moda=1000;
116. //    for(moda=1; moda<20000;moda+=step(moda))
117.     for (tnum=1;tnum<=18;tnum++)
118.     {
119.         for(int i=0;i
120.         {
121.             DWORD tid;
122.             threads[i]=CreateThread(NULL, 0, threadFunc1, (void*)i, 0, &tid );
123.         }
124.         Sleep(1000); // naive but enough for dirty test
125.         start = GetTickCount();
126.         SetEvent(manual);
127.         for(int i=0;i
128.         {
129.             WaitForSingleObject(threads[i], INFINITE);
130.         }
131.         int v1 = GetTickCount()-start;
132.         ResetEvent(manual);
134.         for(int i=0;i
135.         {
136.             DWORD tid;
137.             threads[i]=CreateThread(NULL, 0, threadFunc2, (void*)i, 0, &tid );
138.         }
139.         Sleep(1000);
140.         start = GetTickCount();
141.         SetEvent(manual);
142.         for(int i=0;i
143.         {
144.             WaitForSingleObject(threads[i], INFINITE);
145.         }
146.         int v2 = GetTickCount()-start;
147.         ResetEvent(manual);
150.         printf("%d %d %f %f\n", tnum, moda,(double(tnum)*1000.)/v1,(double(tnum)*1000.)/v2);
151.     }
152.     return 0;
153. }

#define N1 3
#define N2 1000000

static int
do_rand(unsigned long ctx)
{
/*
* Compute x = (7^5 * x) mod (2^31 - 1)
* wihout overflowing 31 bits:
* (2^31 - 1) = 127773 * (7^5) + 2836
* From "Random number generators: good ones are hard to find",
* Park and Miller, Communications of the ACM, vol. 31, no. 10,
* October 1988, p. 1195.
*/
long hi, lo, x;

/* Can't be initialized with 0, so use another value. */
if (ctx == 0)
ctx = 123459876;
hi = ctx / 127773;
lo = ctx % 127773;
x = 16807 * lo - 2836 * hi;
if (x < 0)
x += 0x7fffffff;
return x;
}

long commonContext;
char fill[54];

struct Tls
{
long individualContext;
long myRandomContext;
int outCounter;
char fill[54];
} tls[30];

HANDLE manual = CreateEvent(0, TRUE, FALSE, 0);

int moda;
DWORD WINAPI threadFunc1(LPVOID lpThreadParameter)
{
Tls& me = tls[(int) lpThreadParameter];
me.myRandomContext = (int)&lpThreadParameter;
long& C = commonContext;
const int myModa = moda;
WaitForSingleObject(manual, INFINITE);
for(int i=0;i