Nachos Project 3. Speaker: Sheng-Wei Cheng 2010/12/16
|
|
- Spencer Samson Crawford
- 5 years ago
- Views:
Transcription
1 Nachos Project Speaker: Sheng-We Cheng //6
2 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson
3 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson
4 Motvaton Motvaton Nachos keeps only one user program n memory at a tme./nachos -x user_program Objectves Use the pagng mechansm to mplement the multprogrammng,.e., keep multple user programs n man memory. Pages are only loaded when they are demanded durng program executon,.e., pure demand pagng. 4
5 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson 5
6 Execute a User Program n Nachos Create a page table to run ths program Load program nto physcal memory Execute the program Object AddrSpace maps vrtual page to physcal page n one to one (:) AddrSpace::AddrSpace( ) { pagetable = new TranslatonEntry[NumPhysPages]; } AddrSpace::Load( ) AddrSpace::Execute( ). Intal regsters. Load page table regsters. Jump to the user program Kernel->machne->Run( ) for( ; ; ){ OneInstructon(nstr); //execute one nstructon kernel->nterrupt->onetck( ); //Advance tmer tck } 6
7 Map Address Space n Nachos User program Vrtual page Physcal page Vald/Invald /8 = V V V V 4 4 V 5 5 V 4 5 Physcal memory %8 = 4 Offset = V 7 Physcal page sze = 8 Number of physcal pages = 8 7
8 Load User Program Read the header of the user program The header format s NoffHeader defned n noff.h Magc number Magc number The header of code segment Vrtual address User Program Header The header of ntalzed data segment The header of read only segment Offset n fle Segment sze Code and data segments The header of unntalzed data segment Code segment 8
9 Load User Program (cont.) Load code and data segments nto man memory In Nachos, the segments are loaded nto memory wth no offset. Physcal memory Code segment Code segment Intalzed data segment Read only data segment Intalzed data segment Read only data segment 9
10 Execute One Instructon Machne::OneInstructon( ) Use ReadMem( ) to read one nstructon It wll call Machne::Translate( ) to get the physcal address by checkng the page table (AddrSpace table). Read data from the address returned from Machne::Translate( ) Parse the fetched nstructon Update PCReg and NextPCReg accordng to the executon of the fetched nstructon
11 Load Process wthout Page faults 4 5 Physcal page Vrtual page Page table 6 7 Physcal page Vrtual page User program Man memory 7 Page table User program
12 Load Process wth Page faults 4 5 Physcal page Page fault Page table Vrtual page Pure demand pagng 6 7 Physcal page Vrtual page User program 7 Man memory Page table User program
13 Load Process wth Page faults 4 5 Physcal page Vrtual page v Page table Pure demand pagng 6 7 Physcal page Vrtual page User program 7 Man memory Page table User program
14 Load Process wth Page faults 4 5 Physcal page Page fault v Page table Vrtual page Pure demand pagng 6 7 Physcal page Vrtual page User program 7 4 Man memory Page table User program
15 Load Process wth Page faults 4 5 Physcal page Vrtual page v v Page table Pure demand pagng 6 7 Physcal page Vrtual page User program 7 5 Man memory Page table User program
16 Load Process wth Page faults 4 5 Physcal page Vrtual page v v Page table Pure demand pagng 6 7 Physcal page Vrtual page User program Page fault 7 6 Man memory Page table User program
17 Load Process wth Page faults 4 5 Physcal page Vrtual page v v Page table Pure demand pagng 6 7 Physcal page Vrtual page User program v 7 7 Man memory Page table User program
18 Load Process wth Page faults 4 5 Physcal page Vrtual page v v Page table Pure demand pagng 6 7 Physcal page Vrtual page User program v 7 8 Man memory Page fault Page table User program
19 Load Process wth Page faults 4 5 Physcal page Vrtual page v v Page table Pure demand pagng 6 7 Physcal page Vrtual page User program v v 7 9 Man memory Page table User program
20 Loadng Procedure Example Program A Program B Nachos Create thread A wth ts own page table Load Program A nto man memory and setup thread A s page table n AddrSpace::Load( ) Create thread B wth ts own page table Load Program B nto man memory and setup thread B s page table n AddrSpace::Load( ) Put thread A and B nto readylst System start: kernel->machne->run() Load the demanded page run user programs (an nfntve loop) Swtch current thread Page fault Tmer nterrupt occurs
21 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson
22 Related Fles Major Nachos-4./code/machne/machne.cc Nachos-4./code/machne/translate.cc Nachos-4./code/machne/addrspace.cc Nachos-4./code/machne/man.cc Nachos-4./code/machne/nterrupt.cc Nachos-4./code/machne/excepton.cc Mnor Nachos-4./code/machne/mpssm.cc Nachos-4./code/threads/thread.cc Nachos-4./code/threads/scheduler.cc
23 Nachos Page Table The page table s Declared n machne/machne.h Implemented as an array of TranslatonEntry objects. Machne/translate.h class TranslatonEntry { publc: nt vrtualpage; // The page number n vrtual memory nt physcalpage; // The page number n real memory relatve to the start of man memory bool vald; bool readonly; bool use; bool drty; }
24 Machne Class Some mportant varable defntons: const nt PageSze = 8; The page sze of the physcal memory n Nachos const nt NumPhysPages = 8; The number of pages n physcal memory char *manmemory; Physcal memory to store the user program code and data, whle t s executng. TranslatonEntry *pagetable; Pont to the page table of current thread 4
25 AddrSpace Class AddrSpace::AddrSpace( ) The AddrSpace constructor Create an address space to run a user program Set the one to one relatonshp between vrtual pages and physcal pages Clear man memory AddrSpace::~AddrSpace() The AddrSpace destructor Deallocate the page table 5
26 AddrSpace Class (cont.) bool AddrSpace::Load( char *flename) Load a user program nto memory from a fle Nachos assumes vrtual address equals to physcal address The user program s n NOFF format 6
27 AddrSpace Class (cont.) Vod AddrSpace::Execute( ) Run a user program usng the current thread Intalze the regster values of the smulated MIPS machne ths->intregsters(); Set page table regster ths->restorestate(); Jump to the user program kernel->machne->run(); 7
28 AddrSpace Class (cont.) Vod AddrSpace::IntRegsters( ) Set the ntal values for the user-level regster set Vod AddrSpace::RestoreState( ) Tell the machne where to fnd the page table (pagetable) Tell the machne number of pages needed by the user program (numpages) bool AddrSpace::SaveState( ) Save any machne state for ths address space on a context swtch 8
29 Machne Class n translate.cc bool Machne::ReadMem(nt addr, nt sze, nt *value) Read sze (,, or 4) bytes of vrtual memory at addr nto the locaton ponted to by value. If the address translaton (from Machne:: Translate()) s faled, t wll rase an excepton (page fault handlng routne) by nvokng RaseExcepton( ). Arguments: addr the vrtual address to read from sze the number of bytes to read (,, or 4) value the place to wrte the result 9
30 Machne Class n translate.cc (cont.) bool Machne::WrteMem(nt addr, nt sze, nt value) Wrte sze (,, or 4) bytes of the contents of value nto the vrtual memory at locaton address addr. If the address translaton (from Machne::Translaton( )) s faled, t wll rase an excepton by nvokng RaseExcepton( ). Arguments: addr the vrtual address to wrte to sze the number of bytes to be wrtten (,, or 4) value the data to be wrtten drty bt would be set!!
31 Machne Class n translate.cc (cont.) ExceptonType Machne::Translate (nt vrtaddr, nt* physaddr, nt sze, bool wrtng) Translate a vrtual address(vrtaddr) nto a physcal address(*physaddr), usng the current thread s page table. If error, then return the type of the excepton Arguments: vrtaddr the vrtual address to translate *physaddr the place to store the physcal address sze the amount of memory beng read or wrtten wrtng f TRUE, check the read-only bt n the page table to see whether the process attempts to wrte a read only page.
32 Machne Class n mpssm.cc Machne::OneInstructon(Instructon* nstr); Exceute one nstructon from a user program After any excepton or nterrupt, return to kernel ->machne->run() agan Machne::Run() s a loopng functon On a system call, the excepton handler has to ncrement the program counter On an excepton, we don t need to ncrement the program counter n order to restart ths nstructon agan. For example: page fault
33 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson
34 Requrement Multprogrammng and Vrtual Memory(5%) Load multple user programs to run on Nachos smultaneously Implement a pagng mechansm wthout consderng page faults Each user program starts at vrtual address. The system uses nachos default schedulng: swap current user program(thread) out n each tmer nterrupt, whch occurs once every tcks, and swap n the user program wth the specfed order. 4
35 Requrement (cont.) Enable the Loadng of Multple User Programs Modfy man.cc to let t enable loadng three user programs from parameters Ex: >./nachos -x programa programb programc Create one thread for each user program mplement OSPrnt() for test program Modfy AddrSpace::Load( ) to let t Create a page table whle loadng a user program Load a user program nto memory Confgure ts own page table for that user program n each nvocaton. 5
36 Requrement (cont.) Pure demand pagng(%) Intally, load user programs to swap space. Only pages that are demanded n runtme wll be loaded nto man memory. You do need to consder page faults now. Increment kernel->stats->numpagefaults for every page fault You do NOT need to consder page replacement. Report(%) 6
37 Handlng of Page faults In excepton.cc, you have to add the PageFaultExcepton case to load the demanded page. If the replaced page has been modfed or s drty, wrte t back. Don t advance the program counter whle handlng page faults. The system needs to execute the nstructon that causes the page fault. 7
38 Test Programs a.c b.c c.c nt man(){ nt ; for( =;<;++){ OSPrnt( %da\n,); OSPrnt( %da\n,); OSPrnt( %da\n,); OSPrnt( %da\n,); OSPrnt( %da4\n,); OSPrnt( %da5\n,); OSPrnt( %da6\n,); OSPrnt( %da7\n,); OSPrnt( %da8\n,); OSPrnt( %da9\n,); OSPrnt( %da\n,); } } nt man(){ nt ; for( =;<;++){ OSPrnt( %db\n,); OSPrnt( %db\n,); OSPrnt( %db\n,); OSPrnt( %db\n,); OSPrnt( %db4\n,); OSPrnt( %db5\n,); OSPrnt( %db6\n,); OSPrnt( %db7\n,); OSPrnt( %db8\n,); OSPrnt( %db9\n,); OSPrnt( %db\n,); } } nt man(){ nt ; for( =;<;++){ OSPrnt( %dc\n,); OSPrnt( %dc\n,); OSPrnt( %dc\n,); OSPrnt( %dc\n,); OSPrnt( %dc4\n,); OSPrnt( %dc5\n,); OSPrnt( %dc6\n,); OSPrnt( %dc7\n,); OSPrnt( %dc8\n,); OSPrnt( %dc9\n,); OSPrnt( %dc\n,); } } 8
39 Test Program Executon and Output >./nachos -x a b c Output: Loadng program: a Number of pages: 4 Sze of code segment: 656 Vrtual address of code segment: Sze of readonly data segment: 96 Vrtual address of readonly data segment: 656 a a ###ContextSwtch b ###ContextSwtch c 9
40 Hnt In order to support the multprogrammng n Nachos, you need to mplement the excepton handler of SC_Ext snce the system call Ext( ) s nvoked automatcally whle a program completes. 4
41 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson 4
42 Bonus Implement the page replacement usng Enhanced Second-Chance Algorthm. Change NumPhysPages n the machne class to 6. You should consder all PhysPages (or frames) n your man memory altogether, rather than consderng only those PhysPages (or frames) allocated to a certan addrspace. Usng use and drty n class TranslatonEntry Detaled explanaton n your report s requred to get any credt. 4
43 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson 4
44 Submsson Make sure your project can be executed over 7 workstaton and prnt message properly. Deadlne: //6 : For the delayed submsson, deduct two ponts for each day. Upload your team project to the FTP ftp server: os/os Pack the whole Nachos-4./code wthout any object fles and your report n a fle named OSPJ_GROUP##.tar.gz The report s lmted to A4 pages. 44
45 Note Do not copy homework. Keep your code secret. On any questons, wrte an e-mal to wth [project] prepend to ttle. 黃柏鈞 : b948@cse.ntu.edu.tw 何建忠 : r999@cse.ntu.edu.tw 陳煒栩 : wsh5angela@hotmal.com 鄭聖威 : r999@cse.ntu.edu.tw Come to R48/R44 durng TA hours 45
46 Thank you!
Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationIf you miss a key. Chapter 6: Demand Paging Source:
ADRIAN PERRIG & TORSTEN HOEFLER ( -6- ) Networks and Operatng Systems Chapter 6: Demand Pagng Source: http://redmne.replcant.us/projects/replcant/wk/samsunggalaxybackdoor If you mss a key after yesterday
More information#4 Inverted page table. The need for more bookkeeping. Inverted page table architecture. Today. Our Small Quiz
ADRIAN PERRIG & TORSTEN HOEFLER Networks and Operatng Systems (-6-) Chapter 6: Demand Pagng http://redmne.replcant.us/projects/replcant/wk/samsunggalaxybackdoor () # Inverted table One system-wde table
More informationHarvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)
Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst
More informationADRIAN PERRIG & TORSTEN HOEFLER ( -6- ) Networks and Operatng Systems Chapter 6: Demand Pagng Page Table Structures Page table structures Page table structures Problem: smple lnear table s too bg Problem:
More informationAssembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.
IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language
More informationOverview. CSC 2400: Computer Systems. Pointers in C. Pointers - Variables that hold memory addresses - Using pointers to do call-by-reference in C
CSC 2400: Comuter Systems Ponters n C Overvew Ponters - Varables that hold memory addresses - Usng onters to do call-by-reference n C Ponters vs. Arrays - Array names are constant onters Ponters and Strngs
More informationMemory and I/O Organization
Memory and I/O Organzaton 8-1 Prncple of Localty Localty small proporton of memory accounts for most run tme Rule of thumb For 9% of run tme next nstructon/data wll come from 1% of program/data closest
More information4/11/17. Agenda. Princeton University Computer Science 217: Introduction to Programming Systems. Goals of this Lecture. Storage Management.
//7 Prnceton Unversty Computer Scence 7: Introducton to Programmng Systems Goals of ths Lecture Storage Management Help you learn about: Localty and cachng Typcal storage herarchy Vrtual memory How the
More informationAgenda & Reading. Simple If. Decision-Making Statements. COMPSCI 280 S1C Applications Programming. Programming Fundamentals
Agenda & Readng COMPSCI 8 SC Applcatons Programmng Programmng Fundamentals Control Flow Agenda: Decsonmakng statements: Smple If, Ifelse, nested felse, Select Case s Whle, DoWhle/Untl, For, For Each, Nested
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationCache Performance 3/28/17. Agenda. Cache Abstraction and Metrics. Direct-Mapped Cache: Placement and Access
Agenda Cache Performance Samra Khan March 28, 217 Revew from last lecture Cache access Assocatvty Replacement Cache Performance Cache Abstracton and Metrcs Address Tag Store (s the address n the cache?
More informationNews. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
More informationHigh level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization
What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton
More informationEsc101 Lecture 1 st April, 2008 Generating Permutation
Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationAn Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems
S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More informationNotes on Organizing Java Code: Packages, Visibility, and Scope
Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationPass by Reference vs. Pass by Value
Pass by Reference vs. Pass by Value Most methods are passed arguments when they are called. An argument may be a constant or a varable. For example, n the expresson Math.sqrt(33) the constant 33 s passed
More information5.1 The ISR: Overvieui. chapter
chapter 5 The LC-3 n Chapter 4, we dscussed the basc components of a computer ts memory, ts processng unt, ncludng the assocated temporary storage (usually a set of regsters), nput and output devces, and
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationInstallation and User Guide. Digidim Remote Control (303) Product description. Switching Lights On/Off using Digidim 303 Remote
Installaton and User Gude Dgdm Remote Control (0) Product descrpton The Dgdm Remote (0) can be used n conjuncton wth the Dm Sense to modfy the preset lght levels and recall/ store scenes, as well as actvatng
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationPriority queues and heaps Professors Clark F. Olson and Carol Zander
Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty
More informationMotivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:
4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationVerification by testing
Real-Tme Systems Specfcaton Implementaton System models Executon-tme analyss Verfcaton Verfcaton by testng Dad? How do they know how much weght a brdge can handle? They drve bgger and bgger trucks over
More informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
More informationkccvoip.com basic voip training NAT/PAT extract 2008
kccvop.com basc vop tranng NAT/PAT extract 28 As we have seen n the prevous sldes, SIP and H2 both use addressng nsde ther packets to rely nformaton. Thnk of an envelope where we place the addresses of
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationTerminal Window. 11. Section 7 Exercises Program Memory Exercise 7-1 Swap Values in an Array Working memory Global Memory. 2 nd call 3 rd call
11. Secton 7 Exercses Program Memory Exercse 7-1 Swap Values n an Array Workng memory Global Memory class SwapTlYouDrop publc statc vod man (Strng args[ ]) nt = 0; nt a; a = new nt[] 2, 4, 6, 8, 10, 12
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More information9. BASIC programming: Control and Repetition
Am: In ths lesson, you wll learn: H. 9. BASIC programmng: Control and Repetton Scenaro: Moz s showng how some nterestng patterns can be generated usng math. Jyot [after seeng the nterestng graphcs]: Usng
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationReal-time Scheduling
Real-tme Schedulng COE718: Embedded System Desgn http://www.ee.ryerson.ca/~courses/coe718/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrcal and Computer Engneerng Ryerson Unversty Overvew RTX
More informationMidterms Save the Dates!
Unversty of Brtsh Columba CPSC, Intro to Computaton Alan J. Hu Readngs Ths Week: Ch 6 (Ch 7 n old 2 nd ed). (Remnder: Readngs are absolutely vtal for learnng ths stuff!) Thnkng About Loops Lecture 9 Some
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationCache Memories. Lecture 14 Cache Memories. Inserting an L1 Cache Between the CPU and Main Memory. General Org of a Cache Memory
Topcs Lecture 4 Cache Memores Generc cache memory organzaton Drect mapped caches Set assocate caches Impact of caches on performance Cache Memores Cache memores are small, fast SRAM-based memores managed
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationIntroducing User Programs into Nachos
Introducing User Programs into Nachos User Programs MIPS instr Nachos MIPS sim Syscalls Nachos calls OS Kernel Machine instructions SPARC HW Internal User Process Nachos thread Conceptually: Nachos thread
More informationReal-Time Systems. Real-Time Systems. Verification by testing. Verification by testing
EDA222/DIT161 Real-Tme Systems, Chalmers/GU, 2014/2015 Lecture #8 Real-Tme Systems Real-Tme Systems Lecture #8 Specfcaton Professor Jan Jonsson Implementaton System models Executon-tme analyss Department
More informationA GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING
A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods
More informationIntroduction to Programming. Lecture 13: Container data structures. Container data structures. Topics for this lecture. A basic issue with containers
1 2 Introducton to Programmng Bertrand Meyer Lecture 13: Contaner data structures Last revsed 1 December 2003 Topcs for ths lecture 3 Contaner data structures 4 Contaners and genercty Contan other objects
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationSorting. Sorted Original. index. index
1 Unt 16 Sortng 2 Sortng Sortng requres us to move data around wthn an array Allows users to see and organze data more effcently Behnd the scenes t allows more effectve searchng of data There are MANY
More informationStorage Binding in RTL synthesis
Storage Bndng n RTL synthess Pe Zhang Danel D. Gajsk Techncal Report ICS-0-37 August 0th, 200 Center for Embedded Computer Systems Department of Informaton and Computer Scence Unersty of Calforna, Irne
More informationA GENERAL APPROACH FOR MAN-MACHINE SYSTEMS DESIGN
Copyrght 2002 IFAC 5th Trennal World Congress, Barcelona, Span A GENERAL APPROACH FOR MAN-MACHINE SYSTEMS DESIGN A.Skaf,2, B.Davd 2, Z.Bnder, B. Descotes-Genon Laboratore d'automatque de Grenoble (LAG)
More informationWightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK
Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your
More informationOracle Database: SQL and PL/SQL Fundamentals Certification Course
Oracle Database: SQL and PL/SQL Fundamentals Certfcaton Course 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and
More informationGiving credit where credit is due
CSCE 23J Computer Organzaton Cache Memores Dr. Stee Goddard goddard@cse.unl.edu Gng credt where credt s due Most of sldes for ths lecture are based on sldes created by Drs. Bryant and O Hallaron, Carnege
More informationOutline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression
Project 3 Two-densonal arras Ma 9, 6 Thrd Prograng Project Two-Densonal Arras Larr Caretto Coputer Scence 6 Coputng n Engneerng and Scence Ma 9, 6 Outlne Quz three on Thursda for full lab perod See saple
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationSpace-Optimal, Wait-Free Real-Time Synchronization
1 Space-Optmal, Wat-Free Real-Tme Synchronzaton Hyeonjoong Cho, Bnoy Ravndran ECE Dept., Vrgna Tech Blacksburg, VA 24061, USA {hjcho,bnoy}@vt.edu E. Douglas Jensen The MITRE Corporaton Bedford, MA 01730,
More informationSetup and Use. Version 3.7 2/1/2014
Verson 3.7 2/1/2014 Setup and Use MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com Contents Text2Bd checklst 3 Preparng
More informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationComputer Architecture ELEC3441
Causes of Cache Msses: The 3 C s Computer Archtecture ELEC3441 Lecture 9 Cache (2) Dr. Hayden Kwo-Hay So Department of Electrcal and Electronc Engneerng Compulsory: frst reference to a lne (a..a. cold
More information11. HARMS How To: CSV Import
and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationCS 268: Lecture 8 Router Support for Congestion Control
CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationan assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han
UNITY as a Tool for Desgn and Valdaton of a Data Replcaton System Phlppe Quennec Gerard Padou CENA IRIT-ENSEEIHT y Nnth Internatonal Conference on Systems Engneerng Unversty of Nevada, Las Vegas { 14-16
More informationThis chapter discusses aspects of heat conduction. The equilibrium heat conduction on a rod. In this chapter, Arrays will be discussed.
1 Heat Flow n a Rod Ths chapter dscusses aspects of heat conducton. The equlbrum heat conducton on a rod. In ths chapter, Arrays wll be dscussed. Arrays provde a mechansm for declarng and accessng several
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationRESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS
RESSTE CRCUTS MULT NODE/LOOP CRCUT ANALYSS DEFNNG THE REFERENCE NODE S TAL 4 THESTATEMENT 4 S MEANNGLES UNTL THE REFERENCE PONT S DEFNED BY CONENTON THE GROUND SYMBOL SPECFES THE REFERENCE PONT. ALL NODE
More informationMultitasking and Real-time Scheduling
Multtaskng and Real-tme Schedulng EE8205: Embedded Computer Systems http://www.ee.ryerson.ca/~courses/ee8205/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrcal and Computer Engneerng Ryerson Unversty
More informationFIBARO WALL PLUG OPERATING MANUAL FGBWHWPE-102/FGBWHWPF-102 CONTENTS
OPERATING MANUAL EN FIBARO WALL PLUG FGBWHWPE-102/FGBWHWPF-102 CONTENTS #1: Descrpton and features 3 #2: Parng the accessory 4 #3: Reset 5 #4: Functonalty 6 v1.0 #5: W-F 8 #6: Confgurable parameters 9
More informationA Flexible Architecture for Creating Scheduling Algorithms as used in STK Scheduler
A Flexble Archtecture for Creatng Schedulng Algorthms as used n STK Scheduler W. A. Fsher and Ella Herz Optwse Corporaton and Orbt Logc Incorporated fsher@optwse.com and ella.herz@orbtlogc.com Abstract
More informationSetup and Use. For events not using AuctionMaestro Pro. Version /7/2013
Verson 3.1.2 2/7/2013 Setup and Use For events not usng AuctonMaestro Pro MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com
More informationA New Transaction Processing Model Based on Optimistic Concurrency Control
A New Transacton Processng Model Based on Optmstc Concurrency Control Wang Pedong,Duan Xpng,Jr. Abstract-- In ths paper, to support moblty and dsconnecton of moble clents effectvely n moble computng envronment,
More informationVirtual Memory In Nachos
Virtual Memory In Nachos Michael Jantz Prasad Kulkarni EECS 678 Nachos Virtual Memory 1 Introduction This lab is intended to introduce the final Nachos assignment. Please grab the starter code for this
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationSpecifications in 2001
Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secret-key
More informationThe stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0
The stream cpher MICKEY-128 (verson 1 Algorthm specfcaton ssue 1. Steve Babbage Vodafone Group R&D, Newbury, UK steve.babbage@vodafone.com Matthew Dodd Independent consultant matthew@mdodd.net www.mdodd.net
More informationCS240: Programming in C. Lecture 12: Polymorphic Sorting
CS240: Programmng n C ecture 12: Polymorphc Sortng Sortng Gven a collecton of tems and a total order over them, sort the collecton under ths order. Total order: every tem s ordered wth respect to every
More informationInstallation Instructions. METRAwin Version 8/ Calibration Software
Installaton Instructons METRAwn 90 Calbraton Software 3-349-717-15 Verson 8/05.13 Copyrght Copyrght 2003-2013 GMC-I Messtechnk GmbH. All rghts reserved. These nstallaton nstructons, as well as the software
More informationProduct Specification
Product Specfcaton Integral SVR-PRO 200 SMW 2.5 SATA 6Gbps SSD 100 GB 200 GB 400 GB 800 GB 3.2 TB 6.4 TB INTRODUCTION The SVR-PRO 200 SMW SSD range s desgned for mxed workload applcatons, offers up to
More informationPBRT core. Announcements. pbrt. pbrt plug-ins
Announcements PBRT core Dgtal Image Synthess Yung-Yu Chuang 9/27/2007 Please subscrbe the malng lst. Wndows complaton Debuggng n Wndows Doxygen (onlne, download or doxygen by yourself) HW#1 wll be assgned
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationA Predictable Execution Model for COTS-based Embedded Systems
2011 17th IEEE Real-Tme and Embedded Technology and Applcatons Symposum A Predctable Executon Model for COTS-based Embedded Systems Rodolfo Pellzzon, Emlano Bett, Stanley Bak, Gang Yao, John Crswell, Marco
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationSearching & Sorting. Definitions of Search and Sort. Linear Search in C++ Linear Search. Week 11. index to the item, or -1 if not found.
Searchng & Sortng Wee 11 Gadds: 8, 19.6,19.8 CS 5301 Sprng 2014 Jll Seaman 1 Defntons of Search and Sort Search: fnd a gven tem n a lst, return the ndex to the tem, or -1 f not found. Sort: rearrange the
More information