research-article

OoOJava: software out-of-order execution

Authors:

James Christopher Jenista,

Brian Charles DemskyAuthors Info & Claims

PPoPP '11: Proceedings of the 16th ACM symposium on Principles and practice of parallel programming

Pages 57 - 68

https://doi.org/10.1145/1941553.1941563

Published: 12 February 2011 Publication History

Abstract

Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race conditions and deadlocks into parallel software. OoOJava is a compiler-assisted approach that leverages developer annotations along with static analysis to provide an easy-to-use deterministic parallel programming model. OoOJava extends Java with a task annotation that instructs the compiler to consider a code block for out-of-order execution. OoOJava executes tasks as soon as their data dependences are resolved and guarantees that the execution of an annotated program preserves the exact semantics of the original sequential program. We have implemented OoOJava and achieved an average speedup of 16.6x on our ten benchmarks.

References

[1]

M. D. Allen, S. Sridharan et al. Serialization sets: A dynamic dependence-based parallel execution model. In PPoPP, 2009.

Digital Library

[2]

P. Bellens, J. Perez et al. CellSs: a programming model for the Cell BE architecture. SC, 2006.

Digital Library

[3]

E. D. Berger, T. Yang et al. Grace: Safe multithreaded programming for C/C++. In OOPSLA, 2009.

Digital Library

[4]

R. L. Bocchino, Jr., V. S. Adve et al. A type and effect system for deterministic parallel Java. In OOPSLA, 2009.

Digital Library

[5]

S. Borkar. Thousand core chips: A technology perspective. In DAC, 2007.

Digital Library

[6]

B. Cahoon and K. S. McKinley. Data flow analysis for software prefetching linked data structures in Java. In PACT, 2001.

Digital Library

[7]

C. Cao Minh, J. Chung et al. STAMP: Stanford transactional applications for multi-processing. In IISWC, 2008.

[8]

J.-D. Choi, M. Burke et al. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In POPL, 1993.

Digital Library

[9]

L. Dagum and R. Menon. OpenMP: An industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng., 1998.

Digital Library

[10]

K. Dai. Code parallelization for the LGDG large-grain dataflow computation. In CONPAR 90 - VAPP IV, 1990.

Digital Library

[11]

J. S. Danaher, I.-T. A. Lee et al. The JCilk language for multithreaded computing. In SCOOL, 2005.

[12]

A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In PLDI, 1994.

Digital Library

[13]

C. Ding, X. Shen et al. Software behavior oriented parallelization. In PLDI, 2007.

Digital Library

[14]

Y. Etsion, F. Cabarcas et al. Task superscalar: An out-of-order task pipeline. In MICRO, 2010.

Digital Library

[15]

C. Huang and L. V. Kale. Charisma: Orchestrating migratable parallel objects. In HPDC, 2007.

Digital Library

[16]

J. Huang, A. Raman et al. Decoupled software pipelining creates parallelization opportunities. In CGO, 2010.

Digital Library

[17]

J. C. Jenista, Y. Eom et al. Disjoint reachability analysis. Tech. Rep. UCI-ISR-10--4, University of California, Irvine, 2010.

[18]

J. C. Jenista, Y. Eom et al. OoOJava: An out-of-order approach to parallel programming. In HotPar, 2010.

Digital Library

[19]

P. Jouvelout and D. Gifford. The FX-87 interpreter. In ICCL, 1988.

[20]

H.-W. Loidl, F. Rubio et al. Comparing parallel functional languages: Programming and performance. HOSC, 2003.

Digital Library

[21]

M. Olszewski, J. Ansel et al. Kendo: Efficient deterministic multithreading in software. In ASPLOS, 2009.

Digital Library

[22]

K. H. Randall. Cilk: Efficient Multithreaded Computing. Massachusetts Institute of Technology, 1998.

Digital Library

[23]

L. Rauchwerger, N. M. Amato et al. Run-time methods for parallelizing partially parallel loops. In ICS, 1995.

Digital Library

[24]

M. C. Rinard, D. J. Scales et al. Jade: A high-level, machineindependent language for parallel programming. Computer, 1993.

Digital Library

[25]

M. Sagiv, T. Reps et al. Parametric shape analysis via 3-valued logic. TOPLAS, 2002.

Digital Library

[26]

J. H. Saltz and R. Mirchandaney. Run-time parallelization and scheduling of loops. TC, 1991.

Digital Library

[27]

L. A. Smith, J. M. Bull et al. A parallel Java Grande benchmark suite. In SC, 2001.

Digital Library

[28]

J. Subhlok and B. Yang. A new model for integrated nested task and data parallel programming. In PPoPP, 1997.

Digital Library

[29]

R. M. Tomasulo. An efficient algorithm for exploiting multiple arithmetic units. IBM J. of Res. Dev., 1967.

Digital Library

[30]

S. K. Venkata, I. Ahn et al. SD-VBS: The San Diego Vision Benchmark Suite. In IISWC, 2009.

Digital Library

[31]

C. von Praun, L. Ceze et al. Implicit parallelism with ordered transactions. In PPoPP, 2007.

Digital Library

[32]

