Revision as of 14:47, 9 December 2008 (view source) Rahul (talk \| contribs) (co-routine and random ?) ← Older edit		Revision as of 14:48, 9 December 2008 (view source) Rahul (talk \| contribs) mNo edit summary Newer edit →
Line 7: :::::What do you need to be clarified? I specified threads, tasks or co-routines. It can be argued that forking is a form of concurrency, which is why I specified threads, etc. Please let me know how you would like the task description to be clearer. There is currently a separate task to demonstrate forking. I have plans to explore more aspects of concurrency with tasks demonstrating synchronous and asynchonous communication between threads, etc. --[[User:Waldorf\|Waldorf]] 19:27, 7 February, 2007 (MST) ::::::OK. I think I understand now. Your task description is probably fine. --[[User:Short Circuit\|Short Circuit]] 08:19, 8 February 2007 (EST) :::::: ~~AFAK~~AFAIK Co-routines are deterministic because there is only one thread of execution at any point of time. (deterministic output). [[User:Rahul\|Rahul]] 14:48, 9 December 2008 (UTC) == Race conditions? ==

Talk:Concurrent computing (view source)