Computer structures
by Daniel P. Siewiorek, C. Gordon Bell, Allen Newell · first published 1971
6mentions
2recommended by
6HN commenters
2014–2024first – last mentioned
33% recommend67% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…the address of the rest of the instruction – saves a few gates here and a register there. Computer history is marvellous – I’d recommend Tanenbaum’s “Structured Computer Organisation” and Siewiorek’s “Computer Structures”.
on “Ask HN: Why is least significant bit first a thing?” ↗Some of his books are available in pdf on his website: https://gordonbell.azurewebsites.net/gbvita.htm I used Computer Structures:Readings and Examples in an architecture class, and High Tech Ventures in an entrepreneurial class at Stanford. I feel that Digital Equipment Corp entered a death spiral when he left. As a volunteer,…
on “Gordon Bell has died” ↗Gordon Bell and Allen Newell edited wrote "Computer Structures: Readings and Examples" 1971, which is a collection of original technical papers and their commentary on significant computers. It is online at: http://research.microsoft.com/en-us/um/people/gbell/Computer...…
on “Ask HN: How to learn about the history of computing?” ↗…Mudge and John McNamara; DEC, 1978. (Quite common to find at a reasonable price, there are even some PDFs circulating, which may be found by your search engine of choice.) Edit: Maybe also of interest, "Computer Structures: Reading and Examples" by Gordon Bell and Allen Newell (McGraw-Hill, Inc., 1971). For availability, see above.
on “LGP-30 – A Drum Computer of Significance” ↗A detailed description of the Programma 101 architecture and internals appears as Chapter 19 in the book Computer Structures: Readings & Examples edited by Gordon Bell and Alan Newell, 1971. Its presence in this book shows that Bell and Newell thought it was a real computer, not just a programmable calculator. Here is the…
on “Promo for the Olivetti Programma 101- Memory of Future [video]” ↗According to Gordon Bell's Computer Structures: Reading and Examples, the best-case memory access time of the LGP-30 was 2.34 milliseconds†. Most instructions required two memory accesses (the instruction itself, and an operand), which gives you around…
on “The Story Of Mel” ↗