PPT-Machines & Memory CMSC 341

Prof Michael Neary Quick note about email Use a meaningful subject CMSC 341 section XX ISSUE I get a lot of email so Ill see your message faster if you take advantage of my filters Overview. Avg Access Time 2 Tokens Number of Controllers Average Access Time clock cyles brPage 16br Number of Tokens vs Avg Access Time 9 Controllers Number of Tokens Average Access Time clock cycles brPage 17br brPage 18br System fault A characteristic of a software system that can lead to a system error For example failure to initialize a variable could lead to that variable having the wrong value when it is used Human error or mistake Human behavior that results in Functional Programming with OCaml. CMSC 330. 2. Review. Recursion is how all looping is done. OCaml can easily pass and return functions. CMSC 330. 3. The Call Stack in C/Java/etc.. void f(void) {. int x;. Context-Free . Grammars. Ambiguity . CMSC 330. 2. Review. Why should we study CFGs?. What are the four parts of a CFG?. How do we tell if a string is accepted by a CFG?. What. ’. s a parse tree?. CMSC 330. I. /O & Storage. Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides. Some material adapted from Hennessy & Patterson / © 2003 Elsevier Science. Input/Output. I/O Interface. Main Points. Applications of memory management. What can we do with ability to trap on memory references to individual pages?. File systems and persistent storage. Goals. Abstractions. Interfaces. Address Translation Uses. The IESO administers the wholesale electricity markets in Ontario. It operates a real‑time energy market, in which electricity demand and supply are balanced and instructions are issued to . dispatchable. The IESO administers the wholesale electricity markets in Ontario. It operates a real‑time energy market, in which electricity demand and supply are balanced and instructions are issued to . dispatchable. and Virtual Machines. Original material prepared by Adrian . Lienhard. and Marcus . Denker. . Birds-eye view. A virtual machine is an abstract computing architecture supporting a programming language in a hardware-independent fashion. Cliff Stein. Columbia University. Modelling. Partly from . Rodero. et. al. . Partly from some . google. experience. M heterogeneous machines (RAM, CPU, disk). N jobs (RAM, CPU, disk, processing time, arrival time). Main Points. Applications of memory management. What can we do with ability to trap on memory references to individual pages?. File systems and persistent storage. Goals. Abstractions. Interfaces. Address Translation Uses. Nitish Gupta, Shreya Rajpal. 25. th. April, 2017. 1. Story Comprehension. 2. Joe went to the kitchen. Fred went to the kitchen. Joe picked up the milk. Joe travelled to his office. Joe left the milk. Joe went to the bathroom. . Maps and Folds. Anonymous Functions. Project 3 and Project 4. You may use the . List. module. There is a link on the “Resources” page. For exams, however, you should be able to implement any of the functions in List. Memory & Virtual Memory. Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides. Some material adapted from Hennessy & Patterson / © 2003 Elsevier Science. CPU Registers.