From: <tr...@do...> - 2014-05-27 16:33:48
|
<p>The following issue has been added to a project that you are monitoring.</p> <table border="0"> <tr> <td width="90px" valign="top"><b>Title:</b></td> <td>Investigate whether GRAPH clause evaluation can be safely parallelised with PLINQ</td> </tr> <tr> <td><b>Project:</b></td> <td>Core Library (dotNetRDF.dll)</td> </tr> <tr> <td><b>Created By:</b></td> <td>Rob Vesse</td> </tr> <tr> <td><b>Milestone:</b></td> <td>1.0.6</td> </tr> <tr> <td><b>Category:</b></td> <td>Query</td> </tr> <tr> <td><b>Priority:</b></td> <td>Normal</td> </tr> <tr> <td><b>Type:</b></td> <td>Improvement</td> </tr> <tr> <td><b>Description:</b></td> </tr> <tr> <td colspan="2"><p> One thing noted in investigation of CORE-416 was that GRAPH clause evaluation is not currently parallelised. For clauses that work over large numbers of graphs and have complex inner algebras this means their evaluation can be rather slow. Since the management of the active graph is already implemented so as to be thread safe it should in principal be possible to parallelise the evaluation of GRAPH clauses to improve performance while retaining correctness.</p></td> </tr> </table> <p> More information on this issue can be found at <a href="http://www.dotnetrdf.org/tracker/Issues/IssueDetail.aspx?id=418" target="_blank">http://www.dotnetrdf.org/tracker/Issues/IssueDetail.aspx?id=418</a></p> <p style="text-align:center;font-size:8pt;padding:5px;"> If you no longer wish to receive notifications, please visit <a href="http://www.dotnetrdf.org/tracker/Account/UserProfile.aspx" target="_blank">your profile</a> and change your notifications options. </p> |