<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet href='http://feeds.feedsky.com/styles/temp01.xsl' type='text/xsl' ?><!--这是一个由Feedsy提供技术支持的Feed，为了提高读者阅读的体验，以及满足用户美化自己Feed的需要，我们设计了多种精美的Feed模板，提供给大家选择，所有最终呈现出来的样式，皆由用户自愿选择使用，未经许可，任何团体和个人，请不要擅自修改样式或者盗用，这是对于用户选择权的尊重。--><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:fs="http://www.feedsky.com/namespace/feed" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link href="http://feeds.feedsky.com/csdn.net/drzhouweiming" type="application/rss+xml" ref="self"></atom:link><fs:self_link href="http://feeds.feedsky.com/csdn.net/drzhouweiming" type="application/rss+xml"></fs:self_link><lastBuildDate>Fri, 01 Feb 2008 10:58:00 GMT</lastBuildDate><title>周伟明的专栏</title><description>&amp;lt;&amp;lt;软件测试实践&amp;gt;&amp;gt; 已上市</description><item><title>高房价与多核分布式计算</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236348/1132740/1/item.html</link><wfw:comment>comments/2076513.aspx</wfw:comment><slash:comments>9</slash:comments><wfw:commentRss>comments/commentRss/2076513.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2076513</trackback:ping><description>本文主要从多核计算的角度来论述高房价问题及其对社会的影响，并给出了高房价问题的最终解决措施。&lt;img src =&quot;aggbug/2076513.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 01 Feb 2008 18:58:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2008/02/01/2076513.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2008/02/01/2076513.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2008/02/01/2076513.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236348/1132740</fs:itemid></item><item><title>OpenMP中的数据处理子句</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236349/1132740/1/item.html</link><wfw:comment>comments/2033276.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2033276.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2033276</trackback:ping><description>本文主要介绍了OpenMP中的private、firstprivate、lastprivate、threadprivate、reduction、copyin、copyprivate等数据处理子句的用法&lt;img src =&quot;aggbug/2033276.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 10 Jan 2008 19:02:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2008/01/10/2033276.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2008/01/10/2033276.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2008/01/10/2033276.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236349/1132740</fs:itemid></item><item><title>SD2.0大会的一些随想</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236350/1132740/1/item.html</link><wfw:comment>comments/1915336.aspx</wfw:comment><slash:comments>9</slash:comments><wfw:commentRss>comments/commentRss/1915336.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1915336</trackback:ping><description>SD2.0大会的一些随想
&lt;img src =&quot;aggbug/1915336.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Tue, 04 Dec 2007 19:11:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/12/04/1915336.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/12/04/1915336.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/12/04/1915336.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236350/1132740</fs:itemid></item><item><title>OpenMP中的任务调度</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236351/1132740/1/item.html</link><wfw:comment>comments/1844762.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1844762.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1844762</trackback:ping><description>本文主要介绍了OpenMP中任务调度子句schedule的使用方法&lt;img src =&quot;aggbug/1844762.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 26 Oct 2007 20:31:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/10/26/1844762.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/10/26/1844762.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/10/26/1844762.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236351/1132740</fs:itemid></item><item><title>菜鸟、夫子、玫林凯与测试</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236352/1132740/1/item.html</link><wfw:comment>comments/1843377.aspx</wfw:comment><slash:comments>3</slash:comments><wfw:commentRss>comments/commentRss/1843377.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1843377</trackback:ping><description>菜鸟安排集体活动，导用夫子的“己所不欲，勿施于人”和玫林凯的管理黄经法则“你希望别人怎样待你，你也应该怎样待别人”，结果闹出笑话。&lt;img src =&quot;aggbug/1843377.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 25 Oct 2007 23:05:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/10/25/1843377.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/10/25/1843377.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/10/25/1843377.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236352/1132740</fs:itemid></item><item><title>无锁编程与分布式编程那个更适合多核CPU？</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236353/1132740/1/item.html</link><wfw:comment>comments/1803695.aspx</wfw:comment><slash:comments>4</slash:comments><wfw:commentRss>comments/commentRss/1803695.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1803695</trackback:ping><description>本文重点比较了无锁编程和分布式锁竞争的性能，无锁（原子操作）实际上是一种细粒度锁。然后又从实现的功能，程序员掌握难易程度，现有软件的移植等方面进行了比较，得出结论： 无锁编程远不如分布式编程。分布式编程更适合多核CPU系统。&lt;img src =&quot;aggbug/1803695.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 28 Sep 2007 02:31:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/09/27/1803695.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/09/27/1803695.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/09/27/1803695.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236353/1132740</fs:itemid></item><item><title>多核系统中三种典型锁竞争的加速比分析</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236354/1132740/1/item.html</link><wfw:comment>comments/1800319.aspx</wfw:comment><slash:comments>5</slash:comments><wfw:commentRss>comments/commentRss/1800319.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1800319</trackback:ping><description>本文主要讨论了固定式锁竞争、随机锁竞争、分布式锁竞争三种典型锁竞争情况下的加速比,并分析了任务粒度因子和锁粒度因子对加速比的影响。
结论: 分布式锁竞争加速比随CPU核数成正比，可以达到和单核多任务时相当的性能，是多核编程的发展方向。
 &lt;img src =&quot;aggbug/1800319.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Wed, 26 Sep 2007 01:20:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/09/25/1800319.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/09/25/1800319.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/09/25/1800319.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236354/1132740</fs:itemid></item><item><title>多核新观念－象使用内存一样使用CPU？</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236355/1132740/1/item.html</link><wfw:comment>comments/1698721.aspx</wfw:comment><slash:comments>12</slash:comments><wfw:commentRss>comments/commentRss/1698721.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1698721</trackback:ping><description>象使用内存一样使用CPU？&lt;img src =&quot;aggbug/1698721.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 19 Jul 2007 20:17:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/07/19/1698721.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/07/19/1698721.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/07/19/1698721.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236355/1132740</fs:itemid></item><item><title>OpenMP创建线程中的锁及原子操作性能比较</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236356/1132740/1/item.html</link><wfw:comment>comments/1689853.aspx</wfw:comment><slash:comments>5</slash:comments><wfw:commentRss>comments/commentRss/1689853.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1689853</trackback:ping><description>主要比较了原子操作，Windows CriticalSection， OpenMP库带的锁在单任务运行情况下和多任务运行情况下的性能情况，在多核CPU上，多任务的锁竞争花费的时间是单任务时的锁运行花费时间的18倍。锁竞争带来的效率下降完全出乎意料之外，由此也可见多核编程和单核多任务编程是有很大区别的。&lt;img src =&quot;aggbug/1689853.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sat, 14 Jul 2007 07:16:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/07/13/1689853.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/07/13/1689853.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/07/13/1689853.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236356/1132740</fs:itemid></item><item><title>多核编程中的任务随机竞争模式的概率分析</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236357/1132740/1/item.html</link><wfw:comment>comments/1689789.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1689789.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1689789</trackback:ping><description>本文主要分析了多个任务在随机分布式锁竞争的情况下，有不少于CPU核数个数的任务在运行的概率。
