11 Pages

lecture20

Course: COSC 6397, Fall 2008
School: U. Houston
Rating:
 
 
 
 
 

Word Count: 573

Document Preview

Migration Movement Process of a currently executing process to a new processor Process migration mechanism how the system migrates a process from source to destination Homogenous Heterogeneous Distributed shared memory Remote execution process execution on a new machine Load balancing policy when and where to transfer a process E.g., CPU resource, network bandwidth 167 Example : Heart Transplant 168 Metrics...

Register Now

Unformatted Document Excerpt

Coursehero >> Texas >> U. Houston >> COSC 6397

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Migration Movement Process of a currently executing process to a new processor Process migration mechanism how the system migrates a process from source to destination Homogenous Heterogeneous Distributed shared memory Remote execution process execution on a new machine Load balancing policy when and where to transfer a process E.g., CPU resource, network bandwidth 167 Example : Heart Transplant 168 Metrics of Process Migration Process migration time The time from issuing the migration request until the process can execute on the new machine Excision time The time it takes for the process of extracting process information from the operating system kernel Insertion The time it takes for the process to insert process information to the operating system kernel 169 What needs to be migrated? Process control information Priority, state, process ID, parent process ID Execution state Processor state, registers, stack pointer, program counter Address space The entire virtual memory of the process Message Buffer messages, e.g., in the network stack or from other processes File information Can all processes be migrated? 170 Process Migration Algorithms Total copy As its name suggests Simple Heavy overhead Demand page No virtual memory pages Transfer on demand in case of page faults File Server Introduce a third server Freeze free Send current code, stack and the current heap page Separate process state from the state of communication links, the later is migrate separately 171 OS Virtualization in MobiDesk Each session gets its own virtual private namespace Virtual: all OS resources are accessed through virtual identifiers Private: only processes within session can see the namespace Virtualization layer associate a virtual name with the OS physical name Traps all calls to OS and translates names System call interposition: wrappers around system calls that translate names virtual to physical names and prevent accesses across the session boundary chroot and file system stacking to provide each session with its own file system namespace Reminds of cygwin? 172 OS Virtualization in MobiDesk(Contd) Migration of session Use check-point restart Suspend the session Save high-level representation Digital signed and transfer to another machine Only applicable to the same platform, may accommodate different kernel version Comments: Software like VMWare, Windows Virtual Desktop provides virtualization of entire OS and allows running applications compiled for one platform to run another platform but sessions cannot be migrated across platforms 173 Network Virtualization in MobiDesk Issues Multiple sessions on the same server may run the same service Ongoing network connections must be preserved when a session is migrated from one server to another 174 Case 1: All servers on same subnet Solutions: Each session gets an IP address from the DHCP server Uses it as an alias on the NIC on the attached physical machine Gratuitous ARP is used to resolve MAC address change when sessions are migrated Proxy...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

