Cargando…

Shared memory and message passing revisited in the many-core era

<!--HTML-->In the 70s, Edsgar Dijkstra, Per Brinch Hansen and C.A.R Hoare introduced the fundamental concepts for concurrent computing. It was clear that concrete communication mechanisms were required in order to achieve effective concurrency. Whether you're developing a multithreaded p...

Descripción completa

Detalles Bibliográficos
Autor principal: SANTOGIDIS, Aram
Lenguaje:eng
Publicado: 2016
Materias:
Acceso en línea:http://cds.cern.ch/record/2136010
_version_ 1780949954591719424
author SANTOGIDIS, Aram
author_facet SANTOGIDIS, Aram
author_sort SANTOGIDIS, Aram
collection CERN
description <!--HTML-->In the 70s, Edsgar Dijkstra, Per Brinch Hansen and C.A.R Hoare introduced the fundamental concepts for concurrent computing. It was clear that concrete communication mechanisms were required in order to achieve effective concurrency. Whether you're developing a multithreaded program running on a single node, or a distributed system spanning over hundreds of thousands cores, the choice of the communication mechanism for your system must be done intelligently because of the implicit programmability, performance and scalability trade-offs. With the emergence of many-core computing architectures many assumptions may not be true anymore. In this talk we will try to provide insight on the characteristics of these communication models by providing basic theoretical background and then focus on concrete practical examples based on indicative use case scenarios. The case studies of this presentation cover popular programming models, operating systems and concurrency frameworks in the context of many-core processors.
id cern-2136010
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2016
record_format invenio
spelling cern-21360102022-11-02T22:32:25Zhttp://cds.cern.ch/record/2136010engSANTOGIDIS, AramShared memory and message passing revisited in the many-core erainverted CERN School of Computing 2016inverted CSC<!--HTML-->In the 70s, Edsgar Dijkstra, Per Brinch Hansen and C.A.R Hoare introduced the fundamental concepts for concurrent computing. It was clear that concrete communication mechanisms were required in order to achieve effective concurrency. Whether you're developing a multithreaded program running on a single node, or a distributed system spanning over hundreds of thousands cores, the choice of the communication mechanism for your system must be done intelligently because of the implicit programmability, performance and scalability trade-offs. With the emergence of many-core computing architectures many assumptions may not be true anymore. In this talk we will try to provide insight on the characteristics of these communication models by providing basic theoretical background and then focus on concrete practical examples based on indicative use case scenarios. The case studies of this presentation cover popular programming models, operating systems and concurrency frameworks in the context of many-core processors.oai:cds.cern.ch:21360102016
spellingShingle inverted CSC
SANTOGIDIS, Aram
Shared memory and message passing revisited in the many-core era
title Shared memory and message passing revisited in the many-core era
title_full Shared memory and message passing revisited in the many-core era
title_fullStr Shared memory and message passing revisited in the many-core era
title_full_unstemmed Shared memory and message passing revisited in the many-core era
title_short Shared memory and message passing revisited in the many-core era
title_sort shared memory and message passing revisited in the many-core era
topic inverted CSC
url http://cds.cern.ch/record/2136010
work_keys_str_mv AT santogidisaram sharedmemoryandmessagepassingrevisitedinthemanycoreera
AT santogidisaram invertedcernschoolofcomputing2016