Return-Path: Delivered-To: apmail-db-derby-dev-archive@www.apache.org Received: (qmail 390 invoked from network); 26 Sep 2008 13:38:37 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 26 Sep 2008 13:38:37 -0000 Received: (qmail 78254 invoked by uid 500); 26 Sep 2008 13:38:35 -0000 Delivered-To: apmail-db-derby-dev-archive@db.apache.org Received: (qmail 78038 invoked by uid 500); 26 Sep 2008 13:38:34 -0000 Mailing-List: contact derby-dev-help@db.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: Delivered-To: mailing list derby-dev@db.apache.org Received: (qmail 77407 invoked by uid 99); 26 Sep 2008 13:38:34 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 26 Sep 2008 06:38:33 -0700 X-ASF-Spam-Status: No, hits=-2000.0 required=10.0 tests=ALL_TRUSTED X-Spam-Check-By: apache.org Received: from [140.211.11.140] (HELO brutus.apache.org) (140.211.11.140) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 26 Sep 2008 13:37:40 +0000 Received: from brutus (localhost [127.0.0.1]) by brutus.apache.org (Postfix) with ESMTP id C84B6234C1FB for ; Fri, 26 Sep 2008 06:37:44 -0700 (PDT) Message-ID: <664628508.1222436264819.JavaMail.jira@brutus> Date: Fri, 26 Sep 2008 06:37:44 -0700 (PDT) From: "Knut Anders Hatlen (JIRA)" To: derby-dev@db.apache.org Subject: [jira] Created: (DERBY-3885) Latch contention in B-tree on multi-core systems MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-Virus-Checked: Checked by ClamAV on apache.org Latch contention in B-tree on multi-core systems ------------------------------------------------ Key: DERBY-3885 URL: https://issues.apache.org/jira/browse/DERBY-3885 Project: Derby Issue Type: Improvement Components: Performance, Store Affects Versions: 10.4.2.0 Reporter: Knut Anders Hatlen Priority: Minor When you have many concurrent threads accessing rows in the same table via an index, the root of the B-tree becomes a hot spot. Since access to a node in the B-tree is single-threaded (an exclusive latch is held while a binary search is performed on the node) this limits the scalability on multi-core systems. We should try to find a way to allow multiple threads to navigate the B-tree concurrently without blocking each other. -- This message is automatically generated by JIRA. - You can reply to this email to add a comment to the issue online.