research-article

Prospect: a compiler framework for speculative parallelization

Authors:

Martin Süßkraut,

Stefan Weigert,

Martin Meinhold, and

Christof FetzerAuthors Info & Claims

CGO '10: Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization

April 2010

Pages 131 - 140

https://doi.org/10.1145/1772954.1772974

Published: 24 April 2010 Publication History

Abstract

Making efficient use of modern multi-core and future many-core CPUs is a major challenge. We describe a new compiler-based platform, Prospect, that supports the parallelization of sequential applications. The underlying approach is a generalization of an existing approach to parallelize runtime checks. The basic idea is to generate two variants of the application: (1) a fast variant having bare bone functionality, and (2) a slow variant with extra functionality. The fast variant is executed sequentially. Its execution is divided into epochs.

Each epoch is re-executed by an executor using the slow variant. The approach scales by running the executors on multiple cores in parallel to each other and to the fast variant. We have implemented the Prospect framework to evaluate this approach. Prospect allows custom plug-ins for generating the fast and slow variants. With the help of our novel StackLifter, a process can switch between the fast variant and the slow variant during runtime at arbitrary positions.

References

[1]

P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson. Practical improvements to the construction and destruction of static single assignment form. Softw. Pract. Exper., 28(8):859--881, 1998. ISSN 0038-0644.

Digital Library

[2]

C. Cao Minh, J. Chung, C. Kozyrakis, and K. Olukotun. Stamp: Stanford transactional applications for multi-processing. In IISWC '08: Proceedings of The IEEE International Symposium on Workload Characterization, September 2008.

[3]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst., 13(4):451--490, 1991. ISSN 0164-0925.

Digital Library

[4]

S. J. Fink and F. Qian. Design, implementation and evaluation of adaptive recompilation with on--stack replacement. In CGO '03: Proceedings of the international symposium on Code generation and optimization, pages 241--252, Washington, DC, USA, 2003. IEEE Computer Society. ISBN 0-7695-1913-X.

Digital Library

[5]

K. Kelsey, T. Bai, C. Ding, and C. Zhang. Fast track: A software system for speculative program optimization. In CGO '09: Proceedings of the 2009 International Symposium on Code Generation and Optimization, pages 157--168, Washington, DC, USA, 2009. IEEE Computer Society. ISBN 978-0-7695-3576-0.

Digital Library

[6]

C. Lattner and V. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO'04), California, 2004.

Digital Library

[7]

C.-K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V. J. Reddi, and K. Hazelwood. Pin: building customized program analysis tools with dynamic instrumentation. In PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pages 190--200, New York, NY, USA, 2005. ACM. ISBN 1-59593-056-6.

Digital Library

[8]

K. Makris and R. A. Bazzi. Immediate Multi-Threaded Dynamic Software Updates Using Stack Reconstruction. In Proceedings of the USENIX '09 Annual Technical Conference, June 2009.

Digital Library

[9]

B. Meyer. Object-Oriented Software Construction. Prentice Hall PTR, March 2000. ISBN 0136291554.

Digital Library

[10]

J. M. L. Munoz. Boost.multiindex example of use of sequenced indices. http://www.boost.org/libs/multi index, September 2009. Version 1.34.

[11]

I. Neamtiu, M. Hicks, G. Stoyle, and M. Oriol. Practical dynamic software updating for c. SIGPLAN Not., 41(6):72---83, 2006. ISSN 0362-1340.

Digital Library

[12]

J. Newsome and D. Song. Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In Proceedings of the Network and Distributed System Security Symposium (NDSS 2005), 2005.

[13]

E. B. Nightingale, P. M. Chen, and J. Flinn. Speculative execution in a distributed file system. SIGOPS Oper. Syst. Rev., 39(5):191--205, 2005. ISSN 0163-5980.

Digital Library

[14]

E. B. Nightingale, D. Peek, P. M. Chen, and J. Flinn. Parallelizing security checks on commodity hardware. SIGARCH Comput. Archit. News, 36 :308--318, 2008.

Digital Library

[15]

O. Ruwase, P. B. Gibbons, T. C. Mowry, V. Ramachandran, S. Chen, M. Kozuch, and M. Ryan. Parallelizing dynamic information flow tracking. In SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, pages 35--45, New York, NY, USA, 2008. ACM. ISBN 978-1-59593-973-9.

Digital Library

[16]

S. M. Srinivasan, S. Kandula, C. R. Andrews, and Y. Zhou. Flashback: a lightweight extension for rollback and deterministic replay for software debugging. In ATEC '04: Proceedings of the annual conference on USENIX Annual Technical Conference, pages 3--3, Berkeley, CA, USA, 2004. USENIX Association.

Digital Library

[17]

M. Sußkraut, S. Weigert, U. Schiffel, T. Knauth, M. Nowack, D. Becker de Brum, and C. Fetzer. Speculation for parallelizing runtime checks. In Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), 2009.

Digital Library

[18]

S. Wallace and K. Hazelwood. Superpin: Parallelizing dynamic instrumentation for real-time performance. In CGO '07: Proceedings of the International Symposium on Code Generation and Optimization, pages 209--220, Washington, DC, USA, 2007. IEEE Computer Society. ISBN 0-7695-2764-7.

Digital Library

[19]

