prt_thread.h File Reference

PRT thread. More...

#include "prt.h"

Include dependency graph for prt_thread.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	prt_thread_s
	VSA's worker thread Owns a number of VDPs. Knows the communication proxy. More...

Typedefs
typedef struct prt_thread_s	prt_thread_t
	VSA's worker thread Owns a number of VDPs. Knows the communication proxy. More...

Functions
prt_thread_t *	prt_thread_new (int rank, int core)
	thread object constructor More...
void	prt_thread_delete (prt_thread_t *thread)
	thread object destructor More...
void *	prt_thread_run (void *thrd)
	thread's production cycle Cycle through VDPs. Fire the ones that are ready. Remove the ones which burned out. Return when the list of VDPs becomes empty. More...

Detailed Description

PRT thread.

Author

Jakub Kurzak

PULSAR Runtime /pulsar/ Copyright (C) 2012-2013 University of Tennessee.

Definition in file prt_thread.h.

Typedef Documentation

typedef struct prt_thread_s prt_thread_t

VSA's worker thread Owns a number of VDPs. Knows the communication proxy.

Function Documentation

void prt_thread_delete

(

prt_thread_t *

thread

)

thread object destructor

Parameters

thread

Definition at line 48 of file prt_thread.c.

References icl_list_destroy(), icl_list_size(), prt_assert, and prt_thread_s::vdps.

{
    // Destroy the list of VDPs.
    int size = icl_list_size(thread->vdps);
    prt_assert(size == 0, "destroying non-empty list");
    int status = icl_list_destroy(thread->vdps, NULL);
    prt_assert(status == 0, "icl_list_destroy failed");

    // Free the thread.
    free(thread);
}

Here is the call graph for this function:

Here is the caller graph for this function:

prt_thread_t* prt_thread_new	(	int	rank,
		int	core
	)

thread object constructor

Parameters

rank	local thread rank
core	global core number

Returns

new thread object

Definition at line 22 of file prt_thread.c.

References prt_thread_s::core, prt_thread_s::finished, icl_list_new(), prt_assert, prt_thread_s::rank, and prt_thread_s::vdps.

{
    // Allocate the thread.
    prt_thread_t *thread = (prt_thread_t*)malloc(sizeof(prt_thread_t));
    prt_assert(thread != NULL, "malloc failed");

    // Initialize the thread.
    thread->rank = rank;
    thread->core = core;
    thread->finished = 0;

    // Create the list of VDPs.
    // No error checking.
    thread->vdps = icl_list_new();
    prt_assert(thread->vdps != NULL, "icl_list_new failed");

    // Return the thread.
    return thread;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void* prt_thread_run

(

void *

thrd

)

thread's production cycle Cycle through VDPs. Fire the ones that are ready. Remove the ones which burned out. Return when the list of VDPs becomes empty.

Parameters

thrd	pointer to the thread object

Definition at line 70 of file prt_thread.c.

References prt_vdp_s::color, prt_vsa_s::config, prt_vdp_s::counter, icl_list_s::data, prt_thread_s::finished, prt_vdp_s::function, prt_vsa_s::global_store, icl_list_delete(), icl_list_first(), icl_list_next(), prt_vdp_s::input, prt_vdp_s::local_store, prt_vdp_s::output, prt_vdp_ready(), PRT_VDP_SCHEDULING_AGGRESSIVE, PRT_VDP_SCHEDULING_LAZY, prt_thread_s::rank, svg_trace_start(), svg_trace_stop(), prt_vdp_s::tuple, prt_config_s::vdp_scheduling, prt_thread_s::vdps, and prt_thread_s::vsa.

{
    prt_thread_t *thread = (prt_thread_t*)thrd;
    icl_list_t *prev;
    icl_list_t *node;
    icl_list_t *next;
    // WHILE the list of VDPs not empty.
    while ((node = icl_list_first(thread->vdps)) != NULL) {
        // REPEAT.
        do {
            prt_vdp_t *vdp = (prt_vdp_t*)node->data;
            if  (thread->vsa->config->vdp_scheduling == PRT_VDP_SCHEDULING_AGGRESSIVE) {
                // WHILE inputs ready AND counter NOT zero.
                while (vdp->counter > 0 && prt_vdp_ready(vdp)) {
                    // Fire and decrement.
                    svg_trace_start(thread->rank+1);
                    vdp->function(
                        vdp->tuple, vdp->counter,
                        vdp->input, vdp->output,
                        vdp->local_store, thread->vsa->global_store);
                    svg_trace_stop(thread->rank+1, vdp->color);
                    vdp->counter--;
                }
            }
            else if (thread->vsa->config->vdp_scheduling == PRT_VDP_SCHEDULING_LAZY) {
                // IF inputs ready AND counter NOT zero.
                if (vdp->counter > 0 && prt_vdp_ready(vdp)) {
                    // Fire and decrement.
                    svg_trace_start(thread->rank+1);
                    vdp->function(
                        vdp->tuple, vdp->counter,
                        vdp->input, vdp->output,
                        vdp->local_store, thread->vsa->global_store);
                    svg_trace_stop(thread->rank+1, vdp->color);
                    vdp->counter--;
                }
            }
            prev = node;
            node = icl_list_next(thread->vdps, node);
            // IF counter zeroed.
            if (vdp->counter == 0)
                // Remove the VDP from the list
                // Do not destroy the VDP itself.
                icl_list_delete(thread->vdps, prev, NULL);
        }
        while (node != NULL);
        // UNTIL the end of the list.
    }
    // Signal completion.
    thread->finished = 1;
}

Here is the call graph for this function:

Here is the caller graph for this function: