-
Notifications
You must be signed in to change notification settings - Fork 15
Elements of Computing Systems Chapter 3
mocoso edited this page Dec 17, 2014
·
20 revisions
- Welcome Sam
- Quick overview of the chapter
- DFF: primitive and possible implementations
- How do computer clocks actually work?
- Capacitors and filters (Chris L)
- Crystal with resonant frequency (James M)
- A cycle is from the beginning of a tick to the end of the tock
- How does the simulator’s clock work (Appendix A.7)
- During a tick the inputs are read, on tock the outputs are set
- Tuning a clock cycle such that all part of the circuit can be reached
- Chips produce junk between ticks
- A DFF is effectively like a delay line
- The “invalid design” with fan-in 2 in Figure 3.1 is really a short circuit
- The Mux both isolates the circuit and allows our behaviour
- Does a Latch relate to flip-flops?
- Wikipedia page is fairly revealing
- Addressing is introduced without too much foreshadowing of how it’ll be used later on
- Multiplexers are about where something goes our load pins are about when
- A brief conversation about the meaning of
k
in 3.2.3
- James M’s glorious rake task
- Turns out you do have to declare
out
twice in the HDL - TextMate beats Jamie’s Vim on this round
- For addressing, we refer back to our n-way (de)muxes from chapter 1
- We use the 3 most significant address bits in our RAM64 to select the RAM8 then we pass the rest
- Comparable with paging
- Tree-like approach as smaller chunks of the address are sent down branches
- RAM16K isn’t as big a jump in size as the previous ones, tripped us up
- In x86 we read a word of 32 bits then take a byte out of that
- The minimum addressable size is 32 bits
- Boundary alignments are important for performance (to explore)
- Order of precedence was a point of debate on the program counter
- Does PC need
load
andreset
?
January's meet-up will be at Go Free Range's office on Tuesday, 13th January.
Turns out enough people have ordered copies of the book through the referral code that we have enough to buy a hard copy for the club.
We took a cheeky look at Chapter 4 to see how things will progress in the new year.
- Home
- Documentation
- Choosing a Topic
- Shows & Tells
- Miscellaneous
- Opt Art
- Reinforcement Learning: An Introduction
- 10 Technical Papers Every Programmer Should Read (At Least Twice)
- 7 More Languages in 7 Weeks
- Lua, Day 1: The Call to Adventure
- Lua, Day 2: Tables All the Way Down
- Lua, Day 3
- Factor, Day 1: Stack On, Stack Off
- Factor, Day 2: Painting the Fence
- Factor, Day 3: Balancing on a Boat
- Elm, Day 1: Handling the Basics
- Elm, Day 2: The Elm Architecture
- Elm, Day 3: The Elm Architecture
- Elixir, Day 1: Laying a Great Foundation
- Elixir, Day 2: Controlling Mutations
- Elixir, Day 3: Spawning and Respawning
- Julia, Day 1: Resistance Is Futile
- Julia, Day 2: Getting Assimilated
- Julia, Day 3: Become One With Julia
- Minikanren, Days 1-3
- Minikanren, Einstein's Puzzle
- Idris Days 1-2
- Types and Programming Languages
- Chapter 1: Introduction
- Chapter 2: Mathematical Preliminaries
- Chapter 3: Untyped Arithmetic Expressions
- Chapter 4: An ML Implementation of Arithmetic Expressions
- Chapter 5: The Untyped Lambda-Calculus
- Chapters 6 & 7: De Bruijn Indices and an ML Implementation of the Lambda-Calculus
- Chapter 8: Typed Arithmetic Expressions
- Chapter 9: The Simply-Typed Lambda Calculus
- Chapter 10: An ML Implementation of Simple Types
- Chapter 11: Simple Extensions
- Chapter 11 Redux: Simple Extensions
- Chapter 13: References
- Chapter 14: Exceptions
- Chapter 15: Subtyping – Part 1
- Chapter 15: Subtyping – Part 2
- Chapter 16: The Metatheory of Subtyping
- Chapter 16: Implementation
- Chapter 18: Case Study: Imperative Objects
- Chapter 19: Case Study: Featherweight Java
- The New Turing Omnibus
- Errata
- Chapter 11: Search Trees
- Chapter 8: Random Numbers
- Chapter 35: Sequential Sorting
- Chapter 58: Predicate Calculus
- Chapter 27: Perceptrons
- Chapter 9: Mathematical Research
- Chapter 16: Genetic Algorithms
- Chapter 37: Public Key Cryptography
- Chapter 6: Game Trees
- Chapter 5: Gödel's Theorem
- Chapter 34: Satisfiability (also featuring: Sentient)
- Chapter 44: Cellular Automata
- Chapter 47: Storing Images
- Chapter 12: Error-Correcting Codes
- Chapter 32: The Fast Fourier Transform
- Chapter 36: Neural Networks That Learn
- Chapter 41: NP-Completeness
- Chapter 55: Iteration and Recursion
- Chapter 19: Computer Vision
- Chapter 61: Searching Strings
- Chapter 66: Church's Thesis
- Chapter 52: Text Compression
- Chapter 22: Minimum spanning tree
- Chapter 64: Logic Programming
- Chapter 60: Computer Viruses
- Show & Tell
- Elements of Computing Systems
- Archived pages