%0 Conference Proceedings
%T Toward a Parallel Turing Machine Model
%+ Tsinghua University [Beijing] (THU)
%+ University of Delaware [Newark]
%A Qu, Peng
%A Yan, Jin
%A Gao, Guang, R.
%Z Part 6: Algorithms and Computational Models
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th IFIP International Conference on Network and Parallel Computing (NPC)
%C Xi'an, China
%Y Guang R. Gao
%Y Depei Qian
%Y Xinbo Gao
%Y Barbara Chapman
%Y Wenguang Chen
%I Springer International Publishing
%3 Network and Parallel Computing
%V LNCS-9966
%P 191-204
%8 2016-10-28
%D 2016
%R 10.1007/978-3-319-47099-3_16
%K Parallel Turing machine
%K Codelet
%K Abstract architecture
%K Parallel computing
%Z Computer Science [cs]Conference papers
%X In the field of parallel computing, the late leader Ken Kennedy, has raised a concern in early 1990s: “Is Parallel Computing Dead?” Now, we have witnessed the tremendous momentum of the “second spring” of parallel computing in recent years. But, what lesson should we learn from the history of parallel computing when we are walking out from the bottom state of the field?To this end, this paper examines the disappointing state of the work in parallel Turing machine models in the past 50 years of parallel computing research. Lacking a solid yet intuitive parallel Turing machine model will continue to be a serious challenge. Our paper presents an attempt to address this challenge — by presenting a proposal of a parallel Turing machine model — the PTM model. We also discuss why we start our work in this paper from a parallel Turing machine model instead of other choices.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01647991/document
%2 https://inria.hal.science/hal-01647991/file/432484_1_En_16_Chapter.pdf
%L hal-01647991
%U https://inria.hal.science/hal-01647991
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-9966