Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimistic Parallelism Requires Abstractions Milind Kulkarni ,
 

Summary: Optimistic Parallelism Requires Abstractions
Milind Kulkarni ,
Keshav Pingali
Department of Computer Science,
University of Texas, Austin.
{milind, pingali}@cs.utexas.edu
Bruce Walter, Ganesh Ramanarayanan,
Kavita Bala , L. Paul Chew
Department of Computer Science,
Cornell University, Ithaca, New York.
bjw@graphics.cornell.edu,
{graman,kb,chew}@cs.cornell.edu
Abstract
Irregular applications, which manipulate large, pointer-based data
structures like graphs, are difficult to parallelize manually. Auto-
matic tools and techniques such as restructuring compilers and run-
time speculative execution have failed to uncover much parallelism
in these applications, in spite of a lot of effort by the research com-
munity. These difficulties have even led some researchers to won-
der if there is any coarse-grain parallelism worth exploiting in ir-

  

Source: Agrawal, Gagan - Department of Computer Science and Engineering, Ohio State University
Kazhdan, Michael - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences