编程之美第一题,参考某同事的算法和文章

            Process p = Process.GetCurrentProcess();

            
const double SPLIT = 0.01;
            
const int COUNT = 200;
            
const double PI = 3.14159265;
            
const int INTERVAL = 100;

            
double[] busySpan = new double[COUNT];  //array of busy times
            double[] idleSpan = new double[COUNT];  //array of idle times
            int half = INTERVAL / 2;

            
double radian = 0.0;
            
for (int i = 0; i < COUNT; i++)
            {
                busySpan[i] 
= (double)(half + (Math.Sin(PI * radian) * half));
                idleSpan[i] 
= INTERVAL - busySpan[i];
                radian 
+= SPLIT;
            }

            
double startTime = 0;
            
int j = 0;

            
while (true)
            {
                j 
= j % COUNT;

                startTime 
= Environment.TickCount;

                p.ProcessorAffinity 
= (IntPtr)0x0001;
                
while ((Environment.TickCount - startTime) <= busySpan[j]) ;

                p.ProcessorAffinity 
= (IntPtr)0x0002;
                
while ((Environment.TickCount - startTime) <= idleSpan[j]) ;

                j
++;
            }

 

posted @ 2010-03-25 14:43  包建强  Views(1988)  Comments(0Edit  收藏  举报