Want to protect your cyber security and still get fast solutions? Ask a secure question today.Go Premium

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 1890
  • Last Modified:

Binary tree Process creation in UNIX

I have to create concurrent processes in the form of the binary tree in UNIX using C program and fork() system call. Each parent should exactly spawn two processes which in turn will spawn 2 process. Given the number of levels in the binary tree, say n, that many processes should get spawn. I am new to unix and processes, Is there anyone who could help me on this?
0
Beebutter
Asked:
Beebutter
  • 2
1 Solution
 
Kent OlsenData Warehouse Architect / DBACommented:
Hi Beebutter,

Just to be clear, if each process spawns two more processes, you'll wind up with 2^n-1 processes, not n.

It's actually pretty easy.  All you need to do is work out how to get 1 process to spawn exactly 2 processes.  Once that's done, running the process will result in two more processes being created,  Each of those 2 will then create 2 more.

The trick to stopping this (and you definitely want to stop this) is to set a global variable that records the depth.  When the child inherits the parent's memory it will also inherit the current value of the depth variable.  Just check it to make sure that the task needs to spawn additional children before id does spawn them.

You might want to post your code here before you try it.  :)  No point in having thousands of tasks spawning new tasks over and over if the code's just a bit off.


Good Luck,
Kent
0
 
xtravaganCommented:
I am slghtly uneasy to answer these kind of questions because they sound too much like school work. And as such it is a learning experience that is supposed to happen.

In unix you use

man fork

to figure stuff out.

In windows you instead search msdn for CreateProcess.

Anyhow, I intentially left a error in this code if you get what is going on it will be easy to fix. You will notice it grows more than it should.






#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
 
int run(int n);
 
int spawn(int n)
{
    int pid = fork();
 
    if (pid == 0)
    {
        // Child
        printf("Child at n %d\n", n);
        run(n);
    }
    else if (pid == -1)
    {
        printf("Error spawning\n");
    }
    else
    {
        // Parent
    }
}
 
int run(int n)
{
    if (n > 0)
    {
        spawn(n - 1);
        spawn(n - 1);
    }
}
 
int main(int argc, char** argv)
{
    int n = 0;
    if (argc > 1)
        n = atoi(argv[1]);
 
    printf("Running with n %d\n", n);
    run(n);
}

Open in new window

0
 
BeebutterAuthor Commented:
First of all let me make one point clear that this is not a homework assignement. I am trying how the execution time of program is changing in a multiple proces environment by allowing each process to handle different sets of numbers and different internal sorting algorithms. Well I already tried this for chain of processes. I am left with binary tree of process structure and tree of processes.
With the response from the experts I was anyways going to post my code only, to spot the error.
0
 
BeebutterAuthor Commented:
I understand your goal in maintaining Acdemic honesty. I just wanted to let you know my side of explanation. Thats all.
0

Featured Post

What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now