2026-09-19T11:58:13Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/19109 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Loui, Michael C. Mak, Ka Ho 2011-05-07T11:57:13Z 2011-05-07T11:57:13Z 10000-01-01 1995 "In this thesis, we address the following question: Are parallel machines always faster than sequential machines? Our approach is to examine the common machine models of sequential computation. For each such machine ${\cal M}$ that runs in time T, we determine whether it is possible to speed up ${\cal M}$ by a ""parallel version"" ${\cal M}\sp\prime$ of ${\cal M}$ that runs in time o(T). We find that the answer is affirmative for a wide range of machine models, including the tree Turing machine, the multidimensional Turing machine, the log-cost RAM (random access machine), the unit-cost RAM, and the pointer machine. All previous speedup results either relied on the severe limitation on the storage structure of ${\cal M}$ (e.g., ${\cal M}\sp\prime$ was a Turing machine with linear tapes) or required that ${\cal M}\sp\prime$ had a more versatile storage structure than ${\cal M}$ (e.g., ${\cal M}\sp\prime$ was a PRAM (parallel RAM), and ${\cal M}$ was a Turing machine with linear tapes). It was unclear whether it was the parallelism or the restriction on the storage structures (or the combination of both) that realized such speedup. We remove the above restrictions on storage structures in previous results. We present speedup theorems where the storage medium of ${\cal M}\sp\prime$ is the same as (or even weaker than) that of ${\cal M}$. Hence, parallelism alone suffices to achieve a speedup. One implication is that there does not exist any recursive function that is ""inherently not parallelizable.""" Made available in DSpace on 2011-05-07T11:57:13Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9543665.pdf: 3638359 bytes, checksum: 6b189a26abfab53b62a65de0656a5507 (MD5) Previous issue date: 1995 Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:34:43Z Item is restricted indefinitely. Restriction data tranferred 2014-07-01T11:13:23-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission ETDs are only available to UIUC Users without author permission U of I Only AAI9543665 (UMI)AAI9543665 http://hdl.handle.net/2142/19109 eng Copyright 1995 Mak, Ka Ho Computer Science The power of parallel time text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.