C. Zilles and G. Sohi. Master/slave speculative parallelization. In MICRO 35: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, pages 85--96, Los Alamitos, CA, USA, 2002. IEEE Computer Society Press. ISBN 0-7695-1859-1.

Digital Library

Cited By

Reumont-Locke FEzzati-Jivan NDagenais M(2019)Efficient Methods for Trace Analysis ParallelizationInternational Journal of Parallel Programming10.1007/s10766-019-00631-4Online publication date: 9-Feb-2019
https://doi.org/10.1007/s10766-019-00631-4
Yan XJoa AWong BCassell BSzepesi TNaouach MLam DPierre GFerreira PShrira L(2018)SpecRPCProceedings of the 19th International Middleware Conference10.1145/3274808.3274829(266-278)Online publication date: 26-Nov-2018
https://dl.acm.org/doi/10.1145/3274808.3274829
Zhang TLee DJung C(2016)TxRaceACM SIGARCH Computer Architecture News10.1145/2980024.287238444:2(159-173)Online publication date: 25-Mar-2016
https://dl.acm.org/doi/10.1145/2980024.2872384
Show More Cited By

Index Terms

Prospect: a compiler framework for speculative parallelization
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Enabling scalability-sensitive speculative parallelization for FSM computations
ICS '17: Proceedings of the International Conference on Supercomputing

Finite state machines (FSMs) are the backbone of many applications, but are difficult to parallelize due to their inherent dependencies. Speculative FSM parallelization has shown promise on multicore machines with up to eight cores. However, as hardware ...
Read More
Leveraging GPUs using cooperative loop speculation

Graphics processing units, or GPUs, provide TFLOPs of additional performance potential in commodity computer systems that frequently go unused by most applications. Even with the emergence of languages such as CUDA and OpenCL, programming GPUs remains a ...
Read More
Unconventional Parallelization of Nondeterministic Applications
ASPLOS '18: Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems

The demand for thread-level-parallelism (TLP) on commodity processors is endless as it is essential for gaining performance and saving energy. However, TLP in today's programs is limited by dependences that must be satisfied at run time. We have found ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CGO '10: Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization

April 2010

300 pages

ISBN:9781605586359

DOI:10.1145/1772954

General Chairs:
Andreas Moshovos
University of Toronto
,
Greg Steffan
University of Toronto
,
Program Chairs:
Kim Hazelwood
University of Virginia
,
David Kaeli
Northeastern University

Copyright © 2010 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

In-Cooperation

IEEE CS uArch

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 April 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CGO '10

Sponsor:

CGO '10: 8th Annual IEEE/ ACM International Symposium on Code Generation and Optimization

April 24 - 28, 2010

Ontario, Toronto, Canada

Acceptance Rates

Overall Acceptance Rate 312 of 1,061 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
428
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Reumont-Locke FEzzati-Jivan NDagenais M(2019)Efficient Methods for Trace Analysis ParallelizationInternational Journal of Parallel Programming10.1007/s10766-019-00631-4Online publication date: 9-Feb-2019
https://doi.org/10.1007/s10766-019-00631-4
Yan XJoa AWong BCassell BSzepesi TNaouach MLam DPierre GFerreira PShrira L(2018)SpecRPCProceedings of the 19th International Middleware Conference10.1145/3274808.3274829(266-278)Online publication date: 26-Nov-2018
https://dl.acm.org/doi/10.1145/3274808.3274829
Zhang TLee DJung C(2016)TxRaceACM SIGARCH Computer Architecture News10.1145/2980024.287238444:2(159-173)Online publication date: 25-Mar-2016
https://dl.acm.org/doi/10.1145/2980024.2872384
Zhang TLee DJung C(2016)TxRaceACM SIGOPS Operating Systems Review10.1145/2954680.287238450:2(159-173)Online publication date: 25-Mar-2016
https://doi.org/10.1145/2954680.2872384
Zhang TLee DJung C(2016)TxRaceACM SIGPLAN Notices10.1145/2954679.287238451:4(159-173)Online publication date: 25-Mar-2016
https://dl.acm.org/doi/10.1145/2954679.2872384
Zhang TLee DJung CConte TZhou Y(2016)TxRaceProceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/2872362.2872384(159-173)Online publication date: 25-Mar-2016
https://dl.acm.org/doi/10.1145/2872362.2872384
D'Elia DDemetrescu CFranke BWu YRastello F(2016)Flexible on-stack replacement in LLVMProceedings of the 2016 International Symposium on Code Generation and Optimization10.1145/2854038.2854061(250-260)Online publication date: 29-Feb-2016
https://dl.acm.org/doi/10.1145/2854038.2854061
Ouyang JChen PFlinn JNarayanasamy S(2013)...and region serializability for allProceedings of the 5th USENIX Conference on Hot Topics in Parallelism10.5555/3241639.3241651(12-12)Online publication date: 24-Jun-2013
https://dl.acm.org/doi/10.5555/3241639.3241651
Lameed NHendren L(2013)A modular approach to on-stack replacement in LLVMACM SIGPLAN Notices10.1145/2517326.245154148:7(143-154)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2517326.2451541
Wester BDevecsery DChen PFlinn JNarayanasamy S(2013)Parallelizing data race detectionACM SIGPLAN Notices10.1145/2499368.245112048:4(27-38)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2499368.2451120
Show More Cited By

View Options

Get Access

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