Skip to main content
SpringerLink
Log in

Automatic Parallelization Using AutoFutures

  • Conference paper
Multicore Software Engineering, Performance, and Tools (MSEPT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7303))

Abstract

Practically all new computer systems are parallel. The minds of the majority of software engineers are not, and most of existing source code is still sequential. Within only a few years, multicore processors changed the system landscape, but the competence to reengineer for computer systems of today is shared among a small community of software engineers.

In this paper we present AutoFuture, an approach that automatically identifies parallelizable locations in sequential source code and reengineers them for multicore. This approach demands minimal change to sequential source code. AutoFutures make parallel code easy to understand and increase the acceptance of parallel software.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garcia, S., Jeon, D., Louie, C.M., Taylor, M.B.: Kremlin: rethinking and rebooting gprof for the multicore age. In: Proceedings of the 32nd PLDI (2011)

    Google Scholar 

  2. Benton, W.C.: Fast, effective program analysis for object-level parallelism. Ph.D. dissertation, University of Wisconsin at Madison (2008)

    Google Scholar 

  3. Tournavitis, G., Franke, B.: Semi-automatic extraction and exploitation of hierarchical pipeline parallelism using profiling information. In: Proceedings of the 19th PACT (2010)

    Google Scholar 

  4. Hammacher, C., Streit, K., Hack, S., Zeller, A.: Profiling java programs for parallelism. In: Proceedings of the 2nd IWMSE (2009)

    Google Scholar 

  5. http://www.sable.mcgill.ca/soot/

  6. http://dacapobench.org/

Download references

Author information

Authors and Affiliations

  1. Karlsruhe Institute of Technology, 76128, Karlsruhe, Germany

    Korbinian Molitorisz, Jochen Schimmel & Frank Otto

Authors
  1. Korbinian Molitorisz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jochen Schimmel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IPD, Karlsruhe Institute of Technology, 76128, Karlsruhe, Germany

    Victor Pankratius

  2. Computer Science Department, Programming Systems Group, University of Erlangen-Nuremberg, Martensstr. 3, 91058, Erlangen, Germany

    Michael Philippsen

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Molitorisz, K., Schimmel, J., Otto, F. (2012). Automatic Parallelization Using AutoFutures. In: Pankratius, V., Philippsen, M. (eds) Multicore Software Engineering, Performance, and Tools. MSEPT 2012. Lecture Notes in Computer Science, vol 7303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31202-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31202-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31201-4

  • Online ISBN: 978-3-642-31202-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation