<?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 on: Books: Java Concurrency In Practice</title>
	<atom:link href="http://www.feld.com/wp/archives/2006/06/books-java-concurrency-in-practice.html/feed" rel="self" type="application/rss+xml" />
	<link>http://www.feld.com/wp/archives/2006/06/books-java-concurrency-in-practice.html</link>
	<description></description>
	<lastBuildDate>Tue, 14 Feb 2012 01:23:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: sigma</title>
		<link>http://www.feld.com/wp/archives/2006/06/books-java-concurrency-in-practice.html/comment-page-1#comment-3095</link>
		<dc:creator>sigma</dc:creator>
		<pubDate>Sat, 17 Jun 2006 02:33:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.feld.com/wp/?p=1088#comment-3095</guid>
		<description>Looked at the book.  It seems terribly elementary, even
trivial, and nothing like powerful enough for serious work or
anywhere near up to date.  E.g., the book seems to emphasize
&#039;thread-safe&#039; objects:  That&#039;s just baby talk, is needed but
solves only the first trivial problems and quickly is not
nearly enough.

I saw no hint of monotone locking protocols, deadlock
detection, deadlock resolution, or transactional integrity.
In our work in production multi-processing (over 1000
processors), multi-threaded (many threads per processor),
high-performance, real-time, dynamic (object hierarchy fully
free to change during production execution), active (object
methods could execute on their own due to messages, timer
pops, etc.), object-oriented software technology 15 years ago,
we depended heavily on just these techniques.  They have long
been just crucial and still are.

Concurrency is a solid subject in computer science, and some
of the best algorithms there are just crucial to success with
solid software with high concurrency and multi-processing.

</description>
		<content:encoded><![CDATA[<p>Looked at the book.  It seems terribly elementary, even<br />
trivial, and nothing like powerful enough for serious work or<br />
anywhere near up to date.  E.g., the book seems to emphasize<br />
&#8216;thread-safe&#8217; objects:  That&#8217;s just baby talk, is needed but<br />
solves only the first trivial problems and quickly is not<br />
nearly enough.</p>
<p>I saw no hint of monotone locking protocols, deadlock<br />
detection, deadlock resolution, or transactional integrity.<br />
In our work in production multi-processing (over 1000<br />
processors), multi-threaded (many threads per processor),<br />
high-performance, real-time, dynamic (object hierarchy fully<br />
free to change during production execution), active (object<br />
methods could execute on their own due to messages, timer<br />
pops, etc.), object-oriented software technology 15 years ago,<br />
we depended heavily on just these techniques.  They have long<br />
been just crucial and still are.</p>
<p>Concurrency is a solid subject in computer science, and some<br />
of the best algorithms there are just crucial to success with<br />
solid software with high concurrency and multi-processing.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
<!-- WP Super Cache 0.8.9.1 -->
