Combinational Logic

Floating Point

RISC-V Procedures

Loader

RISC-V Single-Cycle Datapath

Caches - Multilevel

Parallelism

Translation Lookaside Buffer (TLB)

Amdahl's law

RAID (Redundant Array of Inexpensive Disks)

Virtual memory

RISC-V Instruction Formats

RISC-V Single-Cycle Control

Caches - Set-associative

Thread-level Parallelism

Page faults

Virtual memory performance

Data-level parallelism

Data center

Assembly language

Number Representation

RISC-V

Compiler

Synchronous Digital Systems (SDS) State

RISC-V 5-Stage Pipeline

Performance with Caches

OpenMP

Multilevel

Dependability

Warehouse-scale Computing

Input/output

C (programming language)

RISC-V Data Transfer

Assembler

Finite State Machine (FSM)

Hazards

Flynn taxonomy

Cache coherence

Interrupts

MapReduce

Parity

C Memory (Mis)Management

RISC-V Decision Making Logical Ops

Linker

Combinational Logic Blocks

Caches - Direct Mapped

Single instruction, multiple data (SIMD)

Performance

Exception handling

Apache Spark

Error-correcting Codes (ECC)

CS 61C Great Ideas in Computer Architecture (Machine Structures) UC Berkeley Fall 2022 This course deepens students' understanding of computer architecture and the translation of high-level programs into machine language. Emphasis is on C and assembly language programming, computer organization, parallelism, CPU design, and warehouse-scale computing. Prerequisites include CS61A and CS61B or equivalent C-based programming experience. [Official Academic Guide course description](https://classes.berkeley.edu/content/2022-fall-compsci-61c-001-lec-001)

The subjects covered in this course include C and assembly language programming, translation of high-level programs into machine language, computer organization, caches, performance measurement, parallelism, CPU design, warehouse-scale computing, and related topics.  CS61A and CS61B (or equivalents) or experience with a C-based programming language (e.g. Java, C++). There is no official textbook for this class. However, there are three optional textbooks as additional references:

