<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments for Homepage of Mate Soos</title>
	<atom:link href="http://www.msoos.org/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.msoos.org</link>
	<description>A blog about SAT solving and cryptography</description>
	<lastBuildDate>Fri, 03 Feb 2012 13:44:27 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on FPGA programming and SAT by Car</title>
		<link>http://www.msoos.org/2010/09/fpga-programming-and-sat/#comment-96</link>
		<dc:creator>Car</dc:creator>
		<pubDate>Fri, 03 Feb 2012 13:44:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.msoos.org/?p=401#comment-96</guid>
		<description>I am wondering the same myself! I mean you can map NDA to FPGAs.. But the SAT problem requires state, right? I need to look at the FPGA/SAT literature to see what has been done. It&#039;s a very interesting problem.</description>
		<content:encoded><![CDATA[<p>I am wondering the same myself! I mean you can map NDA to FPGAs.. But the SAT problem requires state, right? I need to look at the FPGA/SAT literature to see what has been done. It&#8217;s a very interesting problem.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on anf2cnf hell in Sage by msoos</title>
		<link>http://www.msoos.org/2010/09/anf2cnf-hell-in-sage/#comment-95</link>
		<dc:creator>msoos</dc:creator>
		<pubDate>Tue, 31 Jan 2012 09:06:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.msoos.org/?p=416#comment-95</guid>
		<description>Hi,

Yes, I think &lt;a href=&quot;http://www.msoos.org/2010/09/anf2cnf-script-released/&quot; rel=&quot;nofollow&quot;&gt;&lt;strong&gt;this&lt;/strong&gt;&lt;/a&gt; one gets around these problems.

Cheers,

Mate</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>Yes, I think <a href="http://www.msoos.org/2010/09/anf2cnf-script-released/" rel="nofollow"><strong>this</strong></a> one gets around these problems.</p>
<p>Cheers,</p>
<p>Mate</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Thoughts on SAT@home by SAT@home project is going ahead - Start - International Desktop Grid Federation</title>
		<link>http://www.msoos.org/2011/12/thoughts-on-sat-at-home/#comment-88</link>
		<dc:creator>SAT@home project is going ahead - Start - International Desktop Grid Federation</dc:creator>
		<pubDate>Sun, 22 Jan 2012 09:25:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.msoos.org/?p=1066#comment-88</guid>
		<description>[...] SAT@home BOINC project (http://sat.isa.ru/pdsat/) is aimed at solving hard problems that can be effectively reduced to the Boolean satisfiability problem. This project was implemented by two IDGF members: Institute for System Dynamics and Control Theory of the Siberian Branch of the Russian Academy of Sciences and Institute for Systems Analysis of Russian Academy of Sciences. Now this project is rapidly growing. New results are regularly obtained and published on the project web page. The project already attracted a worldwide attention. For instance recently it was discussed in the SAT Blog by Mate Soos. The record is available from here: http://www.msoos.org/thoughts-on-sat-at-home. [...] </description>
		<content:encoded><![CDATA[<p>[...] SAT@home BOINC project (<a href="http://sat.isa.ru/pdsat/" rel="nofollow">http://sat.isa.ru/pdsat/</a>) is aimed at solving hard problems that can be effectively reduced to the Boolean satisfiability problem. This project was implemented by two IDGF members: Institute for System Dynamics and Control Theory of the Siberian Branch of the Russian Academy of Sciences and Institute for Systems Analysis of Russian Academy of Sciences. Now this project is rapidly growing. New results are regularly obtained and published on the project web page. The project already attracted a worldwide attention. For instance recently it was discussed in the SAT Blog by Mate Soos. The record is available from here: <a href="http://www.msoos.org/thoughts-on-sat-at-home" rel="nofollow">http://www.msoos.org/thoughts-on-sat-at-home</a>. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on anf2cnf hell in Sage by cgoyet</title>
		<link>http://www.msoos.org/2010/09/anf2cnf-hell-in-sage/#comment-53</link>
		<dc:creator>cgoyet</dc:creator>
		<pubDate>Thu, 19 Jan 2012 20:31:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.msoos.org/?p=416#comment-53</guid>
		<description>Hi mate,
in fact your second example ([x1*x2 + 1, x1*x2 + x1]) needs only 3 clauses and 2 variables:
p cnf 3 3
c x1*x2 + 1
1
2
c  x1*x2 + x1 = x1*(x2+1)
-1 2

Is there a way to detect and to simplify these kind of unnecessary clauses ?</description>
		<content:encoded><![CDATA[<p>Hi mate,<br />
in fact your second example ([x1*x2 + 1, x1*x2 + x1]) needs only 3 clauses and 2 variables:<br />
p cnf 3 3<br />
c x1*x2 + 1<br />
1<br />
2<br />
c  x1*x2 + x1 = x1*(x2+1)<br />
-1 2</p>
<p>Is there a way to detect and to simplify these kind of unnecessary clauses ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on AMD&#8217;s OpenCL heaven and hell by Vincent Hindriksen</title>
		<link>http://www.msoos.org/2012/01/amds-opencl-heaven-and-hell/#comment-94</link>
		<dc:creator>Vincent Hindriksen</dc:creator>
		<pubDate>Tue, 10 Jan 2012 11:32:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.msoos.org/?p=1079#comment-94</guid>
		<description>Thank you for this review of AMD OpenCL on Linux. A honest review works better than a big smile. Just be sure that if they solve the problems, to mention that on this page.

As I develop OpenCL on Linux, I recognise the problems with stability of AMD&#039;s drivers on Linux. At AMD they know about these problems and have taken it more seriously lately, as their drivers were blacklisted for i.e. WebGL. At Phoronix there has been some updates on this. Trust me, I bugged them A LOT with Linux driver issues. Have you tried the latest 11.12-drivers? They are much, much more stable.

You missed that you cannot use Radeons in a headless configuration, making it impossible to use it as a compute-device only. Also that it is quite cumbersome to program host-code that transfers data really fast, and the super-fast &quot;zero-copy&quot; is not implemented under Linux. Their AMD APP Fusion competition is Windows-only, giving us Linux-devs a disadvantage from the start.

Part 1 of the &quot;The OpenCL Programming Guide&quot; is simply a waste of paper, but the second part with the examples is really useful. &quot;OpenCL in Action&quot; is a much better read, and what I see around it is currently the most popular . &quot;Heterogeneous Computing with OpenCL&quot; is very AMD-orientated, but together with &quot;CUDA by example&quot; and the various optimisation-guides it forms a good base for GPGPU with OpenCL. More resources are on my website, if you are looking for more.

Copy&amp;paste is hopefully solved when OpenCL is going to support templates. Each new OpenCL-compiler is better, so the optimisation-problems certainly will get less in time. As you discovered a lot of responsibility is given to the developer to take care of memory-type choices, buffer-sizes and optimisations - it can sometimes be very frustrating, can&#039;t it? :) Integration in other IDEs than VisualStudio is my big wish too, as highlighting and project-wizards are only a part of what is needed.</description>
		<content:encoded><![CDATA[<p>Thank you for this review of AMD OpenCL on Linux. A honest review works better than a big smile. Just be sure that if they solve the problems, to mention that on this page.</p>
<p>As I develop OpenCL on Linux, I recognise the problems with stability of AMD&#8217;s drivers on Linux. At AMD they know about these problems and have taken it more seriously lately, as their drivers were blacklisted for i.e. WebGL. At Phoronix there has been some updates on this. Trust me, I bugged them A LOT with Linux driver issues. Have you tried the latest 11.12-drivers? They are much, much more stable.</p>
<p>You missed that you cannot use Radeons in a headless configuration, making it impossible to use it as a compute-device only. Also that it is quite cumbersome to program host-code that transfers data really fast, and the super-fast &#8220;zero-copy&#8221; is not implemented under Linux. Their AMD APP Fusion competition is Windows-only, giving us Linux-devs a disadvantage from the start.</p>
<p>Part 1 of the &#8220;The OpenCL Programming Guide&#8221; is simply a waste of paper, but the second part with the examples is really useful. &#8220;OpenCL in Action&#8221; is a much better read, and what I see around it is currently the most popular . &#8220;Heterogeneous Computing with OpenCL&#8221; is very AMD-orientated, but together with &#8220;CUDA by example&#8221; and the various optimisation-guides it forms a good base for GPGPU with OpenCL. More resources are on my website, if you are looking for more.</p>
<p>Copy&amp;paste is hopefully solved when OpenCL is going to support templates. Each new OpenCL-compiler is better, so the optimisation-problems certainly will get less in time. As you discovered a lot of responsibility is given to the developer to take care of memory-type choices, buffer-sizes and optimisations &#8211; it can sometimes be very frustrating, can&#8217;t it? :) Integration in other IDEs than VisualStudio is my big wish too, as highlighting and project-wizards are only a part of what is needed.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Page Caching using disk: basic

Served from: www.msoos.org @ 2012-02-23 12:35:36 -->
