From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id ; Wed, 20 Jun 2001 11:34:14 -0400 Received: (majordomo@vger.kernel.org) by vger.kernel.org id ; Wed, 20 Jun 2001 11:34:05 -0400 Received: from leibniz.math.psu.edu ([146.186.130.2]:51875 "EHLO math.psu.edu") by vger.kernel.org with ESMTP id ; Wed, 20 Jun 2001 11:33:57 -0400 Date: Wed, 20 Jun 2001 11:33:55 -0400 (EDT) From: Alexander Viro To: Jes Sorensen cc: Alan Cox , bert hubert , "linux-kernel@vger.kernel.org" Subject: Re: Alan Cox quote? (was: Re: accounting for threads) In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org On 20 Jun 2001, Jes Sorensen wrote: > Not to mention how complex it is to get locking right in an efficient > manner. Programming threads is not that much different from kernel SMP > programming, except that in userland you get a core dump and retry, in > the kernel you get an OOPS and an fsck and retry. Arrgh. As long as we have that "SMP makes locking harder" myth floating around we _will_ get problems. Kernel UP programming is not different from SMP one. It is multithreaded. And amount of genuine SMP bugs is very small compared to ones that had been there on UP since way back. And yes, programming threads is the same thing. No arguments here.