CS 1114: Data Structures – memory allocation Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)

Slides:



Advertisements
Similar presentations
Garbage collection David Walker CS 320. Where are we? Last time: A survey of common garbage collection techniques –Manual memory management –Reference.
Advertisements

Dynamic Memory Management
Introduction to Memory Management. 2 General Structure of Run-Time Memory.
Chapter 2: Memory Management, Early Systems
Chapter 2: Memory Management, Early Systems
Memory Management, Early Systems
ICS220 – Data Structures and Algorithms Lecture 13 Dr. Ken Cosh.
PZ10B Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, PZ10B - Garbage collection Programming Language Design.
Lecture 10: Heap Management CS 540 GMU Spring 2009.
Garbage Collection What is garbage and how can we deal with it?
Garbage Collection CSCI 2720 Spring Static vs. Dynamic Allocation Early versions of Fortran –All memory was static C –Mix of static and dynamic.
CPSC 388 – Compiler Design and Construction
CS 536 Spring Automatic Memory Management Lecture 24.
Chapter 8 Runtime Support. How program structures are implemented in a computer memory? The evolution of programming language design has led to the creation.
CS 1114: Data Structures – Implementation: part 1 Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
Memory Allocation. Three kinds of memory Fixed memory Stack memory Heap memory.
Memory Management Memory Areas and their use Memory Manager Tasks:
Linked lists Prof. Noah Snavely CS1114
Memory Allocation and Garbage Collection. Why Dynamic Memory? We cannot know memory requirements in advance when the program is written. We cannot know.
CS 1114: Graphs and Blobs Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
Linked lists and memory allocation Prof. Noah Snavely CS1114
Reference Counters Associate a counter with each heap item Whenever a heap item is created, such as by a new or malloc instruction, initialize the counter.
Memory Management Last Update: July 31, 2014 Memory Management1.
Dynamic Memory Allocation Questions answered in this lecture: When is a stack appropriate? When is a heap? What are best-fit, first-fit, worst-fit, and.
CY2003 Computer Systems Lecture 09 Memory Management.
Storage Management. The stack and the heap Dynamic storage allocation refers to allocating space for variables at run time Most modern languages support.
 DATA STRUCTURE DATA STRUCTURE  DATA STRUCTURE OPERATIONS DATA STRUCTURE OPERATIONS  BIG-O NOTATION BIG-O NOTATION  TYPES OF DATA STRUCTURE TYPES.
Simulated Pointers Limitations Of Java Pointers May be used for internal data structures only. Data structure backup requires serialization and deserialization.
Storage allocation issues Prof. Ramin Zabih
1 Lecture 22 Garbage Collection Mark and Sweep, Stop and Copy, Reference Counting Ras Bodik Shaon Barman Thibaud Hottelier Hack Your Language! CS164: Introduction.
Memory Management. Memory  Commemoration or Remembrance.
1 Languages and Compilers (SProg og Oversættere) Heap allocation and Garbage Collection.
PZ10A Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, Heap storage Dynamic allocation and stacks are generally.
Garbage Collection and Memory Management CS 480/680 – Comparative Languages.
University of Washington Wouldn’t it be nice… If we never had to free memory? Do you free objects in Java? 1.
GARBAGE COLLECTION IN AN UNCOOPERATIVE ENVIRONMENT Hans-Juergen Boehm Computer Science Dept. Rice University, Houston Mark Wieser Xerox Corporation, Palo.
Memory Management -Memory allocation -Garbage collection.
2/4/20161 GC16/3011 Functional Programming Lecture 20 Garbage Collection Techniques.
Breadth-first and depth-first traversal Prof. Noah Snavely CS1114
Simulated Pointers Limitations Of C++ Pointers May be used for internal data structures only. Data structure backup requires serialization and deserialization.
Breadth-first and depth-first traversal CS1114
Dynamic Memory Management Jennifer Rexford 1. 2 Goals of this Lecture Dynamic memory management techniques Garbage collection by the run-time system (Java)
CS412/413 Introduction to Compilers and Translators April 21, 1999 Lecture 30: Garbage collection.
Memory Management CSCI 2720 Spring What is memory management? “the prudent utilization of this scarce resource (memory), whether by conservation,
Memory Management Damian Gordon.
Garbage Collection What is garbage and how can we deal with it?
Memory Management Memory Areas and their use Memory Manager Tasks:
Chapter 2 Memory and process management
Prof. Ramin Zabih Implementing queues Prof. Ramin Zabih
Memory Management 6/20/ :27 PM
CS 1114: Implementing Search
Storage Management.
Concepts of programming languages
Memory Management Memory Areas and their use Memory Manager Tasks:
Automatic Memory Management
Garbage collection; lightstick orientation
Simulated Pointers.
Data Structures – Stacks and Queus
Simulated Pointers.
Memory Management Kathryn McKinley.
Chapter 12 Memory Management
Introduction to Data Structures
Data Structures and Algorithms
Linked lists Prof. Noah Snavely CS1114
Memory Management Memory Areas and their use Memory Manager Tasks:
CS703 - Advanced Operating Systems
Data Structures and Algorithms
Garbage collection Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
Garbage Collection What is garbage and how can we deal with it?
Presentation transcript:

