Anant Agarwal 2026-11-05
Anant Agarwal is a computer scientist and electrical engineer whose work includes computer architecture, multicore processors and circuit education. MIT's departmental profile lists computer architecture among his research areas, while his CSAIL profile describes work involving multicore computing and authorship of a circuits textbook.[ref]
The MIT lecture State and Memory by Anant Agarwal and Jeffrey Lang, jointly credited with Jeffrey Lang, connects analog stored state to computer memory. A capacitor can summarize prior input by one state quantity, such as stored electric charge ; digital storage then adds a rule for distinguishing logical values. The slides explicitly introduce capacitor state, zero-input response, zero-state response and a one-bit memory abstraction.[ref]
For an original physical-memory example, let a capacitor initially hold and leak through a resistor. With no driving input,
If a stipulated readout interprets values above as the stored high state, the ideal decay reaches that threshold after
The initial stored electric charge is , but the logical interpretation also depends on leakage, the elapsed time and the decision threshold. This is a teaching model, not a specification for a particular memory chip.
The example exposes why merely retaining some electric charge is different from reliably retaining a bit. A practical memory circuit must preserve distinguishable states over the required interval and allow the state to be read. Agarwal and Lang's lecture uses the state concept to connect the circuit's dynamics with that information-storage task.
Computer architecture Created 2026-10-31 Updated 2026-11-05
Computer architecture studies the organization and behaviour of computers, connecting the operations visible to software with the hardware that executes them. An instruction set architecture specifies the machine-level contract, including instructions, accessible processor registers and addressing behaviour. A microarchitecture is a particular implementation of that contract, including execution units, instruction pipelining and memory caches.[ref]
Two CPUs can implement the same instruction set architecture while taking different times to run the same computer program. One might overlap independent instructions or use a larger memory cache; neither choice changes what an addition instruction is required to compute. A useful performance model writes execution time as instruction count times average cycles per instruction divided by clock frequency. The factors interact: a design that raises clock frequency can also change cycles per instruction. This separates a program's required behaviour from the engineering choices that determine its cost.
LLVM Created 2026-10-14 Updated 2026-11-05
LLVM is a collection of reusable compiler infrastructure built around a typed intermediate representation. Its static single-assignment form gives each register-like value one definition, making data dependencies explicit for compiler optimization. The same intermediate representation has an in-memory form, a compact bitcode form and a readable textual form.[ref]
A compiler front end translates a source programming language into the intermediate representation; optimization passes transform it while preserving the required semantics; a compiler back end produces code for a target computer architecture. Sharing the middle stages lets several source programming languages reuse the same analyses and target support. For a small textual example, %y = add i32 %x, 1 defines a new 32-bit integer value from an earlier one. The value %y is defined once even if the source program repeatedly assigns to a source variable.