A nonlinear lower bound for random-access machines under logarithmic cost
Journal of the ACM (JACM)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Spatial machines: a more realistic approach to parallel computation
Communications of the ACM
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
Computability of Recursive Functions
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The purpose of a model of computation is to provide the algorithm designer a device for running algorithms. It should be conceptually clear to let him or her concentrate at the algorithmic ideas for solving the problem. At the same time it should be concrete enough to give a realistic estimate on the use resources, when the algorithm is executed on a real computer. In this paper we analyze some weaknesses of existing models of computation, namely sequential access machine and random access machine, and propose a new cost model, called relative cost random access machine, which solves some contradictions between these models. The new model actually only generalizes the way of counting the complexity, and includes sequential access machines and random access machines as special cases. At the same time, it is flexible enough to characterize the cost of memory access in current computers.