CS 1114: Data Structures – memory allocation Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)

Memory allocation  Strategy 1: Computer keep tracks of free space at the end  Strategy 2: Computer keeps a linked list of free storage blocks (“freelist”) –For each block, stores the size and location –When we ask for more space, the computer finds a big enough block in the freelist –What if it doesn’t find one? 2

Maintaining a freelist XXXX Delete the last element XXX XXXX Start: 10 Free space: 999,990 Start: 10 Free space: 999,990 Start: 4 Free space: 3 Free list

4 Allocation issues  Surprisingly important question: –Which block do you supply? –The smallest one that the users request fits into? –A larger one, in case the user wants to grow the array?

Memory deallocation  How do we give the computer back a block we’re finished with?  Someone has to figure out that certain values will never be used ever (“garbage”), and should be put back on the free list –If this is too conservative, your program will use more and more memory (“memory leak”) –If it’s too aggressive, your program will crash (“blue screen of death”) 5

Memory deallocation  Two basic options: 1.Manual storage reclamation –Programmer has to explicitly free garbage –Languages: C, C++, assembler 2. Automatic storage reclamation –Computer will notice that you’re no longer using cells, and recycle them for you –Languages: Matlab, Java, C#, Scheme 6

7 Manual storage reclamation  Programmers always ask for a block of memory of a certain size –In C, explicitly declare when it is free  Desirable but complex invariants: 1.Everything should be freed when it is no longer going to be used 2.If we free something, we shouldn’t try to use it again 3.And, it should be freed exactly once! 4.Minimize fragmentation

8 Automatic storage reclamation  “Garbage collection”  1 st challenge: find memory locations that are still in use by the programmer (“live”) 1.Anything that has a name the programmer can get to (the “root set”) 2.Anything pointed to by a live object Root set in Matlab

Garbage collection  Two lists, X and Y  Which cells are live?  Which cells are garbage? XY

10 Simple algorithm: mark-sweep  Mark: Chase the pointers from the root set, marking everything as you go  Sweep: Scan all of memory – everything not marked is garbage, and can go back on the free list

Mark and sweep  Mark phase  Sweep phase XY Root set: { X, Y }

Mark and sweep  The machine needs to be able to tell where the pointers are (we’ll assume that it’s up to the programmer to do that) –For instance, the programmer will say that the second entry in a cell is a pointer (for singly- linked list) –Or, for a doubly-linked list, the first and third entries in a cell are pointers 12

Mark and sweep  In general, pointers may have a complex structure 13 How do we mark, in the general case?

When to do garbage collection?  Option 1 (“stop the world”): Once memory is full, stop everything and run garbage collection –Your program will freeze while the garbage is being collected –Not good if you’re coding the safety monitoring system for a nuclear reactor  Option 2 (“incremental GC”): Collect garbage in parallel with the main program –Needs to be careful not to step on the program 14

Linked lists – running time  What about inserting / deleting from somewhere near the middle of the list? –How can we find items in a list faster than simply starting at one or other end?  How can we fix this?  You’ll have to wait a bit to learn about this……. 15

Where are we in the story? 16 We started with images Then sought blobs Then decided that blobs are connected, so Built graphs Then wanted to find the connected components, so Looked at implementing dfs and bfs, so Looked at implementing stacks and queues Then found that arrays were inefficient, so Looked at linked lists Then looked at implementing linked lists Arrays were messy, could we use a graph? Paris Berlin London Rome Frankfurt Vienna Prague Oslo Stockholm

Representing a graph 17 Build a big 2-D array Mentally label the rows and columns by the nodes Then insert a 0 if there are no edges between those nodes, or a 1 if they are connected What does this array look like if there are lots of edges? there are very few edges? (we call these matrices ‘sparse’) Paris Berlin London Rome Frankfurt Vienna Prague Oslo Stockholm

Representing a graph 18 Can we do better? Build an array of linked lists! One linked list per node The edges live in the list Details: For each node A, put the nodes which are connected to that node into A’s linked list - no longer ‘sparse’ - and space isn’t being wasted! - can represent directed graphs easily Paris Berlin London Rome Frankfurt Vienna Prague Oslo Stockholm