what new topics/update will be in the 3rd edition?

[Jesun Sahariar Firoz]

Hello,

I was wondering whether its possible to know what topics will be updated or included in the next edition of the book and when will be the new edition out tentatively?

[Maurice Herlihy]

New: cohort locks, data parallelism, flat combining, better explanation of progress conditions. This list is still tentative, since we are still working on the new edition. It should be ready by the end of 2015, start of 2016.

  Maurice

On Sun, Apr 19, 2015 at 2:02 AM, Jesun Sahariar Firoz <jesuns...@gmail.com> wrote:

Hello,

I was wondering whether its possible to know what topics will be updated or included in the next edition of the book and when will be the new edition out tentatively?

--
You received this message because you are subscribed to the Google Groups "Art of Multiprocessor Programming" group.
To unsubscribe from this group and stop receiving emails from it, send an email to art-of-multiprocessor-...@googlegroups.com.
To post to this group, send email to art-of-multiproc...@googlegroups.com.
Visit this group at http://groups.google.com/group/art-of-multiprocessor-programming.
For more options, visit https://groups.google.com/d/optout.

--

Maurice Herlihy
Professor
Computer Science
Brown University

[Jesun Sahariar Firoz]

Thank you professor Herlihy!

Best Regards
Jesun Sahariar Firoz

"Nice is Good"

--
You received this message because you are subscribed to a topic in the Google Groups "Art of Multiprocessor Programming" group.
To unsubscribe from this topic, visit https://groups.google.com/d/topic/art-of-multiprocessor-programming/M9ezFg0DiRo/unsubscribe.
To unsubscribe from this group and all its topics, send an email to art-of-multiprocessor-...@googlegroups.com.

[Jesun Sahariar Firoz]

Thank you professor Herlihy! Many data structures are covered in Art of Multiprocessor Programming. I was wondering why we don't have a  discussion about concurrent trees. Is it because other techniques are also applicable to trees? Thanks for bearing with me!

On Sunday, April 19, 2015 at 9:59:32 AM UTC-4, Maurice Herlihy wrote:

New: cohort locks, data parallelism, flat combining, better explanation of progress conditions. This list is still tentative, since we are still working on the new edition. It should be ready by the end of 2015, start of 2016.

  Maurice

On Sun, Apr 19, 2015 at 2:02 AM, Jesun Sahariar Firoz <jesuns...@gmail.com> wrote:

Hello,

I was wondering whether its possible to know what topics will be updated or included in the next edition of the book and when will be the new edition out tentatively?

--
You received this message because you are subscribed to the Google Groups "Art of Multiprocessor Programming" group.

To unsubscribe from this group and stop receiving emails from it, send an email to art-of-multiprocessor-programming+unsubscribe@googlegroups.com.
To post to this group, send email to art-of-multiprocessor-progr...@googlegroups.com.

Visit this group at http://groups.google.com/group/art-of-multiprocessor-programming.
For more options, visit https://groups.google.com/d/optout.

[Maurice Herlihy]

Concurrent trees are hard because rebalancing tends to conflict with all other operations. Skiplists seem to work better.

  Maurice

On Sun, Apr 19, 2015 at 10:53 AM, Jesun Sahariar Firoz <jesuns...@gmail.com> wrote:

Thank you professor Herlihy! Many data structures are covered in Art of Multiprocessor Programming. I was wondering why we don't have a  discussion about concurrent trees. Is it because other techniques are also applicable to trees? Thanks for bearing with me!

On Sunday, April 19, 2015 at 9:59:32 AM UTC-4, Maurice Herlihy wrote:

New: cohort locks, data parallelism, flat combining, better explanation of progress conditions. This list is still tentative, since we are still working on the new edition. It should be ready by the end of 2015, start of 2016.

  Maurice

On Sun, Apr 19, 2015 at 2:02 AM, Jesun Sahariar Firoz <jesuns...@gmail.com> wrote:

Hello,

I was wondering whether its possible to know what topics will be updated or included in the next edition of the book and when will be the new edition out tentatively?

--
You received this message because you are subscribed to the Google Groups "Art of Multiprocessor Programming" group.

To unsubscribe from this group and stop receiving emails from it, send an email to art-of-multiprocessor-...@googlegroups.com.
To post to this group, send email to art-of-multiproc...@googlegroups.com.

Visit this group at http://groups.google.com/group/art-of-multiprocessor-programming.
For more options, visit https://groups.google.com/d/optout.

--

Maurice Herlihy
Professor
Computer Science
Brown University

--

You received this message because you are subscribed to the Google Groups "Art of Multiprocessor Programming" group.

To unsubscribe from this group and stop receiving emails from it, send an email to art-of-multiprocessor-...@googlegroups.com.
To post to this group, send email to art-of-multiproc...@googlegroups.com.

Visit this group at http://groups.google.com/group/art-of-multiprocessor-programming.
For more options, visit https://groups.google.com/d/optout.

[Jesun Sahariar Firoz]

I see! Thank you Prof. Herlihy for your reply.

Best Regards
Jesun Sahariar Firoz

"Nice is Good"

You received this message because you are subscribed to a topic in the Google Groups "Art of Multiprocessor Programming" group.
To unsubscribe from this topic, visit https://groups.google.com/d/topic/art-of-multiprocessor-programming/M9ezFg0DiRo/unsubscribe.
To unsubscribe from this group and all its topics, send an email to art-of-multiprocessor-...@googlegroups.com.

[Ben Manes]

In addition to flat combining, it would be nice to extend the elimination discussion to include a combining via arena variant. I wrote a stack and queue using that technique.

An example of flat combining for an LRU cache might be an interesting example. That may be a reasonable way to express my design.