[Threads] Solution 2 : Rank

This material is part of the course Practical Introduction to Parallel Programming and meant for educational purposes only.

Task

Implement a program in which the main threads spawns a number of child threads.

The main thread should pass an integer rank - ranging from zero to the number of threads minus one - to each child thread.

Each child thread should print its rank.

Copiez-collez cette commande dans votre terminal :

Le mot de pase pour se connecter est

Question 1: Rank

#include <stdio.h>
#include <pthread.h>

/* ---------------------------------------------------------------------
 * constants
 * ------------------------------------------------------------------ */

#define                   NUM_THREADS  8

/* ---------------------------------------------------------------------
 * thread_func()
 * ------------------------------------------------------------------ */

void*                     thread_func

  ( void*                   arg )

{
  int*  rank = (int*) arg;

  printf ( "My rank is %d.\n", *rank );

  return NULL;
}

/* ---------------------------------------------------------------------
 * main()
 * ------------------------------------------------------------------ */

int                       main

  ( int                     argc,
    char**                  argv )

{
  pthread_t  threads[NUM_THREADS];
  int        ranks  [NUM_THREADS];
  int        i;

  for ( i = 0; i < NUM_THREADS; i++ )
  {
    ranks[i] = i;

    pthread_create ( &threads[i], NULL, thread_func, &ranks[i] );
  }

  for ( i = 0; i < NUM_THREADS; i++ )
  {
    pthread_join ( threads[i], NULL );
  }

  return 0;
}

Question 2: Command Line Argument

Specify the command line arguments that should be passed to your program when it is run. Arguments must be given in quotes and separated by commas. Leave this filed empty if you do not want to specify command line arguments.

Example: "1","int","arg=2" is interpreted as three arguments 1, int, and arg=2.

Auteur(s)	Erik-Jan Lingen, Matthias Möller
Date limite	Pas de date limite
Limite de soumission	Pas de limite

Informations

Se connecter