然后将随机竞争和无锁编程的性能进行了理论上的比较
&lt;img src =&quot;aggbug/1689789.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sat, 14 Jul 2007 06:28:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/07/13/1689789.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/07/13/1689789.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/07/13/1689789.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236357/1132740</fs:itemid></item><item><title>多核编程中的任务分组竞争模式</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236358/1132740/1/item.html</link><wfw:comment>comments/1684753.aspx</wfw:comment><slash:comments>2</slash:comments><wfw:commentRss>comments/commentRss/1684753.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1684753</trackback:ping><description>讨论了使用任务分组锁竞争方式来消除锁竞争导致的CPU饥饿现象，队列池就是任务分组竞争的一个非常好的实践
任务分组竞争模式相对于无锁编程具有更好的优势。&lt;img src =&quot;aggbug/1684753.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Wed, 11 Jul 2007 05:21:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/07/10/1684753.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/07/10/1684753.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/07/10/1684753.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236358/1132740</fs:itemid></item><item><title>称球问题的测试解法</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236359/1132740/1/item.html</link><wfw:comment>comments/1613915.aspx</wfw:comment><slash:comments>2</slash:comments><wfw:commentRss>comments/commentRss/1613915.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1613915</trackback:ping><description>本文给出了称球问题的测试解法，求出了称k次的最大值，并给出了3次称13个球的实例。&lt;img src =&quot;aggbug/1613915.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 18 May 2007 04:13:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/05/17/1613915.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/05/17/1613915.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/05/17/1613915.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236359/1132740</fs:itemid></item><item><title>接口重构定理与Open-Close原则</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236360/1132740/1/item.html</link><wfw:comment>comments/1596881.aspx</wfw:comment><slash:comments>1</slash:comments><wfw:commentRss>comments/commentRss/1596881.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1596881</trackback:ping><description>主要讲解符合Open-Close原则的重构方式&lt;img src =&quot;aggbug/1596881.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sat, 05 May 2007 18:59:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/05/05/1596881.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/05/05/1596881.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/05/05/1596881.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236360/1132740</fs:itemid></item><item><title>接口设计定理</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236361/1132740/1/item.html</link><wfw:comment>comments/1589443.aspx</wfw:comment><slash:comments>2</slash:comments><wfw:commentRss>comments/commentRss/1589443.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1589443</trackback:ping><description>本文主要根据前面讲过的模块分解原理和接口设计原理推导出接口设计定理
并讨论了《敏捷软件开发》一书中提到的“开放－封闭原则”&lt;img src =&quot;aggbug/1589443.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sun, 29 Apr 2007 04:46:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/04/28/1589443.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/04/28/1589443.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/04/28/1589443.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236361/1132740</fs:itemid></item><item><title>接口关系稳定原理探索</title><link>http://item.feedsky.com/~csdn.net/drzhouweiming/~1132747/77236362/1132740/1/item.html</link><wfw:comment>comments/1589436.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1589436.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1589436</trackback:ping><description>主要讨论软件模块间的接口关系所遵循的稳定性方面的原理
由稳定原理推导出来软件的体系结构是分层的体系结构
&lt;img src =&quot;aggbug/1589436.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sun, 29 Apr 2007 04:41:00 +0800</pubDate><author>周伟明</author><comments>http://blog.csdn.net/drzhouweiming/archive/2007/04/28/1589436.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/drzhouweiming/archive/2007/04/28/1589436.aspx</guid><dc:creator>周伟明</dc:creator><fs:srclink>http://blog.csdn.net/drzhouweiming/archive/2007/04/28/1589436.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/drzhouweiming/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/drzhouweiming/~1132747/77236362/1132740</fs:itemid></item></channel></rss>