Why not innovations in computer architecture?

@article{Denning1980WhyNI,
  title={Why not innovations in computer architecture?},
  author={Peter J. Denning},
  journal={SIGARCH Comput. Archit. News},
  year={1980},
  volume={8},
  pages={4-7}
}
  • P. Denning
  • Published 15 April 1980
  • Business
  • SIGARCH Comput. Archit. News
In Computer Architecture News (CAN) of December 1979, Dennis Frailey responds (with an insider's view) to an earlier plea to modernize computer architecture. Dennis pointed out that simple, common~osense business factors dominate decisions of microprocessor manufacturers. Will the new product be a business success? Can it be manufactured cheaply in volume? Can it be brought to market quickly? Will it perform well? Is it compatible with existing products? He suggested that those of us seeking… 

The way forward in computer architecture research

Professor Denning's articles (i), (2) and those of several others in CAN (3), (4), (5) raise a broader issue. How do we find a way forward in the Computer Architecture? There seems to me to be three

The computing memory another distributed computer architecture

The issue of alternative computer architectures has been topical since computer architecture exist. In particular, the question of what is new in a new architecturenever ceased to be germane. The

Security and Persistence

The paper reviews some of the history of ideas to do with capabilities and of implementations based on them, and concludes with a discussion of some current manifestations of the same general

Computer Design and Description Languages

Concepts and realization of a high-performance data type architecture

  • W. GiloiR. Güth
  • Computer Science
    International Journal of Computer & Information Sciences
  • 2004
TLDR
Adata type architecture is described that offers efficient and convenient mechanism for constructing arbitrary data structures and encapsulating them into abstract data types, thus avoiding the inefficiency penalty mentioned above.

Capability Based Tagged Architectures

  • L. Lopriore
  • Computer Science
    IEEE Transactions on Computers
  • 1984
An architecture is presented which incorporates capability based addressing and memory tagging features. It defines three kinds of mechanisms for the implementation of object types, which correspond

A computer architecture for the dynamic optimization of high-level language programs

TLDR
Experiments comparing the performance of TM and the a traditional register architecture on a set of test programs show that a simple, nonoptimizing compiler can generate object code for TM that is smaller and faster than the code produced by an optimizing compiler for the register architecture.

An Architecture Supporting Security and Persistent Object Storage

TLDR
Persistent storage concepts provide an abstraction from the conventional main memory - external memory separation and on-chip support for permanent checking of object type and rights is based upon a capability implementation.

References

SHOWING 1-10 OF 15 REFERENCES

Advances in computer architecture

TLDR
State-of-the-art concepts covered include tagged storage, capability-based addressing, process management, protection domains, and error detection.

On The Advantages of Tagged Architecture

  • E. Feustel
  • Computer Science
    IEEE Transactions on Computers
  • 1973
TLDR
The paper shows that the advantages of the change from the traditional von Neumann machine to tagged architecture are seen in all software areas including programming systems, operating systems, debugging systems, and systems of software instrumentation.

Demand paging through utilization of working sets onr the MANIAC II

TLDR
A hardware implementatio~ on the Maniac II computer of the s.orking set model fur demand paging, as intr~duced by Denning, is discussed and a specification of the actions taken underarious conditions which may be taken during the operation of the full working set mode, demand ~aging system is given.

Working Sets Past and Present

  • P. Denning
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1980
TLDR
This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance and suggests that a working set dispatcher should be considered.

A Study of Replacement Algorithms for Virtual-Storage Computer

TLDR
One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.

Recursive Programming

TLDR
The principles of a program structure for which these two objections no longer hold are described, which essentially restricts the admissable structure of the program; hence the name “Recursive Programming”.

Burroughs B1700 memory utilization

  • W. Wilner
  • Computer Science
    AFIPS '72 (Fall, part I)
  • 1972
TLDR
In this discussion, "information content" will suffice as an intuitive notion to raise the information content of the blocks of information which one is using.

Implications of structured programming for machine architecture

TLDR
A highly compact instruction encoding scheme is presented, which can reduce program size by a factor of 3.

The design, implementation, and evaluation of a working set dispatcher

TLDR
The design and implementation of a dispatcher based on the working set principle is discussed, data is presented to permit analysis of its behavior, and future directions of research on methods of controlling a computer system are indicated.