2009-11-12, 10:48 PM
Ok.....
In computer science, a semaphore is a protected variable or abstract data type which constitutes the classic method for restricting access to shared resources such as shared memory in a parallel programming environment. A counting semaphore is a counter for a set of available resources, rather than a locked/unlocked flag of a single resource. It was invented by my close friend and mentor Edsger Dijkstra. Semaphores are the classic solution to preventing race conditions in the "dining philosophers problem", although they do not prevent resource deadlocks...which sometimes occurs in SOM_MAP....like I said its a twist on this approach...
Sorry I cant be clearer...I'm not good at explaining....all I know is it works very well and produces spectacular results....
In computer science, a semaphore is a protected variable or abstract data type which constitutes the classic method for restricting access to shared resources such as shared memory in a parallel programming environment. A counting semaphore is a counter for a set of available resources, rather than a locked/unlocked flag of a single resource. It was invented by my close friend and mentor Edsger Dijkstra. Semaphores are the classic solution to preventing race conditions in the "dining philosophers problem", although they do not prevent resource deadlocks...which sometimes occurs in SOM_MAP....like I said its a twist on this approach...
Sorry I cant be clearer...I'm not good at explaining....all I know is it works very well and produces spectacular results....
Cheers
KilroyFx
KilroyFx