Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Revisiting the Sequential Programming Model for Multi-Core Matthew J. Bridges Neil Vachharajani Yun Zhang Thomas Jablin David I. August
 

Summary: Revisiting the Sequential Programming Model for Multi-Core
Matthew J. Bridges Neil Vachharajani Yun Zhang Thomas Jablin David I. August
Department of Computer Science
Princeton University
{mbridges, nvachhar, yunzhang, tjablin, august}@princeton.edu
Abstract
Single-threaded programming is already considered a
complicated task. The move to multi-threaded programming
only increases the complexity and cost involved in software
development due to rewriting legacy code, training of the
programmer, increased debugging of the program, and ef-
forts to avoid race conditions, deadlocks, and other prob-
lems associated with parallel programming. To address
these costs, other approaches, such as automatic thread ex-
traction, have been explored. Unfortunately, the amount of
parallelism that has been automatically extracted is gener-
ally insufficient to keep many cores busy.
This paper argues that this lack of parallelism is not an
intrinsic limitation of the sequential programming model,
but rather occurs for two reasons. First, there exists no

  

Source: August, David - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences