July-10-2002 Terry Jones, Integrated Computing & Communications Dept Fast-OS.

Slides:



Advertisements
Similar presentations
Chapter 6: Memory Management
Advertisements

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Operating Systems Lecture 10 Issues in Paging and Virtual Memory Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard. Zhiqing.
Multiprocessor OS The functional capabilities often required in an OS for a multiprogrammed computer include the resource allocation and management schemes,
Threads, SMP, and Microkernels Chapter 4. Process Resource ownership - process is allocated a virtual address space to hold the process image Scheduling/execution-
Using DSVM to Implement a Distributed File System Ramon Lawrence Dept. of Computer Science
Lincoln University Canterbury New Zealand Evaluating the Parallel Performance of a Heterogeneous System Elizabeth Post Hendrik Goosen formerly of Department.
Computer Systems/Operating Systems - Class 8
1. Overview  Introduction  Motivations  Multikernel Model  Implementation – The Barrelfish  Performance Testing  Conclusion 2.
CS533 Concepts of Operating Systems Class 14 Virtualization.
Scheduler Activations Effective Kernel Support for the User-Level Management of Parallelism.
Home: Phones OFF Please Unix Kernel Parminder Singh Kang Home:
Disco Running Commodity Operating Systems on Scalable Multiprocessors.
1 New Architectures Need New Languages A triumph of optimism over experience! Ian Watson 3 rd July 2009.
Computer Organization and Architecture
ECE669 L23: Parallel Compilation April 29, 2004 ECE 669 Parallel Computer Architecture Lecture 23 Parallel Compilation.
The Origin of the VM/370 Time-sharing system Presented by Niranjan Soundararajan.
Basics of Operating Systems March 4, 2001 Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard.
Stack Management Each process/thread has two stacks  Kernel stack  User stack Stack pointer changes when exiting/entering the kernel Q: Why is this necessary?
What is Concurrent Programming? Maram Bani Younes.
Ch4: Distributed Systems Architectures. Typically, system with several interconnected computers that do not share clock or memory. Motivation: tie together.
Chapter 2 Operating System Overview Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and Design Principles,
Computer System Architectures Computer System Software
Operating System A program that controls the execution of application programs An interface between applications and hardware 1.
Yavor Todorov. Introduction How it works OS level checkpointing Application level checkpointing CPR for parallel programing CPR functionality References.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 2: System Structures.
1 COMPSCI 110 Operating Systems Who - Introductions How - Policies and Administrative Details Why - Objectives and Expectations What - Our Topic: Operating.
Introduction and Overview Questions answered in this lecture: What is an operating system? How have operating systems evolved? Why study operating systems?
Parallel Programming Models Jihad El-Sana These slides are based on the book: Introduction to Parallel Computing, Blaise Barney, Lawrence Livermore National.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 3: Operating Systems Computer Science: An Overview Tenth Edition.
I-SPAN’05 December 07, Process Scheduling for the Parallel Desktop Designing Parallel Operating Systems using Modern Interconnects Process Scheduling.
Extreme-scale computing systems – High performance computing systems Current No. 1 supercomputer Tianhe-2 at petaflops Pushing toward exa-scale computing.
1 COMPSCI 110 Operating Systems Who - Introductions How - Policies and Administrative Details Why - Objectives and Expectations What - Our Topic: Operating.
After step 2, processors know who owns the data in their assumed partitions— now the assumed partition defines the rendezvous points Scalable Conceptual.
Computers Operating System Essentials. Operating Systems PROGRAM HARDWARE OPERATING SYSTEM.
1 Mobile Management of Network Files Alex BassiMicah Beck Terry Moore Computer Science Department University of Tennessee.
G53SEC 1 Reference Monitors Enforcement of Access Control.
 Virtual machine systems: simulators for multiple copies of a machine on itself.  Virtual machine (VM): the simulated machine.  Virtual machine monitor.
OPERATING SYSTEM SUPPORT DISTRIBUTED SYSTEMS CHAPTER 6 Lawrence Heyman July 8, 2002.
OSes: 3. OS Structs 1 Operating Systems v Objectives –summarise OSes from several perspectives Certificate Program in Software Development CSE-TC and CSIM,
1 Operating System Overview Chapter 2. 2 Operating System A program that controls the execution of application programs An interface between applications.
CS533 - Concepts of Operating Systems 1 The Mach System Presented by Catherine Vilhauer.
1 COMPSCI 110 Operating Systems Who - Introductions How - Policies and Administrative Details Why - Objectives and Expectations What - Our Topic: Operating.
Welcome to CPS 210 Graduate Level Operating Systems –readings, discussions, and programming projects Systems Quals course –midterm and final exams Gateway.
Chapter 2 Operating System Overview Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and Design Principles,
M. Accetta, R. Baron, W. Bolosky, D. Golub, R. Rashid, A. Tevanian, and M. Young MACH: A New Kernel Foundation for UNIX Development Presenter: Wei-Lwun.
Operating Systems: Wrap-Up Questions answered in this lecture: What is an Operating System? Why are operating systems so interesting? What techniques can.
Bronis R. de Supinski and Jeffrey S. Vetter Center for Applied Scientific Computing August 15, 2000 Umpire: Making MPI Programs Safe.
1/31/20161 Final Exam Dec 10. Monday. 4-7pm. Phelp 1160 Similar to midterm The exam is closed book. You can bring 2 page of notes (double sided) Nachos.
Protection of Processes Security and privacy of data is challenging currently. Protecting information – Not limited to hardware. – Depends on innovation.
TRIALS AND TRIBULATIONS Architectural Constraints on Modeling a Visuomotor Task within the Reinforcement Learning Paradigm.
1 Operating System Overview Chapter 2. 2 Operating System A program that controls the execution of application programs An interface between applications.
Background Computer System Architectures Computer System Software.
Presented by: Sagnik Bhattacharya Kingshuk Govil, Dan Teodosiu, Yongjang Huang, Mendel Rosenblum.
Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine and Mendel Rosenblum Presentation by Mark Smith.
Introduction to operating systems What is an operating system? An operating system is a program that, from a programmer’s perspective, adds a variety of.
The University of Adelaide, School of Computer Science
LLNL-PRES This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.
INTRODUCTION TO HIGH PERFORMANCE COMPUTING AND TERMINOLOGY.
Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,
COMPSCI 110 Operating Systems
Distributed Processors
Operating Systems (CS 340 D)
COMPSCI 110 Operating Systems
CS490 Windows Internals Quiz 2 09/27/2013.
Operating Systems (CS 340 D)
Process Description and Control
Subject Name: Operating System Concepts Subject Number:
Operating System Introduction.
Chapter-1 Computer is an advanced electronic device that takes raw data as an input from the user and processes it under the control of a set of instructions.
Presentation transcript:

July Terry Jones, Integrated Computing & Communications Dept Fast-OS

Terry Jones / July 2002 FastOS Fast-OS Introduction – Today’s landscape – Directions Problem Areas Ripe for Investigation – Parallel Aware Scaling – Parallel Aware Memory Management – Metrics for evaluating system software Why would anyone want to muck with AIX – Bottom-up and Top-down Approaches – Why AIX? – How AIX? Conclusion

Terry Jones / July 2002 FastOS Fast-OS Introduction – Today’s landscape – Directions Problem Areas Ripe for Investigation – Parallel Aware Scaling – Parallel Aware Memory Management – Metrics for evaluating system software Why would anyone want to muck with AIX – Bottom-up and Top-down Approaches – Why AIX? – How AIX? Conclusion

Terry Jones / July 2002 FastOS Fast-OS Parallel applications need to span thousands of nodes Architectures are adding more processor state Applications are not “mission critical” Both interrupts and busy-waiting are bad Cache effects (processor affinity) cannot be ignored Two modes:Capability mode (jobs are dedicated) Capacity mode (jobs may space-share machine)

Terry Jones / July 2002 FastOS Fast-OS Continue to move from a monolithic operating system which communicates via shared-memory TO a decentralized design which communicates via efficient messages Small kernel & process level managers –Modularity –Fault-tolerance –Extensibility Question: How much should system software offer in terms of features? Answer: Everything required, and as much desired as possible

Terry Jones / July 2002 FastOS Fast-OS Introduction – Today’s landscape – Directions Problem Areas Ripe for Investigation – Parallel Aware Scaling – Parallel Aware Memory Management – Metrics for evaluating system software Why would anyone want to muck with AIX – Bottom-up and Top-down Approaches – Why AIX? – How AIX? Conclusion

Terry Jones / July 2002 FastOS Fast-OS Add “parallel awareness” – CPU resource (local/global program context, scheduling) – Memory resource (demand paging, address space extent) – Metrics – Other possibilities: Fault tolerance/Membership services Re-visit where we insert boundaries (e.g. boundary between kernel and user-level code)

Terry Jones / July 2002 FastOS Fast-OS Spatial Scheduling –Assign processes to nodes –For example, batch schedulers & gang-schedulers –Coarse grain view of work to be done Temporal Scheduling –For example, native operating system scheduling –Fine grain view of work to be done (e.g. efficient pthread level scheduling) –Lack necessary global view Coscheduling

Terry Jones / July 2002 FastOS Fast-OS Even on the most bare-bones operating systems, there can be more runnable processes than processors Many parallel algorithms are extremely sensitive to serializations A first order goal is to maximize the overlap of competing (interfering) processes during a parallel application.

Terry Jones / July 2002 FastOS Fast-OS Provide as much “memory” as possible with as little pain as possible Memory systems are becoming more complex Improved mechanisms to counter false-sharing.

Terry Jones / July 2002 FastOS Fast-OS External storage (secondary & networked) will continue to exceed local memory Memory requirements for certain simulations are almost unbounded Removing constraints on memory is very desirable, but the cost of a page-fault is too much to have hidden from an application Default process level manager provide page-cache management as in Stanford DASH.

Terry Jones / July 2002 FastOS Fast-OS Thought to preclude or make more difficult OS bypass communications An application cannot know the amount of physical memory it has available An application cannot efficiently control the contents of the physical memory allocated to it An application cannot control the read-ahead, writeback and discarding of pages within it’s physical memory.

Terry Jones / July 2002 FastOS Fast-OS An aid for reaching agreement on what we want A quantitative measure of different approaches Compared to the scheduler work and the virtual memory work, may be the most difficult

Terry Jones / July 2002 FastOS Fast-OS Introduction – Today’s landscape – Directions Problem Areas Ripe for Investigation – Parallel Aware Scaling – Parallel Aware Memory Management – Metrics for evaluating system software Why would anyone want to muck with AIX – Bottom-up and Top-down Approaches – Why AIX? – How AIX? Conclusion

Terry Jones / July 2002 FastOS Fast-OS Bottom-up – Start with a clean-slate – Add features as the need arises – Settle on a reasonable boundary Top-down – Start with a full-featured implementation – Remove the unnecessary cruft – Settle on a reasonable boundary

Terry Jones / July 2002 FastOS Fast-OS AIX is ubiquitous in supercomputer centers AIX already has extensive capabilities –Not required to build everything before we try anything AIX is mature (read: is not in radical change mode) AIX scalability (32-way with AIX 5.x)

Terry Jones / July 2002 FastOS Fast-OS In close conjunction with IBM –Expect successes to payoff in IBM products Done in an operating system independent manner –Findings apropos and available to other operating systems Evaluated with real applications on very large machines

Terry Jones / July 2002 FastOS Fast-OS Introduction – Today’s landscape – Directions Problem Areas Ripe for Investigation – Parallel Aware Scaling – Parallel Aware Memory Management – Metrics for evaluating system software Why would anyone want to muck with AIX – Bottom-up and Top-down Approaches – Why AIX? – How AIX? Conclusion

Terry Jones / July 2002 FastOS Fast-OS New needs arising from today’s parallel machines pose new challenges for system software Among the key needs which emerge... –Parallel aware scheduling –Improved memory management –Metrics for evaluating operating systems These can be investigated from a bottom-up approach, or a top-down approach, or both AIX is a reasonable choice for a top-down approach This work was performed under the auspices of the U.S. Department of Energy by University of California Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48.