![]() | |||||||||||||
Messages in this thread |
Hello everyone,this is my first time to post a message on this mailing-list. As we all know the kernel maintain a data struct for the process(PCB),and also for the thread.Because of the latter's smaller than the former's,thread switching is faster than the process switching.And from the book,I read that threads shares some data information of the process,so my question is that when the threads of different processes have to switch,and the threads also use some data of the processes,will the process switch before the threads?The speed of these threads switching is slower than normal,is that true ? How can the thread's advantage over process reflect? -- Support Open Source! Support Linux (Debian Mandriva ...)! You are free to use them! - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/ | ||||||||||||
| Last update: 2005-09-04 04:30 [from the cache] ©2003-2008 | |||||||||||||