We will use the following program , which uses cilk API for parallelization, to experiment with the Parallel Stacks Window:

In the above code, the main program calls functions that may themselves call other functions. At each cilk_spawn keyword, we can expect a new child thread to call the function. However, if the function have very short operations each, then the different spawns may not even be distributed to different child threads, since each function call may take very fast. That was originally the case, where all of the function calls were done by one thread. Therefore, the functions were adjusted to sleep for 1 second within the function itself. This way, the functions took long enough so that the program did spawn into multiple child threads.  Here is the output of the program, with the cilk_for loop commented out:[[File:CilkOutput.PNG|500px|center|Step 1 - threads]] From the output we can see that 4 different workers (child threads) occupied the 6 function calls. In order of the function calls in the code, Worker 0 took foo(), worker 3 took coo(), worker 2 took boo(), worker 1 took doo(), worker 0 took zoo(), and finally worker 3 took the remaining foo() function. The Parallel Stacks window allows us to see the call stack information for all active threads at any point in our program.