From 3cc0fc6652215b4a4ecc8ff75f54a4c49614bad5 Mon Sep 17 00:00:00 2001
From: Robert Watson <rwatson@FreeBSD.org>
Date: Fri, 12 Nov 2004 17:56:50 +0000
Subject: [PATCH] Pick a mid-point between Pittsburghification and
rwatsonification.
---
en/projects/netperf/index.sgml | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/en/projects/netperf/index.sgml b/en/projects/netperf/index.sgml
index fe59497911..2abfd8128a 100644
--- a/en/projects/netperf/index.sgml
+++ b/en/projects/netperf/index.sgml
@@ -1,6 +1,6 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" [
<!ENTITY base CDATA "../..">
-<!ENTITY date "$FreeBSD: www/en/projects/netperf/index.sgml,v 1.4 2004/11/12 11:56:56 rwatson Exp $">
+<!ENTITY date "$FreeBSD: www/en/projects/netperf/index.sgml,v 1.5 2004/11/12 16:04:43 trhodes Exp $">
<!ENTITY title "FreeBSD Network Performance Project (netperf)">
<!ENTITY email 'mux'>
<!ENTITY % includes SYSTEM "../../includes.sgml"> %includes;
@@ -58,8 +58,8 @@
into the kernel, reducing parallelism.</p></li>
<li><p>Optimize locking strategies to find better balances between
- locking granularity and locking overhead. In the first cut with locking
- work on the kernel, the goal was to adopt a medium-grained locking
+ locking granularity and locking overhead. In the first cut at locking
+ for the kernel, the goal was to adopt a medium-grained locking
approach based on data locking. This approach identifies critical
data structures, and inserts new locks and locking operations to
protect those data structures. Depending on the data model of the