i've been trying piece how stack memory handed out threads. haven't been able piece whole thing together. tried go code, i'm more confused, i'm asking help. i asked question little while ago. assume particular program (therefore, threads within same process). if write printf s each beginning of stack pointer, , how allocated them, stuff table @ end of message, first column time_t usec , second doesn't matter, third tid of thread, fourth guard size, begin of stack, end of stack (sorted beginning of stack), last 1 allocated stack (8 megs default) , last column difference between end of first allocated stack, , beginning of next stack. this means (i think), if 0, stacks contiguous, if positive, since stack grows down in memory, means there "free space" of many mbs between tid , next (in memory). if negative, means memory being reused. may mean that stack space has been freed before thread created. my problem is: algorithm assigns stack space thre...