{"title":"超常规智慧:超线性加速和固有并行计算","authors":"S. Akl","doi":"10.1201/9781315167084-16","DOIUrl":null,"url":null,"abstract":"A number of unconventional computational problems are described in which parallelism plays a fundamental role. These problems highlight two recently uncovered aspects of parallel computation: 1. There exist computations for which the running time of a parallel algorithm, compared to that of the best sequential algorithm, shows a speedup that is superlinear in the number of processors used, a feat that was previously believed to be impossible. 2. There exist inherently parallel computations, that is, computations that can be carried successfully in parallel, but not sequentially. A surprising consequence of these discoveries is that the concept of universality in computation, long held as a basic truth, is in fact false.","PeriodicalId":54937,"journal":{"name":"International Journal of Unconventional Computing","volume":"1 1","pages":"347-366"},"PeriodicalIF":0.7000,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Unconventional Wisdom: Superlinear Speedup and Inherently Parallel Computations\",\"authors\":\"S. Akl\",\"doi\":\"10.1201/9781315167084-16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of unconventional computational problems are described in which parallelism plays a fundamental role. These problems highlight two recently uncovered aspects of parallel computation: 1. There exist computations for which the running time of a parallel algorithm, compared to that of the best sequential algorithm, shows a speedup that is superlinear in the number of processors used, a feat that was previously believed to be impossible. 2. There exist inherently parallel computations, that is, computations that can be carried successfully in parallel, but not sequentially. A surprising consequence of these discoveries is that the concept of universality in computation, long held as a basic truth, is in fact false.\",\"PeriodicalId\":54937,\"journal\":{\"name\":\"International Journal of Unconventional Computing\",\"volume\":\"1 1\",\"pages\":\"347-366\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2019-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Unconventional Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1201/9781315167084-16\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Unconventional Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1201/9781315167084-16","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Unconventional Wisdom: Superlinear Speedup and Inherently Parallel Computations
A number of unconventional computational problems are described in which parallelism plays a fundamental role. These problems highlight two recently uncovered aspects of parallel computation: 1. There exist computations for which the running time of a parallel algorithm, compared to that of the best sequential algorithm, shows a speedup that is superlinear in the number of processors used, a feat that was previously believed to be impossible. 2. There exist inherently parallel computations, that is, computations that can be carried successfully in parallel, but not sequentially. A surprising consequence of these discoveries is that the concept of universality in computation, long held as a basic truth, is in fact false.
期刊介绍:
The International Journal of Unconventional Computing offers the opportunity for rapid publication of theoretical and experimental results in non-classical computing. Specific topics include but are not limited to:
physics of computation (e.g. conservative logic, thermodynamics of computation, reversible computing, quantum computing, collision-based computing with solitons, optical logic)
chemical computing (e.g. implementation of logical functions in chemical systems, image processing and pattern recognition in reaction-diffusion chemical systems and networks of chemical reactors)
bio-molecular computing (e.g. conformation based, information processing in molecular arrays, molecular memory)
cellular automata as models of massively parallel computing
complexity (e.g. computational complexity of non-standard computer architectures; theory of amorphous computing; artificial chemistry)
logics of unconventional computing (e.g. logical systems derived from space-time behavior of natural systems; non-classical logics; logical reasoning in physical, chemical and biological systems)
smart actuators (e.g. molecular machines incorporating information processing, intelligent arrays of actuators)
novel hardware systems (e.g. cellular automata VLSIs, functional neural chips)
mechanical computing (e.g. micromechanical encryption, computing in nanomachines, physical limits to mechanical computation).