- **P&H**: Second edition of Patterson and Hennessy's *Computer Organization and Design RISC-V Edition* book ("P&H"), ISBN 0128122757.
- **K&R**: *The C Programming Language, Second Edition* by Kernighan and Ritchie. Other C programming books are also suitable if you are already comfortable with them, but our lectures will be based on K&R.
- **WSC**: *The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines*, which is freely available [on our website](https://inst.eecs.berkeley.edu/~cs61c/resources/WSCBarrosoHolzle.pdf).

Please contact staff on Ed if you have trouble finding or paying for these textbooks.

CS 61C Great Ideas in Computer Architecture (Machine Structures)

Computer Systems

C Pointers

Memory allocation

Digital Logic

Arithmetic Logic

C Arrays

Process (computing)

Memory hierarchy

Transistors to Gates

Sequential logic

Exceptional Control Flow (ECF)

Data as Bits

Processor Datapath

Call stack

Process modeling

Software Tools

Floating Point Number Representation

Representing Data Structures

Shell (computing)

Integer Representation

Programming with Memory

Buffer overflow

Thread (computing)

CS 240 Foundations of Computer Systems Wellesley College Spring 2023 This course explores the inner workings of computers, focusing on how they execute programs. Students gain an in-depth understanding of software and hardware abstractions, ranging from programming languages to transistors. Key areas covered include computational building blocks, hardware-software interfaces, data representation, and practical system abstractions. The course also emphasizes structured reasoning about program execution and promotes skills for independent learning, critical thinking, and problem-solving in computer science. CS 240 examines how computers run programs, introducing key abstractions and implementations in software and hardware between programming languages and transistors. ## Goals

Course goals include:

- To understand how computers execute programs.
- To understand the roles of key software and hardware abstractions, their implementations, and their relation through translation and representation, including: digital logic, microarchitecture, instruction set architecture, the memory hierarchy, basics of programming language implementations, and operating system abstractions.
- To understand when and how computer system implementation impacts correctness or performance of arbitrary high-level programs.
- To become proficient in structured reasoning about the execution of programs on well-defined models, including the use of assertions and debugging tools to inspect program invariants and execution state.
- To develop foundations for further study of programming language implementation, security, computer architecture, operating systems, networks, concurrent and distributed systems, or other systems/implementation topics in computer science.
- [**To develop skills for independent learning, critical thinking, and problem-solving as a self-reliant computer scientist.**](#compact)

## Topics

The [course home page](https://cs.wellesley.edu/~cs240/s23/) hosts the working schedule. +Optional extensions are prefixed in the schedule with a plus sign. We may visit these if there is time. They are always available for your own exploration in further depth.

**Computational Building Blocks:**

- Hardware computation building blocks: 
    - Transistors, digital logic gates
    - Combinational and arithmetic logic
    - Sequential (stateful) logic
    - Overview of computer processor architecture
- Data representation fundamentals: 
    - Data representation with bits, bit-level computation
    - Number representation, arithmetic
    - The memory model, pointers, and arrays in the C language
    - Assertions, debugging

**Hardware-Software Interface:**

- The instruction set architecture model, machine code, assembly language, x86
- Basic program translation
- Control flow
- Procedures, call stack
- Data layout, security implications

**Abstractions for Practical Systems:**

- The memory hierarchy, caches
- Memory allocation
- Operating system basics: 
    - Exception control flow
    - The process model
    - Virtual memory
- Compilers, run-time systems, programming tools
- Beyond 240 ### When Should You Take CS 240?

**Prerequisite:** CS 230 or permission of the instructor is **required** to enroll in CS 240.

**Recommendations:**

- Consider your courseload carefully. CS 240 is a 1.25-credit lab course that requires a larger time commitment and workload than most 1-credit courses.
- Take CS 240 early after finishing the CS 111 / CS 230 introductory sequence. CS 240 should boost your independence, give valuable context for *how things work* as you approach further computing studies, and open doors to a wide range of courses and areas in CS.

Please talk to the [instructors](#staff) if you have any questions or concerns. We are happy to work with you to make your time in CS 240 most effective and rewarding for you. ### Texts

Electronic options are available for all required sources. At least one physical copy of each text is also available in the physical SCI L037 CS Systems Lab **for use within the CS department area.**Please use them in the data lab area and return them to the shelf when you are done.

**We use one primary textbook extensively:**

- **CSAPP 3e** ([*Wellesley online access*](https://drive.google.com/drive/folders/1eFNJ7GqAHH8_W4dNv0UC4qkZX-kEMQH_?usp=sharing)):   
    [*Computer Systems: A Programmer’s Perspective, 3/E*](http://csapp.cs.cmu.edu). (**3rd edition**, significant changes since 2nd)   
    Bryant and O’Hallaron, Pearson, 2016. ISBN-13: 9780134092669. 
    - We **need the 3rd edition**. See [the errata](http://csapp.cs.cmu.edu/3e/errata.html).
    - Unfortunately, the library is not able to acquire an electronic version, but there are several options to access the book, including, but not limited to: 
        - If you prefer physical books, paperback copies are available for much less than the hardcover version. “Global” 3rd editions mostly work, but have some additional errors (not listed on the errata page).
        - [6 months of access to an electronic version is available for $35.](https://www.vitalsource.com/products/computer-systems-a-programmer-39-s-perspective-randal-e-bryant-david-r-v9780134092997)
        - During difficult pandemic circumstances, [we have scans of the relevant excerpts available for CS 240 students (Wellesley ONLY)](https://drive.google.com/drive/folders/1eFNJ7GqAHH8_W4dNv0UC4qkZX-kEMQH_?usp=sharing). Being scans, these excerpts are not quite as good quality as some other electronic or paper options.
    - Please contact the instructors if none of the available options work for you.

**Other textbooks are used during the first part of the course:**

- **DDCA** ([*Wellesley online access*](https://ebookcentral.proquest.com/lib/well/detail.action?docID=404196)):   
    [*Digital Design and Computer Architecture*](https://ebookcentral.proquest.com/lib/well/detail.action?docID=404196).   
    Harris and Harris, Morgan Kaufmann, 2007. 
    - [The library has an electronic version of this text](https://ebookcentral.proquest.com/lib/well/detail.action?docID=404196)

**We recommend a good reference on the C programming language.**Here are a couple solid options:

- **[Essential C](http://cslibrary.stanford.edu/101/)** (PDF)  
    Nick Parlante, 2003. Stanford University.
- **K&amp;R:**  
    [*The C Programming Language, 2nd edition*](http://luna.wellesley.edu/record=b1630956~s1).   
    Kernighan and Ritchie, Prentice Hall, 1988. ISBN-13: 978-0131103627, ISBN-10: 0131103628.

**Additional materials** will be posted directly on the [course website](/~cs240/s23/).

CS 240 Foundations of Computer Systems

Combinational logic

Combinational Logic

2 courses cover this concept

CS 61C Great Ideas in Computer Architecture (Machine Structures)

CS 240 Foundations of Computer Systems