Implicit parallelism

In computer science, implicit parallelism is a characteristic of a programming language that allows a compiler or interpreter to automatically exploit the parallelism inherent to the computations expressed by some of the language's constructs. A pure implicitly parallel language does not need special directives, operators or functions to enable parallel execution, in contrast to explicit parallelism.

Programming languages with implicit parallelism include Axum, Binary Modular Dataflow Machine (BMDFM), High Performance Fortran (HPF), Id, LabVIEW, MATLAB M-code, NESL, Single Assignment C (SAC), Streams and Iteration in a Single Assignment Language (SISAL), Z-level programming language (ZPL), and pH.

This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.