<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>PLINQ Queries That Run in Parallel in .NET 4.5</title><link>http://blogs.msdn.com/b/pfxteam/archive/2011/11/11/10235999.aspx</link><description>One interesting thing to know about PLINQ is that not all queries are guaranteed to execute in parallel (See PLINQ Queries That Run Sequentially for reference). You can think of the AsParallel method as a hint to run in parallel for query shapes that</description><dc:language>en-US</dc:language><generator>Telligent Evolution Platform Developer Build (Build: 5.6.50428.7875)</generator><item><title>re: PLINQ Queries That Run in Parallel in .NET 4.5</title><link>http://blogs.msdn.com/b/pfxteam/archive/2011/11/11/10235999.aspx#10245684</link><pubDate>Thu, 08 Dec 2011 17:45:46 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:10245684</guid><dc:creator>Richard Deeming</dc:creator><description>&lt;p&gt;I was suggesting that these bugs, and probably many others, should be fixed. If you&amp;#39;re willing to risk breaking backwards compatibility to improve performance, I don&amp;#39;t understand why you won&amp;#39;t risk it to fix something that&amp;#39;s broken! :)&lt;/p&gt;
&lt;p&gt;The second bug is particularly apposite:&lt;/p&gt;
&lt;p&gt;&amp;quot;while well-behaved implementations ... should handle this fine, there may be some implementations ... that are not expecting us to reverse the order in which we supply these arguments for a given list&amp;quot;&lt;/p&gt;
&lt;p&gt;A developer writing an IComparer implementation which depends on the precise implementation of the sorting algorithm used internally is protected from breaking changes, whereas someone using PLINQ incorrectly isn&amp;#39;t.&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=10245684" width="1" height="1"&gt;</description></item><item><title>re: PLINQ Queries That Run in Parallel in .NET 4.5</title><link>http://blogs.msdn.com/b/pfxteam/archive/2011/11/11/10235999.aspx#10245655</link><pubDate>Thu, 08 Dec 2011 17:09:09 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:10245655</guid><dc:creator>Stephen Toub - MSFT</dc:creator><description>&lt;p&gt;Richard, thank you for the feedback. &amp;nbsp;Are you suggesting we not fix PLINQ&amp;#39;s performance, or are you suggesting that those two bugs you link to should also be fixed? &amp;nbsp;It&amp;#39;s not clear to me what you&amp;#39;re hoping for.&lt;/p&gt;
&lt;p&gt;Part of the point with PLINQ is that its up to the heuristics used in PLINQ internally to determine how to execute a particular query, and those heuristics may evolve over time. &amp;nbsp;A developer explicitly opting-in to using PLINQ is doing so because they want their query to run in parallel, and has as such already affirmed it&amp;#39;s ok for the system to do so (expected, in fact). &amp;nbsp;That PLINQ then was in some limited circumstances not running those queries in parallel is what was addressed here.&lt;/p&gt;&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=10245655" width="1" height="1"&gt;</description></item><item><title>re: PLINQ Queries That Run in Parallel in .NET 4.5</title><link>http://blogs.msdn.com/b/pfxteam/archive/2011/11/11/10235999.aspx#10245647</link><pubDate>Thu, 08 Dec 2011 17:01:01 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:10245647</guid><dc:creator>Richard Deeming</dc:creator><description>&lt;p&gt;So you won&amp;#39;t fix bugs like [1] and [2] in case they break some hypothetical code you&amp;#39;ve never seen, but you&amp;#39;ll change the fundamental behaviour of PLINQ without adding an &amp;quot;old behaviour&amp;quot; switch and just hope it doesn&amp;#39;t break anything?&lt;/p&gt;
&lt;p&gt;[1] &lt;a rel="nofollow" target="_new" href="https://connect.microsoft.com/VisualStudio/feedback/details/94064/colortranslator-fromhtml-throws-a-system-exception"&gt;connect.microsoft.com/.../colortranslator-fromhtml-throws-a-system-exception&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;[2] &lt;a rel="nofollow" target="_new" href="https://connect.microsoft.com/VisualStudio/feedback/details/634949/orderbydescending-fails-in-linq-to-objects-when-a-comparer-returns-int-minvalue"&gt;connect.microsoft.com/.../orderbydescending-fails-in-linq-to-objects-when-a-comparer-returns-int-minvalue&lt;/a&gt;&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=10245647" width="1" height="1"&gt;</description></item><item><title>re: PLINQ Queries That Run in Parallel in .NET 4.5</title><link>http://blogs.msdn.com/b/pfxteam/archive/2011/11/11/10235999.aspx#10243623</link><pubDate>Fri, 02 Dec 2011 07:19:49 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:10243623</guid><dc:creator>Satish</dc:creator><description>&lt;p&gt; How we acheive Parallel programming with Database?. &lt;/p&gt;
&lt;p&gt;For Example &amp;nbsp;We have 10000 records to insert into Database &amp;nbsp;,We are writng dotnet code to insert records .&lt;/p&gt;
&lt;p&gt;From dotnet perspective we are able to acheive .but for data base server will eats up more memory.&lt;/p&gt;
&lt;p&gt;Can some suggest how to acheive this.?&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=10243623" width="1" height="1"&gt;</description></item><item><title>re: PLINQ Queries That Run in Parallel in .NET 4.5</title><link>http://blogs.msdn.com/b/pfxteam/archive/2011/11/11/10235999.aspx#10236155</link><pubDate>Fri, 11 Nov 2011 12:56:29 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:10236155</guid><dc:creator>Ronald Wildenberg</dc:creator><description>&lt;p&gt;I was wondering: what are the semantics of First (or FirstOrDefault or Last, etc)? For example, can the following query return 2 instead of 1 (in a better example, 1 and 2 would represent some expensive operation):&lt;/p&gt;
&lt;p&gt;(new[] {1, 2}).AsParallel().First();&lt;/p&gt;
&lt;p&gt;Or is First order-preserving somehow (and if it is, what&amp;#39;s the use of parallelizing it since you simply want to get the first element as fast as possible).&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=10236155" width="1" height="1"&gt;</description></item></channel></rss>