General purpose parallel architectures
LG Valiant - Algorithms and Complexity, 1990 - Elsevier
Publisher Summary This chapter focuses on general purpose parallel architectures.
Multiprocessor parallel computation has been considered in the context of problems with …
Multiprocessor parallel computation has been considered in the context of problems with …
Parallel algorithms for shared-memory machines
V Ramachandran - Algorithms and Complexity, 1990 - Elsevier
Publisher Summary This chapter discusses parallel algorithms for shared-memory
machines. Parallel computation is rapidly becoming a dominant theme in all areas of …
machines. Parallel computation is rapidly becoming a dominant theme in all areas of …
[PDF][PDF] Random access machines with multi-dimensional memories
JM Robson - Information processing letters, 1990 - academia.edu
In discussions of complexity of random access machines (RAMS) it is convenient to use a
high level language such as the RAM-algol defined in [l] to demonstrate algorithms. This …
high level language such as the RAM-algol defined in [l] to demonstrate algorithms. This …
A note on the almost-everywhere hierarchy for nondeterministic time
A note on the almost-everywhere hierarchy for nondeterministic time Page 1 A Note on the
Almost-Everywhere Hierarchy for Nondeterministic Time Eric Allender* Department of Computer …
Almost-Everywhere Hierarchy for Nondeterministic Time Eric Allender* Department of Computer …
Normalizing and accelerating RAM computations and the problem of reasonable space measures
J Wiedermann - International Colloquium on Automata, Languages …, 1990 - Springer
It is shown that any RAM of logarithmic time complexity T (n) can be simulated in linear
logarithmic time by a RAM that uses only its O (T 2 (n)/log T (n)) first registers, each of them …
logarithmic time by a RAM that uses only its O (T 2 (n)/log T (n)) first registers, each of them …
[图书][B] Computational complexity of random-access models
DR Luginbuhl - 1990 - search.proquest.com
The relative power of several computational models is considered. These models are the
Turing machine and its multidimensional variant, the random access machine (RAM), the …
Turing machine and its multidimensional variant, the random access machine (RAM), the …
Experience with MIMD message-passing systems: Towards general purpose parallel computing
AJG Hey - Workshop on Parallel Database Systems, 1990 - Springer
The paper discusses the parallel programming lessons learnt from the ESPRIT SuperNode
project that developed the T800 Transputer. After a brief review of some purportedly portable …
project that developed the T800 Transputer. After a brief review of some purportedly portable …
[图书][B] Parallel complexity of discrete problems
L Chen - 1990 - search.proquest.com
Processor complexity and time complexity are two important measures of the efficiency of
parallel algorithms. A problem is said to be in NC if it can be solved in polylogarithmic time …
parallel algorithms. A problem is said to be in NC if it can be solved in polylogarithmic time …
Strong time bounds: non-computable bounds and a hierarchy theorem
JM Robson - Theoretical computer science, 1990 - Elsevier
A RAM program is said to run within a “strong” time bound T if on every sequence of n inputs
it terminates within T (n) instruction executions. There are some programs whose execution …
it terminates within T (n) instruction executions. There are some programs whose execution …
メモリ型並列計算モデルとその計算能カ-スーパコンピュータへの第3 のアブローチ
高木直史， 武永康彦， 矢島脩三 - 情報処理学会論文誌, 1990 - ipsj.ixsq.nii.ac.jp
論文抄録 高い集積度の得られるメモリに若干の機能を付加した並列計算機構を考え
これを並列計算モデルとして形式化し その計算能力を明らかにすることは 実用的にも …
これを並列計算モデルとして形式化し その計算能力を明らかにすることは 実用的にも …