A. Welc, S. Jagannathan et al. Safe futures for Java. In OOPSLA, 2005.

Digital Library

[33]

J. Zhou and B. Demsky. Bamboo: A data-centric, object-oriented approach to multi-core software. In PLDI, 2010.

Digital Library

Cited By

Han ZQu GLiu BZhang F(2022)Exploit the data level parallelism and schedule dependent tasks on the multi-core processorsInformation Sciences: an International Journal10.1016/j.ins.2021.10.072585:C(382-394)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1016/j.ins.2021.10.072
Wang CGong LLi XZhou X(2020)A Ubiquitous Machine Learning Accelerator With Automatic Parallelization on FPGAIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.299092431:10(2346-2359)Online publication date: 1-Oct-2020
https://doi.org/10.1109/TPDS.2020.2990924
Vandierendonck HNikolopoulos D(2019)HyperqueuesACM Transactions on Parallel Computing10.1145/33656606:4(1-35)Online publication date: 19-Nov-2019
https://dl.acm.org/doi/10.1145/3365660
Show More Cited By

Index Terms

OoOJava: software out-of-order execution
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Parallel programming languages

Recommendations

OoOJava: software out-of-order execution
PPoPP '11

Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race conditions and deadlocks into parallel software. OoOJava is a compiler-assisted ...
OoOJava: an out-of-order approach to parallel programming
HotPar'10: Proceedings of the 2nd USENIX conference on Hot topics in parallelism

Developing parallel software using current tools can be challenging. Developers must reason carefully about the use of locks to avoid both race conditions and deadlocks. We present a compiler-assisted approach to parallel programming inspired by out-of-...
Increasing the Instruction Fetch Rate via Block-Structured Instruction Set Architectures

To exploit larger amounts of instruction level parallelism, processors are being built with wider issue widths and larger numbers of functional units. Instruction fetch rate must also be increased in order to effectively exploit the performance ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPoPP '11: Proceedings of the 16th ACM symposium on Principles and practice of parallel programming

February 2011

326 pages

ISBN:9781450301190

DOI:10.1145/1941553

General Chair:
Calin Cascaval
Qualcomm Research, USA
,
Program Chair:
Pen-Chung Yew
Academia Sinica, Taiwan and University of Minnesota at Twin Cities, USA

ACM SIGPLAN Notices Volume 46, Issue 8
PPoPP '11
August 2011
300 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2038037
Issue’s Table of Contents

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 February 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PPoPP '11

Sponsor:

SIGPLAN

PPoPP '11: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

February 12 - 16, 2011

TX, San Antonio, USA

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
425
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)5

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Han ZQu GLiu BZhang F(2022)Exploit the data level parallelism and schedule dependent tasks on the multi-core processorsInformation Sciences: an International Journal10.1016/j.ins.2021.10.072585:C(382-394)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1016/j.ins.2021.10.072
Wang CGong LLi XZhou X(2020)A Ubiquitous Machine Learning Accelerator With Automatic Parallelization on FPGAIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.299092431:10(2346-2359)Online publication date: 1-Oct-2020
https://doi.org/10.1109/TPDS.2020.2990924
Vandierendonck HNikolopoulos D(2019)HyperqueuesACM Transactions on Parallel Computing10.1145/33656606:4(1-35)Online publication date: 19-Nov-2019
https://dl.acm.org/doi/10.1145/3365660
Fan XSinnen OGiacaman N(2019)Supporting asynchronization in OpenMP for event-driven programmingParallel Computing10.1016/j.parco.2018.03.00882:C(57-74)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1016/j.parco.2018.03.008
Fan XSinnen OGiacaman N(2018)Balancing parallelization and asynchronization in event‐driven programs with OpenMPConcurrency and Computation: Practice and Experience10.1002/cpe.495931:4Online publication date: 21-Sep-2018
https://doi.org/10.1002/cpe.4959
Wang CGong LWang ALi XHung PXuehai Z(2017)SOLAR: Services-oriented Deep Learning ArchitecturesIEEE Transactions on Services Computing10.1109/TSC.2017.2777478(1-1)Online publication date: 2017
https://doi.org/10.1109/TSC.2017.2777478
Guo QLi XWang CZhou X(2016)Evaluation and Tradeoffs for Out-of-Order Execution on Reconfigurable Heterogeneous MPSoCIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2015.238989324:1(79-91)Online publication date: Jan-2016
https://doi.org/10.1109/TVLSI.2015.2389893
Papakonstantinou NZakkak FPratikakis P(2016)Hierarchical Parallel Dynamic Dependence Analysis for Recursively Task-Parallel Programs2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2016.53(933-942)Online publication date: May-2016
https://doi.org/10.1109/IPDPS.2016.53
Fonseca ACabral BRafael JCorreia I(2016)Automatic ParallelizationInternational Journal of Parallel Programming10.1007/s10766-016-0426-544:6(1337-1358)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1007/s10766-016-0426-5
Streit KDoerfert JHammacher CZeller AHack S(2015)Generalized Task ParallelismACM Transactions on Architecture and Code Optimization10.1145/272316412:1(1-25)Online publication date: 2-Apr-2015
https://dl.acm.org/doi/10.1145/2723164
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents