1 / 19

A Seminar on Memory Management cs.tau.ac.il/~msagiv/courses/mm02.html

A Seminar on Memory Management http://www.cs.tau.ac.il/~msagiv/courses/mm02.html. Mooly Sagiv Schriber 317 msagiv@post Office Hours Wed. 10-12. Outline. General information How to give a presentation Volunteer for October 29 Next week GC. General Information. Prerequisites Compilers

jdeluca
Download Presentation

A Seminar on Memory Management cs.tau.ac.il/~msagiv/courses/mm02.html

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Seminar on Memory Managementhttp://www.cs.tau.ac.il/~msagiv/courses/mm02.html Mooly Sagiv Schriber 317 msagiv@post Office Hours Wed. 10-12

  2. Outline • General information • How to give a presentation • Volunteer for October 29 • Next week GC

  3. General Information • Prerequisites • Compilers • Requirements • Read a short introduction (October 22) • Select a topic (October 22) • Read short survey on GC techniques (October 29) • Read a short article on presentations before preparing your presentation • Participate in seminar talks (can miss one) • Present a paper

  4. Dynamic Memory Management • Essential for high level programming languages • A major source for: • Bugs • Performance bottlenecks

  5. Typical Memory Layout Stack Heap AR3 AR2 AR1 AR0

  6. Memory Management Techniques • Garbage collection • Standard in C#, Java, ML • Can be used in C, C++ • Escape Analysis • Allocate memory at the stack • Region Based Allocation

  7. How to give a presentation • What to say and how to say it • Getting through the audience • Visual aids

  8. What to say and how to say it • Communicate the Key Ideas • Don’t get bogged down in Details • The best talk make you read the paper • Structure your talk • Use Top-Down approach • Introduction • Body • [Technicalities] • The Conclusion Use Examples

  9. Introduction • Define the problem • Motivate the audience • Introduce terminology • Discuss earlier work • Emphasize the contributions • [Provide a road map] Use Examples

  10. The body • Abstract the major results • Explain the significance of the results • Explain the main techniques • Use enlightening examples • Demonstrations are welcome

  11. [Technicalities] • Expert only part • Show something really interesting beyond the paper/tool

  12. The Conclusion • Hindsight is clearer than Foresight • Give open problems/further work • Indicate that your talk is over

  13. Know your audience • Background

  14. Getting through the Audience • Use Repetitions • Remind, don’t assume • Don’t over-run • Maintain Eye Contact • Control your voice • Control your motion • Take care of your appearance

  15. Visual Aids • PowerPoint transparencies • Don’t overload transparencies • Don’t use too many transparencies • Use Overlays Properly • Use Color Effectively • Use Pictures and Tables • The blackboard can be used too

  16. The input of the program can be arbitrary. Let x be a prime number, i.e., all the numbers z<x do not divide x. y be the next prime number, i.e., etc. Arbitrary input Prime number x The next prime y Don’t overload transparencies

  17. Use overlays (im)properly • Item 1 • Item 1.1 • Item 1.2 • Item 2 • Item 2.1 • Item 2.1.1

  18. Use colors properly • Item 1 • Item 2 • Item 3

  19. The End http://www.cs.tau.ac.il/~msagiv/courses/mm02.html

More Related