An extended PRAM-NUMA model of computation for TCF programming

Martti Forsell, V. Leppänen

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    2 Citations (Scopus)

    Abstract

    The Parallel Random Access Machine - Non Uniform Memory Access (PRAM-NUMA) model of computation can be used to implement efficient emulated shared memory (ESM) computers for general purpose parallel applications and yet support sequential and NUMA legacy code and avoid loss of performance in applications with low parallelism. While programming of these computers is provably easy, there is still room for improvement since they make implementing time-shared multitasking expensive, sometimes replicate much of the execution unnecessarily, and force a programmer to use looping and conditional control primitives in the case the application parallelism does not match the hardware parallelism. Thick Control Flow (TCF) is a parallel programming model that does not provide a fixed number of threads like PRAM-NUMA but a number of control flows that have certain thickness that can vary according to needs of the application catching the best parts of the dynamicism and generality of the original unbounded PRAM model and simplicity of the Single Instruction Stream Multiple Data Streams (SIMD) model. In this paper we study implementing the TCF model on a top of the PRAM-NUMA model and propose an extended PRAM-NUMA model that makes this straight-forward. Architectural implementation and programming of the extended model are discussed with short examples
    Original languageEnglish
    Title of host publicationProceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012
    PublisherIEEE Institute of Electrical and Electronic Engineers
    Pages786-793
    ISBN (Print)978-0-7695-4676-6, 978-1-4673-0974-5
    DOIs
    Publication statusPublished - 2012
    MoE publication typeNot Eligible
    Event26th International Parallel and Distributed Processing Symposium, IPDPSW 2012 - Shanghai, China
    Duration: 21 May 201225 May 2012
    Conference number: 26

    Conference

    Conference26th International Parallel and Distributed Processing Symposium, IPDPSW 2012
    Abbreviated titleIPDPSW 2012
    CountryChina
    CityShanghai
    Period21/05/1225/05/12

    Fingerprint

    Computer programming
    Flow control
    Data storage equipment
    Multitasking
    Parallel programming
    Hardware

    Keywords

    • Models of computation
    • NUMA
    • parallel computing
    • PRAM
    • programming model
    • thick control flow

    Cite this

    Forsell, M., & Leppänen, V. (2012). An extended PRAM-NUMA model of computation for TCF programming. In Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 (pp. 786-793). IEEE Institute of Electrical and Electronic Engineers . https://doi.org/10.1109/IPDPSW.2012.97
    Forsell, Martti ; Leppänen, V. / An extended PRAM-NUMA model of computation for TCF programming. Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. IEEE Institute of Electrical and Electronic Engineers , 2012. pp. 786-793
    @inproceedings{68333ad4a8b84695bc498f8769952169,
    title = "An extended PRAM-NUMA model of computation for TCF programming",
    abstract = "The Parallel Random Access Machine - Non Uniform Memory Access (PRAM-NUMA) model of computation can be used to implement efficient emulated shared memory (ESM) computers for general purpose parallel applications and yet support sequential and NUMA legacy code and avoid loss of performance in applications with low parallelism. While programming of these computers is provably easy, there is still room for improvement since they make implementing time-shared multitasking expensive, sometimes replicate much of the execution unnecessarily, and force a programmer to use looping and conditional control primitives in the case the application parallelism does not match the hardware parallelism. Thick Control Flow (TCF) is a parallel programming model that does not provide a fixed number of threads like PRAM-NUMA but a number of control flows that have certain thickness that can vary according to needs of the application catching the best parts of the dynamicism and generality of the original unbounded PRAM model and simplicity of the Single Instruction Stream Multiple Data Streams (SIMD) model. In this paper we study implementing the TCF model on a top of the PRAM-NUMA model and propose an extended PRAM-NUMA model that makes this straight-forward. Architectural implementation and programming of the extended model are discussed with short examples",
    keywords = "Models of computation, NUMA, parallel computing, PRAM, programming model, thick control flow",
    author = "Martti Forsell and V. Lepp{\"a}nen",
    year = "2012",
    doi = "10.1109/IPDPSW.2012.97",
    language = "English",
    isbn = "978-0-7695-4676-6",
    pages = "786--793",
    booktitle = "Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012",
    publisher = "IEEE Institute of Electrical and Electronic Engineers",
    address = "United States",

    }

    Forsell, M & Leppänen, V 2012, An extended PRAM-NUMA model of computation for TCF programming. in Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. IEEE Institute of Electrical and Electronic Engineers , pp. 786-793, 26th International Parallel and Distributed Processing Symposium, IPDPSW 2012, Shanghai, China, 21/05/12. https://doi.org/10.1109/IPDPSW.2012.97

    An extended PRAM-NUMA model of computation for TCF programming. / Forsell, Martti; Leppänen, V.

    Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. IEEE Institute of Electrical and Electronic Engineers , 2012. p. 786-793.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    TY - GEN

    T1 - An extended PRAM-NUMA model of computation for TCF programming

    AU - Forsell, Martti

    AU - Leppänen, V.

    PY - 2012

    Y1 - 2012

    N2 - The Parallel Random Access Machine - Non Uniform Memory Access (PRAM-NUMA) model of computation can be used to implement efficient emulated shared memory (ESM) computers for general purpose parallel applications and yet support sequential and NUMA legacy code and avoid loss of performance in applications with low parallelism. While programming of these computers is provably easy, there is still room for improvement since they make implementing time-shared multitasking expensive, sometimes replicate much of the execution unnecessarily, and force a programmer to use looping and conditional control primitives in the case the application parallelism does not match the hardware parallelism. Thick Control Flow (TCF) is a parallel programming model that does not provide a fixed number of threads like PRAM-NUMA but a number of control flows that have certain thickness that can vary according to needs of the application catching the best parts of the dynamicism and generality of the original unbounded PRAM model and simplicity of the Single Instruction Stream Multiple Data Streams (SIMD) model. In this paper we study implementing the TCF model on a top of the PRAM-NUMA model and propose an extended PRAM-NUMA model that makes this straight-forward. Architectural implementation and programming of the extended model are discussed with short examples

    AB - The Parallel Random Access Machine - Non Uniform Memory Access (PRAM-NUMA) model of computation can be used to implement efficient emulated shared memory (ESM) computers for general purpose parallel applications and yet support sequential and NUMA legacy code and avoid loss of performance in applications with low parallelism. While programming of these computers is provably easy, there is still room for improvement since they make implementing time-shared multitasking expensive, sometimes replicate much of the execution unnecessarily, and force a programmer to use looping and conditional control primitives in the case the application parallelism does not match the hardware parallelism. Thick Control Flow (TCF) is a parallel programming model that does not provide a fixed number of threads like PRAM-NUMA but a number of control flows that have certain thickness that can vary according to needs of the application catching the best parts of the dynamicism and generality of the original unbounded PRAM model and simplicity of the Single Instruction Stream Multiple Data Streams (SIMD) model. In this paper we study implementing the TCF model on a top of the PRAM-NUMA model and propose an extended PRAM-NUMA model that makes this straight-forward. Architectural implementation and programming of the extended model are discussed with short examples

    KW - Models of computation

    KW - NUMA

    KW - parallel computing

    KW - PRAM

    KW - programming model

    KW - thick control flow

    U2 - 10.1109/IPDPSW.2012.97

    DO - 10.1109/IPDPSW.2012.97

    M3 - Conference article in proceedings

    SN - 978-0-7695-4676-6

    SN - 978-1-4673-0974-5

    SP - 786

    EP - 793

    BT - Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

    PB - IEEE Institute of Electrical and Electronic Engineers

    ER -

    Forsell M, Leppänen V. An extended PRAM-NUMA model of computation for TCF programming. In Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. IEEE Institute of Electrical and Electronic Engineers . 2012. p. 786-793 https://doi.org/10.1109/IPDPSW.2012.97