class Worker_Fib : public MWWorker

The Worker class created for my fibonacci example application

Inheritance:

Public Methods

double benchmark( MWTask *t )

Benchmarking

Worker_Fib()

Default Constructor

~Worker_Fib()

Default Destructor

Public

Implemented methods.

MWReturn unpack_init_data( void )

Unpacks the "base" application data from the PVM buffer

void execute_task( MWTask * )

Executes the given task

Private Methods

void get_fib( int firstseed, int secondseed, int *sequence, int len )

Given two seed numbers (firstseed and secondseed), fill the array pointed at by sequence to contain the first SEQUENCELENGTH numbers in the related fibonacci series

Inherited from MWWorker:

Public Fields

static MWRMComm* RMC

MWTask* workingTask

Public Methods

void go( int argc, char *argv[] )

Protected Fields

char mach_name[64]

int master

Protected Methods

virtual void execute_task( MWTask * )

virtual void pack_worker_initinfo()

void suicide()

double timeval_to_double( struct timeval t )

virtual void unpack_driver_task_data( void )

virtual MWReturn unpack_init_data()

void worker_mainloop()

MWReturn worker_setup()

Protected

Worker_Fib()

Default Constructor

~Worker_Fib()

Default Destructor

Implemented methods.

These are the ones that must be Implemented in order to create an application

MWReturn unpack_init_data( void )

Unpacks the "base" application data from the PVM buffer

void execute_task( MWTask * )

Executes the given task. Remember to cast the task as type DummyTask

double benchmark( MWTask *t )

Benchmarking

void get_fib( int firstseed, int secondseed, int *sequence, int len )

Given two seed numbers (firstseed and secondseed), fill the array pointed at by sequence to contain the first SEQUENCELENGTH numbers in the related fibonacci series. Pretty simple, really.

Parameters:

firstseed - The first of the pair to make the sequence
secondseed - The second of the pair to begin the sequence
sequence - A pointer to an int array that will hold the completed fibonacci sequence.
len - The length of sequence.

alphabetic index hierarchy of classes

this page has been generated automatically by doc++

(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de