Advanced search
1 file | 323.52 KB Add to list
Author
Organization
Abstract
The efficient development of multi-threaded software has, for many years, been an unsolved problem in computer science. Finding a solution to this problem has become urgent with the advent of multi-core processors. Furthermore, the problem has become more complicated because multi-cores are everywhere (desktop, laptop, embedded system). As such, they execute generic programs which exhibit very different characteristics than the scientific applications that have been the focus of parallel computing in the past. Implicitly parallel programming is an approach to parallel pro- gramming that promises high productivity and efficiency and rules out synchronization errors and race conditions by design. There are two main ingredients to implicitly parallel programming: (i) a con- ventional sequential programming language that is extended with annotations that describe the semantics of the program and (ii) an automatic parallelizing compiler that uses the annotations to in- crease the degree of parallelization. It is extremely important that the annotations and the automatic parallelizing compiler are designed with the target application do- main in mind. In this paper, we discuss the Paralax approach to im- plicitly parallel programming and we review how the annotations and the compiler design help to successfully parallelize generic programs. We evaluate Paralax on SPECint benchmarks, which are a model for such programs, and demonstrate scalable speedups, up to a factor of 6 on 8 cores.
Keywords
Automatic parallelization, semantic annotations

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 323.52 KB

Citation

Please use this url to cite or link to this publication:

MLA
Vandierendonck, Hans, and Koen De Bosschere. “Automatic Parallelization in the Paralax Compiler.” SCOPES  ’11 : Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems. New York, NY, USA: Association for Computing Machinery (ACM), 2011. 56–63. Print.
APA
Vandierendonck, H., & De Bosschere, K. (2011). Automatic parallelization in the paralax compiler. SCOPES  ’11 : proceedings of the 14th international workshop on software and compilers for embedded systems (pp. 56–63). Presented at the 14th International workshop on Software and Compilers for Embedded Systems (SCOPES 2011), New York, NY, USA: Association for Computing Machinery (ACM).
Chicago author-date
Vandierendonck, Hans, and Koen De Bosschere. 2011. “Automatic Parallelization in the Paralax Compiler.” In SCOPES  ’11 : Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems, 56–63. New York, NY, USA: Association for Computing Machinery (ACM).
Chicago author-date (all authors)
Vandierendonck, Hans, and Koen De Bosschere. 2011. “Automatic Parallelization in the Paralax Compiler.” In SCOPES  ’11 : Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems, 56–63. New York, NY, USA: Association for Computing Machinery (ACM).
Vancouver
1.
Vandierendonck H, De Bosschere K. Automatic parallelization in the paralax compiler. SCOPES  ’11 : proceedings of the 14th international workshop on software and compilers for embedded systems. New York, NY, USA: Association for Computing Machinery (ACM); 2011. p. 56–63.
IEEE
[1]
H. Vandierendonck and K. De Bosschere, “Automatic parallelization in the paralax compiler,” in SCOPES ’11 : proceedings of the 14th international workshop on software and compilers for embedded systems, St Groar, Germany, 2011, pp. 56–63.
@inproceedings{1864709,
  abstract     = {The efficient development of multi-threaded software has, for many years, been an unsolved problem in computer science. Finding a solution to this problem has become urgent with the advent of multi-core processors. Furthermore, the problem has become more complicated because multi-cores are everywhere (desktop, laptop, embedded system). As such, they execute generic programs which exhibit very different characteristics than the scientific applications that have been the focus of parallel computing in the past.
Implicitly parallel programming is an approach to parallel pro- gramming that promises high productivity and efficiency and rules out synchronization errors and race conditions by design. There are two main ingredients to implicitly parallel programming: (i) a con- ventional sequential programming language that is extended with annotations that describe the semantics of the program and (ii) an automatic parallelizing compiler that uses the annotations to in- crease the degree of parallelization.
It is extremely important that the annotations and the automatic parallelizing compiler are designed with the target application do- main in mind. In this paper, we discuss the Paralax approach to im- plicitly parallel programming and we review how the annotations and the compiler design help to successfully parallelize generic programs. We evaluate Paralax on SPECint benchmarks, which are a model for such programs, and demonstrate scalable speedups, up to a factor of 6 on 8 cores.},
  author       = {Vandierendonck, Hans and De Bosschere, Koen},
  booktitle    = {SCOPES '11 : proceedings of the 14th international workshop on software and compilers for embedded systems},
  isbn         = {9781450307635},
  keywords     = {Automatic parallelization,semantic annotations},
  language     = {eng},
  location     = {St Groar, Germany},
  pages        = {56--63},
  publisher    = {Association for Computing Machinery (ACM)},
  title        = {Automatic parallelization in the paralax compiler},
  year         = {2011},
}