U. Houston - COSC - 6397
1COSC6397 Homework Assignment 1 (Larger-scale Fading)Solution Problem 1. Suppose a transmitter produces 50W of power. a. Express the transmit power in units of dBm and dBW. b. If the transmitters power is applied to a unity gain antenna with a 900
U. Houston - COSC - 6397
COSC6397 Homework Assignment 3September 22, 20041Part 1: Routing1. Find the shortest path tree from every node to node 1 for the graph of Fig.1 using the Bellman-ford and Dijkstra algorithms.10 2 4 6 3 4 5 3 9 6 3 2 3 4 3 2 6 5 2147Fig
U. Houston - COSC - 7397
Robust Rate Adaptation for 802.11 Wireless NetworksStarsky H.Y. Wong1 , Hao Yang2 , Songwu Lu1 and Vaduvur Bharghavan3Dept. of Computer Science, UCLA, 4732 Boelter Hall, Los Angeles, CA 90025 1 IBM T.J. Watson Research, 19 Skyline Drive, Hawthorne,
U. Houston - COSC - 6397
Destination Sequenced Distance Vector (DSDV)Based on Bellman-ford algorithm with the following changes:Each routing table entry keeps (destination, next-hop, hop-count, seq, install time), seq is assigned by a destination nodeDestination A B C D N
U. Houston - COSC - 6397
I/O Multiplexing and Posix ThreadsCOSC 6397Rong Zheng1Possible Mechanisms for Creating Concurrent Service1. ProcessesKernel automatically interleaves multiple logical flows. Each flow has its own private address space.2. I/O multip
U. Houston - COSC - 6377
Fall 2007 COSC 6377 Computer Networks Instructor: Rong Zheng Email: rzheng@cs.uh.edu Lecture time: 4:00pm 5:30pm, MW Location: 205 sec Office Hours: 2:00pm 4pm M; 5:30 6:30 W Class web: Go to www.uh.edu/webct, click on WebCTVista button Lab: PGH 5
U. Houston - COSC - 6397
GPSR: Greedy Perimeter Stateless Routing for Wireless NetworksProposed by Brad Karp and H.T. Kung Uses Position Information to make routing decisionsRouting based on destinations geographical location Only need to maintain neighbors location inform
U. Houston - COSC - 6397
COSC6397 Homework Assignment 3September 15, 20041Part 1: Routing1. Find the shortest path tree from every node to node 1 for the graph of Fig.1 using the Bellman-ford and Dijkstra algorithms.10 2 4 6 3 4 5 3 9 6 3 2 3 4 3 2 6 5 2Due date: Se
U. Houston - COSC - 6377
Fall 2005 COSC 6377 Computer Networks Instructor: Rong Zheng Email: rzheng@cs.uh.edu Lecture time: 4:00pm 5:30pm, MW Location: 138-SR Office Hours: 2:30pm 4pm, MW TA: Mohammad A Muqsith (muqsith1530@yahoo.com) TA Office Hours: 2:00pm 4pm, TTh Clas
U. Houston - COSC - 6397
COSC 6397 Wireless Networking and Mobile ComputingDr. Rong Zheng rzheng@cs.uh.edu1Mobile computing Wireless networkingMobile computing computing on the move, can be wired Wireless networking facilitates mobile computing with flexibility of mo
U. Houston - COSC - 6375
COSC 6375: Computer System Performance EvaluationSpring 2009 Instructors: Email: Lectures Office Hours: Class web site: Textbook: Hisashi Kobayashi and Brian L. Mark, System Modeling and Analysis: Foundations of System Performance Evaluation. Prent
U. Houston - COSC - 7397
Exploring Complex Networks S. H. Strogatz, Exploring complex networks, Nature, 1998Faloutsos3, On power-law relationship on the Internet topology, SIGCOMM, 1999 A. Lakhina et al, Sampling biases in IP topology measurement, INFOCOM, 200342Out
U. Houston - COSC - 6397
COSC 6397 Computer network system laboratory Instructor: Rong Zheng (PGH 565) TA: Song Wei (PGH 311) Time: Wed 4 7pm Location: SEC 205 Objectives: The main objective of the network system labs is to further the understanding of the network protocol
U. Houston - COSC - 7397
Simulating the Power Consumption of LargeScale Sensor Network ApplicationsVictor Shnayder, Mark Hempstead, Bor-rong Chen, Geoff Werner Allen and Matt Walsh-Divya RaoDept of Electrical and Computer Engineering University of HoustonWhat is PowerT
U. Houston - COSC - 6397
L i nux Basi csReadi ng:Chap 1-2 [WFR05] L i nux Command M anualAbout L i nux L i nux i s the name of the ker nel L i nux i s Open Sour ce Softwar e (OSS) L i nux i s l i censed thr ough the Gener al Publ i cL i cense (ver si on 2, aka GP
U. Houston - COSC - 6397
Network Programming with SocketsReading:Stevens 3rd ed., Ch. 3-6, or 2nd ed.Beej's Guide to Network Programming http:/beej.us/guide/bgnet/1OutlineBasic socket programming Concurrent communication Libnet and libcap library2Sockets process
U. Houston - COSC - 6377
C C OS 6377: C pute Ne om r tworksRong Zhe ng rzhe cs.uh.e ng@ duC pute Ne om r tworking: A Top Down Approach Fe aturing the I nte t, rne 3rd e dition. JimKurose Ke Ross , ith Addison-We y, July 2004. sleI ntroduction1-1I ntroduction Ove w o
U. Houston - COSC - 7397
Opportunistic Multi-Hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence LabIntroduction Motivation Background Basic Idea of how ExOR works Why ExOR works ? Design Challenges Re
U. Houston - COSC - 7397
Song WeiEnabling Distributed Throughput Maximization in Wireless Mesh Networks A Partitioning Approach ProblemChannel Scheduling- -Centralized Distributed ModelGraph theory- -Conflict graph Graph coloringThroughput Con
U. Houston - COSC - 7397
Paper CritiqueJoseph Jefferson COSC7397 January 30, 2007"Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks", Draves, R.,Padhye, J., Zill, B The authors of this paper attempt to address the problem of lost capacity in wireless mesh networks.
U. Houston - COSC - 6397
Libpcap and Libnet1Why Libnet & Libpcap?Allow manipulation/interception of link layer packetsUsing socket programming, kernel will fill in the source IP address, checksum etc.Raw socket is one way to write IP packets directly but not everythin
U. Houston - COSC - 6397
Lecture 4: Wireless LAN & IEEE 802.11 Wireless LAN Standard54Wireless LANsApplicationsLAN Extension Cross-building interconnect (e.g., Seattle Wireless) Nomadic Access Ad hoc networkingExample technologiesInfrared (IR) LANs Spread spectrum L
U. Houston - COSC - 7388
1/20/2009COSC7388 Advanced Distributed Computing- How to build reliable wireless healthcare systems?Rong ZhengOutlineCourse overview Ten commandments on technical presentation How to write critiques? Paper sign-up211/20/2009Technical
U. Houston - COSC - 6374
COSC 6374 Parallel ComputationDebugging MPI applicationsEdgar Gabriel Spring 2008Edgar GabrielHow to use a cluster A cluster usually consists of a front-end node and compute nodes Name of the front-end node: shark.cs.uh.edu You can login to
U. Houston - COSC - 6374
COSC 6374 Parallel Computation 1st Project AssignmentEdgar Gabriel Spring 2008Edgar GabrielAbout the Project A sequential code performing typical image analysis tasks Code provided by Shishir Shah Input file: a flat image ( no compression ) 1
U. Houston - CS - 6360
COSC 6360: Operating Systems MATERIALS ON THE SECOND SPRING 2009 MIDTERMYou are responsible for the materials discussed in class as they are summarized in the handouts and/or mentioned in the PowerPoint presentations. I expect you to understand thes
U. Houston - CS - 4330
COSC 4330 Fundamentals of Operating Systems Assignment #1: Process SchedulingNow due on Wednesday, October 22 at 11:59:59 PMObjective This assignment will introduce you to process scheduling. Specifications You are to simulate the execution of a s
U. Houston - CS - 6360
COSC 6360: Operating Systems PAPERS ON THE FALL 2008 FINAL You are only responsible for the materials discussed in class as they are summarized in the handouts and discussed in the PowerPoint slides. I expect you to understand these summaries and to
U. Houston - CS - 6360
COSC 6360: Operating Systems MATERIALS ON THE FIRST FALL 2008 MIDTERMYou are only responsible for the materials discussed in class as they are summarized in the handouts and discussed in the PowerPoint presentations. I expect you to understand these
U. Houston - CS - 4330
CHAPTER V INTERPROCESS SYNCHRONIZATION5.1 THE CRITICAL SECTION PROBLEM Whenever two or more processes share common data (which can be stored in a file, a magnetic tape or a shared memory segment), unpredictable results are likely to happen if two
U. Houston - CS - 4330
CHAPTER IV INTERPROCESS COMMUNICATION4.1 INTRODUCTION Multiprogramming provides us with the illusion that each process runs on its own CPU (pseudo-multitasking). We can utilize it in one of the following two ways: (a) (b) completely insulate proces
U. Houston - CS - 6375
COSC 6375: Computer System Performance Evaluation MATERIALS ON THE SPRING 2008 FINAL You are only responsible for the materials discussed in class as they are summarized in the PowerPoint presentations. 1. Review of probabilities You should review th
U. Houston - CS - 4330
CHAPTER VII MEMORY MANAGEMENT7.1 INTRODUCTION Main memory and CPU are the two most important resources of a computer. Although main memory has become and continue to become cheaper and more abundant, it seems that computer systems never have enoug
U. Houston - CS - 6360
Extensibility, Safety and Performance in the SPIN Operating SystemBrian Bershad, Stefan Savage, Przemyslaw Pardyak, Emin Gun Sirer, Marc E. Fiuczynski, David Becker, Craig Chambers, Susan Eggers Department of Computer Science and Engineering Univers
U. Houston - CS - 6375
Step # 1: Create folder and name it as your "firstName_lastName" Step # 2: Copy all your assignment related files in the folder Step # 3: Zip the folder Step # 4: Email zipped folder To: r4rasheed@yahoo.com Subject : COSC6375 firstName lastName Submi
U. Houston - CS - 6360
COSC 6360FINAL EXAMINATIONDECEMBER 13, 2004This exam is closed book. You can have two pages of notes. UH expels cheaters. 1. Which of the following statements are true or false (2 points) and why? (3 points) a) Coda servers are not stateless. T
U. Houston - CS - 6360
NAME: _KEY_ (FIRST NAME FIRST) SCORE: _ COSC 6360 FIRST MIDTERM SEPTEMBER 26, 2006THIS EXAM IS CLOSED BOOK. YOU CAN HAVE ONE SHEET (I.E., TWO PAGES) OF NOTES. PLEASE ANSWER EVERY PART OF EVERY QUESTION. THIS UNIVERSITY EXPELS CHEATERS. 1. Consider
U. Houston - CS - 4330
NAME: _ (FIRST NAME FIRST) SCORE: _COSC 4330FINAL EXAMINATIONDECEMBER 12, 2006THIS EXAM IS CLOSED BOOK. YOU CAN HAVE ONE PAGE OF NOTES. UH EXPELS CHEATERS.1. Complete the following sentences: (45 points) a) _Messages_ are an example of a con
U. Houston - CS - 4330
COSC 4330FINAL EXAMINATIONMAY 11, 2005This exam is closed book. You can have one page of notes. UH expels cheaters.1. Wolves and Sheep: A park ranger has to manage an area that can contain either wolves or sheep, but not both at the same time
U. Houston - CS - 6360
COSC 6360FIRST MIDTERMFEBRUARY 12, 2003This exam is closed book. You can have one sheet (i.e., two pages) of notes. Please answer every part of every question 1. Match each of the following UNIX features with the function it performs: (102 poin
U. Houston - CS - 6360
COSC 6360MIDTERMFEBRUARY 27, 2002This exam is closed book. You can have one sheet (i.e., two pages) of notes. Please answer every part of every question 1. Explain how you could use an exokernel to support multiple user interfaces on the same m
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360-Operating Systems FINAL PART I December 12, 1989Be concise but complete. The exami
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360-Operating Systems MIDTERM EXAMINATION March 8, 1
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360-Operating Systems MIDTERM April 2, 1992Be concise but complete.1. W
U. Houston - CS - 6375
g+ -DCPP $* /usr/lib/libcsimcpp.a -lm
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360: Operating Systems FINAL EXAMINATION Part I: General Questions QUALIFYING EXAMINATION
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360-Operating Systems QUALIFYING EXAMINATION Graduate Part
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360-Operating Systems MIDTERM EXAMINATION March 28, 1
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360: Operating Systems MIDTERM March 21, 1991CLOSED BOOK. You may have wit
U. Houston - CS - 6360
COSC 6360MIDTERMOCTOBER 23, 2002This exam is closed book. You can have one sheet of notes. Cheaters will be expelled from UH. Answers that are not specific to the question being asked will not be read. 1. Spring treats the thread issuing a cros
U. Houston - CS - 4330
CHAPTER III SCHEDULING3.1 INTRODUCTION The scheduler is the part of the operating system that decides how to allocate the CPU and the main memory to the processes. a) The CPU scheduler decides which process should get the CPU; it is also called sho
U. Houston - CS - 4330
COSC 4330FINALDECEMBER 18, 2002This exam is closed book. You can have one page of notes. UH expels cheaters.1. True or False: (102 points; no penalty for incorrect answers) T _ F X_ T _ F X_ T _ F X_ T X_ F _ T X_ F _ T X_ F _ T _ F X_ T X_ F
U. Houston - CS - 6360
NAME: _ (FIRST NAME FIRST) SCORE: _ COSC 6360 SECOND MIDTERM OCTOBER 26, 2006THIS EXAM IS CLOSED BOOK. YOU CAN HAVE ONE SHEET (I.E., TWO PAGES) OF NOTES. 1. Explain why Spin is (a) more extensible than Unix, (b) more efficient than Mach and (c) saf
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360-Operating Systems QUALIFYING EXAMINATION Graduate
U. Houston - CS - 3480
Spatial Data Management and Design and Creation of a Database for this PurposeCOSC 3480 Lab5Last updated: March 29, 2006Project # 5 (total score =300) Deadlines: April 13. 10a: Submit status report in class (the report should outline what you p
U. Houston - CS - 6367
Quadratic Programming Solutions of the Transportation ProblemJustin Thomas The following solutions were derived using the quadprog Matlab function. This quadratic programming function is only available with the Optimization Toolkit.Problem 1 F2 C
U. Houston - CS - 6367
Documentation of XCSFJava 1.1 plus VisualizationMartin V. Butz MEDAL Report No. 2007008 July 2007 AbstractThis report gives an overview of the XCSFJava 1.1 code, available from the web. The document species where to get the code and how to compile
U. Houston - CS - 4368
U. Houston - CS - 6367
What is an Evolutionary Algorithm?Chapter 2A.E. Eiben and J.E. Smith, What is an Evolutionary Algorithm? With Additions and Modifications by Ch. EickContents Recapof Evolutionary Metaphor Basic scheme of an EA Basic Components: Representa
U. Houston - CS - 6367
Numerical OptimizationsGeneral Framework: objective function f(x1,.,xn) to be minimized or maximized constraints: gi(x1,.,xn) leq/eq 0 (i=1,.,m) xi >= 0 i=1,.,n (optional)sApproaches: Classical: Differentiate the function and find points w
U. Houston - CS - 4368
Assignment 3 Dr. Eick's COSC 4368 Spring 2008 Theorem Proving and Reasoning in Uncertain EnvironmentsDue dates: Problems 11,12, 14: Saturday, April 26, 9p Problem 10: Submit 12page report by Mo., April 28, noon; be prepared to demo your program on