Lecture

Principles of Locality

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-522: Principles of computer systems

This advanced graduate course teaches the key design principles underlying successful computer and communication systems, and shows how to solve real problems with ideas, techniques, and algorithms from operating systems, networks, databases, programming l ...

Description

This lecture delves into the concept of locality in computing systems, exploring temporal, spatial, and network locality. The instructor discusses how locality impacts system design, from caching to memory allocation, and presents various approaches to exploit locality for efficiency, such as optimizing data layout, designing locks, and minimizing data movement. Examples include hierarchical locks for NUMA machines, server-client models, and dynamic data placement strategies. The lecture also touches on the challenges and trade-offs involved in leveraging locality for performance improvements across different system components.

Instructor

George Candea

George Candea heads the Dependable Systems Lab, where he develops techniques and abstractions for building efficient and trustworthy computer systems. His current work focuses on making performance and energy programmable, i.e., providing first-class abstractions to capture a system’s performance and energy behavior (as interfaces do for functionality) and to use them dependably to design, code, and operate efficient systems.In the recent past, George also served as CEO and later Chief Scientist of Cyberhav

Official source

Related concepts (32)

Program optimization

In computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.

Client–server model

The client–server model is a distributed application structure that partitions tasks or workloads between the providers of a resource or service, called servers, and service requesters, called clients. Often clients and servers communicate over a computer network on separate hardware, but both client and server may reside in the same system. A server host runs one or more server programs, which share their resources with clients. A client usually does not share any of its resources, but it requests content or service from a server.

Client (computing)

In computing, a client is a piece of computer hardware or software that accesses a service made available by a server as part of the client–server model of computer networks. The server is often (but not always) on another computer system, in which case the client accesses the service by way of a network. A client is a computer or a program that, as part of its operation, relies on sending a request to another program or a computer hardware or software that accesses a service made available by a server (which may or may not be located on another computer).

Optimizing compiler

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.

Server (computing)

In computing, a server is a piece of computer hardware or software (computer program) that provides functionality for other programs or devices, called "clients". This architecture is called the client–server model. Servers can provide various functionalities, often called "services", such as sharing data or resources among multiple clients or performing computations for a client. A single server can serve multiple clients, and a single client can use multiple servers.

Related lectures (64)

Online Algorithms: Competitive Ratio

Covers online algorithms and competitive ratio in caching strategies to optimize memory usage.

Locality

Explores the significance of locality in system design, discussing caching, prefetching, and data placement strategies to optimize performance.

Virtual Memory

Covers virtual memory, program relocation, memory protection, TLB, and memory hierarchy interactions.

Cache Memory

Explores cache memory design, hits, misses, and eviction policies in computer systems, emphasizing spatial and temporal locality.

GPU Advanced: Memory Management and Optimization