Emery Blogger

Emery Berger's Blog

Main Menu

Skip to content
  • About

Category Archives: Concurrency

082012_CACMpg49_Software-Needs-t.large

ACM Queue article: “Software Needs Seatbelts and Airbags”

July 24, 2012by emeryberger 1 Comment

(Based on an earlier blog post.) ACM Queue, July 2012 - http://queue.acm.org/detail.cfm?id=2333133 Software Needs Seatbelts and Airbags Finding and fixing bugs in deployed software is difficult and time-consuming. Here are some […]

Read Article →
Concurrency, Fault Tolerance, Memory Management, Programming Languages
airbag

Software Needs Seatbelts and Airbags

May 31, 2012by emeryberger 2 Comments

(This post is a draft version of an article slated to appear in ACM Queue.) Finding and fixing bugs in deployed software is difficult and time-consuming: here are some alternatives. […]

Read Article →
Concurrency, Fault Tolerance, Memory Management, Programming Languages
einstein-insanity

Hot off the Presses (Dthreads & Sheriff)

September 12, 2011by emeryberger Leave a comment

Camera-ready versions of recent pubs from our research group: SOSP 2011: Dthreads: Efficient and Deterministic Multithreading, Tongping Liu, Charlie Curtsinger, and Emery Berger. OOPSLA 2011: Sheriff: Precise Detection and Automatic […]

Read Article →
Concurrency, Programming Languages
einstein-insanity

Dthreads: Efficient Deterministic Multithreading

July 6, 2011by emeryberger 11 Comments

Dthreads: Efficient Deterministic Multithreading, Tongping Liu, Charlie Curtsinger, Emery D. Berger SOSP 2011 [paper (PDF)][source code] [YouTube video of presentation][PPT slides] Multithreaded programming is notoriously difficult to get right. A […]

Read Article →
Concurrency, Programming Languages
False sharing = secret contention

SHERIFF: Precise Detection and Automatic Mitigation of False Sharing

July 6, 2011by emeryberger 4 Comments

Sheriff: Precise Detection and Automatic Mitigation of False Sharing Tongping Liu, Emery D. Berger, OOPSLA 2011 False sharing is an insidious problem for multithreaded programs running on multicore processors, where […]

Read Article →
Concurrency, Programming Languages
tv-bars

The Evolution is Televised

February 2, 2011by emeryberger Leave a comment

I was just at POPL and got a very nice compliment on a talk I gave on Grace from someone who watched it on-line (!). That talk was the first […]

Read Article →
Academia, Concurrency, Fault Tolerance, Memory Management
hoard-logo-small

New Hoard release

November 10, 2009by emeryberger 3 Comments

I  just released a new version of Hoard that incorporates lots of changes (one of which I described in an earlier post). This release incorporates a number of fixes and […]

Read Article →
Concurrency, Memory Management, Programming Languages
puzz-header-new

Solution: Crashes When Optimized

October 19, 2009by emeryberger 1 Comment

In the previous post, I described a “puzzler”. Here’s the brief version: After testing the code (debug build), and verifying that it worked fine, I re-ran the code in an […]

Read Article →
Concurrency
puzz-header-new

A Puzzler: Crashes When Optimized

October 16, 2009by emeryberger 3 Comments

I came across a pretty cool bug that threw me for a loop. In the spirit of Car Talk, I’m turning this into a puzzler. We have developed some cool […]

Read Article →
Concurrency
pest-control

I was wrong! And right!

October 7, 2009by emeryberger 4 Comments

Turns out I was wrong and right at the same time. I thought that the problem Thomson Reuters had discovered (detailed in the last post) was that Hoard’s spinlock implementation […]

Read Article →
Concurrency, Memory Management

Post navigation

1 2 Next →

About


Emery Berger, Professor of Computer Science at the University of Massachusetts Amherst.
Home page

Subscribe

RSS Feed RSS - Posts

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 315 other followers

Posts

  • New Scientist coverage of our AutoMan project
  • Me on PBS, Explaining Cyberattacks on Banks
  • Most Influential Paper of OOPSLA 2002: “Reconsidering Custom Memory Allocation”
  • ACM Queue article: “Software Needs Seatbelts and Airbags”
  • Software Needs Seatbelts and Airbags

Comments

  • William on latexdiff: Superb diff tool for LaTeX
  • stevenhamblin on latexdiff: Superb diff tool for LaTeX
  • Brett Kennedy on latexdiff: Superb diff tool for LaTeX

RSS UMass CS Systems Lunch

  • Robert Grimm - NYU
    When: Mon Apr 29, 2013 12pm to 1:30pm  EDT Event Status: confirmed Event Description: Title:SuperC: Parsing All of C by Taming the Preprocessor Host:Emery Berger Abstract: C tools, such as source browsers, bug finders, and automated refactorings, need to process two languages: C itself and the preprocessor. The latter improves expressivity through file inclu […]
  • Rick Hudson - Intel
    When: Mon Apr 8, 2013 12pm to 1:30pm  EDT Event Status: confirmed Event Description: Rick Hudson, Intel Corporation Host: Emery Berger Title: River Trail: Adding Data Parallelism to JavaScript Parallel hardware is today's reality and language extensions that ease exploiting its promised performance flourish. For most mainstream languages, one or more ta […]

Blogroll

  • Cliff Click's Blog
  • Embedded in Academia (John Regehr)
  • Kevin Fu's blog
  • Logistic Aggression (Hanna Wallach)
  • Matt Might's blog
  • My Biased Coin (Michael Mitzenmacher)
  • The Polylogblog (Andrew McGregor)
  • Volatile and Decentralized (Matt Welsh)

Blogroll

  • Cliff Click's Blog
  • Embedded in Academia (John Regehr)
  • Kevin Fu's blog
  • Logistic Aggression (Hanna Wallach)
  • Matt Might's blog
  • My Biased Coin (Michael Mitzenmacher)
  • My home page
  • The Polylogblog (Andrew McGregor)
  • Volatile and Decentralized (Matt Welsh)

Meta

  • Register
  • Log in
Blog at WordPress.com. | Theme: Oxygen by AlienWP.
Follow

Get every new post delivered to your Inbox.

Join 315 other followers

Powered by WordPress.com