---

PsnMultiThreadedBenchedScheduler.cxx

Go to the documentation of this file.

/*
 * This file is part of openMask © INRIA, CNRS, Universite de Rennes 1 1993-2002, thereinafter the Software
 * 
 * The Software has been developped within the Siames Project. 
 * INRIA, the University of Rennes 1 and CNRS jointly hold intellectual property rights
 * 
 * The Software has been registered with the Agence pour la Protection des
 * Programmes (APP) under registration number IDDN.FR.001.510008.00.S.P.2001.000.41200
 *  
 * This file may be distributed under the terms of the Q Public License
 * version 1.0 as defined by Trolltech AS of Norway and appearing in the file
 * LICENSE.QPL included in the packaging of this file.
 *
 * Licensees holding valid specific licenses issued by INRIA, CNRS or Université de Rennes 1 
 * for the software may use this file in accordance with that specific license
 *
 */
#include "PsnMultiThreadedBenchedScheduler.h"

#include "PsnFrameScheduler.h"
#include "PsnBenchScheduler.h"
#include "PsnBarrier.h"
#include "PsController.h"
#include "PsDuplicatedObject.h"

#include <unistd.h>

#include <sys/time.h>

PsnMultiThreadedBenchedScheduler::PsnMultiThreadedBenchedScheduler (unsigned int numberOfSteps, unsigned int numberOfThreads) :
   PsnMultiThreadedScheduler(numberOfSteps, numberOfThreads, false),
   _indexOfBenchmarkingSample ( 0 ),
   _numberOfSamples ( 350 )
{

   _localWaitingTimes = new long * [ _numberOfThreads ] ;
   
   for (int i = 0 ; i < _numberOfThreads ; i++ ) 
      {
         _localWaitingTimes [ i ] = new long [ _numberOfSamples ] ;
      }
   
   _duplicatedObjectScheduler = new PsnBenchScheduler( numberOfSteps, _indexOfBenchmarkingSample , _numberOfSamples , cout ) ;

   for (int i = 0 ; i < _numberOfThreads ; i++ )
      {
         (*_localSchedulers)[i] = new PsnBenchScheduler( numberOfSteps, _indexOfBenchmarkingSample, _numberOfSamples , cout ) ;
      }
   
   int ret;
   for (int i = 0 ; i < _numberOfThreads ; i++ ) 
      {
      
         ret = pthread_create( & (_threadIds [i]), 
                               0,
                               (void *(*)(void *))_threadContainer,
                               (*_threadData)[i]);
         if (ret) 
         {
            PsController::error("Thread creation impossible") ;
         }
         
      }

}



PsnMultiThreadedBenchedScheduler::~PsnMultiThreadedBenchedScheduler() {
   long totalTime = 0 ;
   
   for (int i = 0 ; i < _numberOfThreads ; i++ ) 
      {
         totalTime = 0 ;
         cout <<"thread "<<i<<endl;
         for ( int j =0 ; j < _numberOfSamples ; j ++ ) 
            {
               totalTime+=_localWaitingTimes [i] [j] ;
               cout<<_localWaitingTimes [i] [j] <<" , ";
            }
         cout<< "average " <<totalTime/_numberOfSamples<<endl;
         
         delete _localWaitingTimes [ i ] ;
         
      }  
   
   delete [] _localWaitingTimes ;
}



void PsnMultiThreadedBenchedScheduler::runStep (unsigned int which) {

   _indexOfBenchmarkingSample = (_indexOfBenchmarkingSample + 1) % _numberOfSamples ;
   
   PsnMultiThreadedScheduler::runStep ( which ) ; 

}




void * PsnMultiThreadedBenchedScheduler::_threadContainer (void * myThreadData) {
   
   pair<PsnMultiThreadedBenchedScheduler *, unsigned int> * threadData = ( pair<PsnMultiThreadedBenchedScheduler *, unsigned int> * ) myThreadData ;

   ( * threadData ).first->run( ( * threadData ).second ) ;

   return threadData ;
}


void PsnMultiThreadedBenchedScheduler::run( unsigned int whichFrameScheduler ) 
{
   timeval _dateReelleDebut ;
   timeval _dateReelleFin ;
   int counter = 0 ;

   while ( true ) {
      
      _barrier->Sync() ;
      

      (*_localSchedulers)[ whichFrameScheduler ]->runStep ( _currentStep ) ;

      gettimeofday(&_dateReelleDebut, NULL);

      _barrier->Sync() ;

      gettimeofday(&_dateReelleFin, NULL);
      if (_dateReelleFin.tv_usec > _dateReelleDebut.tv_usec ) 
      {
         _localWaitingTimes [whichFrameScheduler] [ counter ] = _dateReelleFin.tv_usec - _dateReelleDebut.tv_usec ;
      }

      counter = ( counter + 1 ) % _numberOfSamples ;

   }
}

---