operating system kernels
play

Operating System Kernels Presenter: Saikat Guha Cornell University - PowerPoint PPT Presentation

Operating System Kernels Presenter: Saikat Guha Cornell University CS 614, Fall 2005 Operating System Kernels CS 614, Fall 2005 Operating Systems Initially, the OS was a run-time library Batch (5565): Resident, spooled jobs


  1. Operating System Kernels Presenter: Saikat Guha Cornell University CS 614, Fall 2005 Operating System Kernels CS 614, Fall 2005

  2. Operating Systems ◮ Initially, the OS was a run-time library ◮ Batch (’55–’65): Resident, spooled jobs ◮ Multiprogrammed (late ’60): Multiple jobs ◮ Time-sharing (’70s): Interactive jobs ◮ Multics, UNIX ◮ Networked OS, Distributed OS, Parallel OS, Real-time OS Operating System Kernels CS 614, Fall 2005

  3. UNIX ◮ THE operating system ◮ Dennis Ritchie, Ken Thompson at AT&T ◮ “File” Abstraction ◮ Kernel ◮ Processes, IPC ◮ Filesystem ◮ Networking (eventually) ◮ Graphics (Windows) ◮ Userspace ◮ Shell ◮ Commands Operating System Kernels CS 614, Fall 2005

  4. Operating Systems Process 1 Process 2 Process 3 Process 4 Process 5 Kernel Hardware User-Kernel Split Operating System Kernels CS 614, Fall 2005

  5. Operating Systems Process 1 Process 2 Process 3 Process 4 Process 5 Filesystem Pipe Kernel Hardware Monolothic Kernel Operating System Kernels CS 614, Fall 2005

  6. Operating Systems Filesystem Process 1 Process 2 Process 3 Network IPC Kernel Hardware Microkernel Operating System Kernels CS 614, Fall 2005

  7. µ -Kernels ◮ Minimal services ◮ Usually threads or processes, address space and inter-process communication (IPC) ◮ User-space Filesystem, Network, Graphics, even device drivers sometimes. Operating System Kernels CS 614, Fall 2005

  8. Monolithic Kernels: Advantages ◮ Kernel has access to everything ◮ All optimizations possible ◮ All techniques/mechanisms/concepts can be implemented ◮ Extended by simply adding more code ◮ Linux at 3.3M lines of code ◮ Tackle complexity ◮ Layered kernels ◮ Modular kernels ◮ Object oriented kernels. Do C++, Java, C# help? Operating System Kernels CS 614, Fall 2005

  9. µ -Kernels: Advantages ◮ Minimal ◮ Smaller trusted base ◮ Less error prone ◮ Server malfunction easily isolated ◮ Elegant ◮ Enforces modularity ◮ Restartable user-level services ◮ Extensible ◮ Different servers/API can coexist Operating System Kernels CS 614, Fall 2005

  10. µ -Kernels ◮ 1st generation µ -kernels ◮ Mach (CMU) 1 ◮ Chorus (Inria, Chorus systems) ◮ Amoeba (Vrije University) ◮ L3 (GMD) 2 1 External pager 2 User-Level Driver Operating System Kernels CS 614, Fall 2005

  11. µ -Kernels: Problems ◮ Overheads ◮ Chen and Bershad, ’93 ◮ Impact of caches, locality, TLB collisions ◮ Up 66% degradation in Mach ◮ Co-located servers for performance ◮ Can be optimized to be fast on an architecture ◮ But, performance not preserved on other architectures Operating System Kernels CS 614, Fall 2005

  12. µ -Kernels ◮ 2nd generation µ -kernels ◮ Spin (UWash) ◮ Exokernel (MIT) ◮ L4 (GMD/IBM/UKa) 3 3 User-Level Address Space Operating System Kernels CS 614, Fall 2005

  13. Summary of First Paper ◮ The Performance of µ -Kernel-Based Systems (H¨ artig et al., SOSP ’97) ◮ Evaluates a L 4 µ -kernel based system ◮ Ports Linux to run on top of L 4 ◮ Suggests improvements Operating System Kernels CS 614, Fall 2005

  14. L 4 -Linux filesystem network Process 1 Process 2 Process 3 Linux L4 Backend L4 Kernel Hardware L 4 -Linux Operating System Kernels CS 614, Fall 2005

  15. L 4 -Linux ◮ 2 basic concepts ◮ Threads ◮ Address Spaces (AS) ◮ Recursive construction of AS ◮ Grant - Give a page to another AS ◮ Map - Share a page with another AS ◮ Demap - Revoke a mapped or granted page ◮ I/O ports treated as AS ◮ Hardware interrupts treated as IPC Operating System Kernels CS 614, Fall 2005

  16. L 4 -Linux ◮ TLB caches page-table lookups ◮ Flused during context switch ◮ Flushing not necessary for tagged TLBs ◮ L 4 -Linux avoids frequent flushes ◮ Pentium CPU’s emulate tagged TLBs for small address spaces ◮ syscall time ◮ Unix – 20 µ s ◮ Mach – 114 µ s ◮ L 4 – 5 µ s Operating System Kernels CS 614, Fall 2005

  17. Performance Is L 4 -Linux a practical system? Operating System Kernels CS 614, Fall 2005

  18. Performance Is L 4 -Linux a practical system? Yes Operating System Kernels CS 614, Fall 2005

  19. Performance Is L 4 -Linux a practical system? Yes Operating System Kernels CS 614, Fall 2005

  20. Performance ◮ L 4 incurs 5%–10% overhead ◮ Collocation alone does not solve performance problems ◮ What about L 4 without collocation? ◮ L 4 -Linux is proof-of-concept ◮ Pipes can be made faster ◮ Better VM in non-legacy mode ◮ Can benefit from cache partitioning Operating System Kernels CS 614, Fall 2005

  21. Comparison L 4 -Linux Flux OSKit ◮ Tons of ◮ Highly optimized functionality (for x86) ◮ Functionality (Linux, BSD, Java, SML, ...) ◮ Not tuned for high limited by Linux performance ◮ Untrusted ◮ Implementation components details exposed isolated Operating System Kernels CS 614, Fall 2005

  22. Flux OSKit ◮ Framework and reusable OS components ◮ Focus on component of research-interest ◮ Reuse other existing components for functionality Operating System Kernels CS 614, Fall 2005

  23. Flux OSKit Flux OSKit Components Operating System Kernels CS 614, Fall 2005

  24. Flux OSKit ◮ Bootloader ◮ Multiboot compliant ◮ Kernel Support Library ◮ Architecture specific ◮ Memory Management Library ◮ kmalloc(), alignment etc. ◮ Minimal libc ◮ non-buffered read(), write() etc. ◮ minimizes dependencies Operating System Kernels CS 614, Fall 2005

  25. Flux OSKit ◮ Debugging Support ◮ GDB over serial line ◮ Device Driver Support ◮ Drivers from Linux, FreeBSD inside wrappers ◮ Protocol Stacks ◮ “Wrapped” FreeBSD network stack ◮ File System ◮ “Wrapped” NetBSD code Operating System Kernels CS 614, Fall 2005

  26. Flux OSKit ◮ OSKit components are separable, no dependence ◮ Other OS: Modularity does not imply independence Filesystem Memory Manager { void *malloc() { ... ... malloc() } ... } void void Filesystem Memory Manager *malloc() { *my_malloc() { { c_malloc(); malloc(); void *malloc() { } } ... ... malloc() } ... } ... c_malloc = my_malloc ... Very little overhead ◮ Provides abstractions ◮ Doesn’t hide implementation Operating System Kernels CS 614, Fall 2005

  27. Case Studies ◮ ML/OS ◮ SML: Static Typing, Concurrency through continuations, No stack, Aggressive heap usage, Interpreted. ◮ ML/OS: 2 people, one semester using OSKit ◮ Java ◮ Existing JVM ◮ Java/OS: 3 weeks using OSKit ◮ SR ◮ Concurrent programming language Operating System Kernels CS 614, Fall 2005

  28. Summary ◮ L 4 -Linux: µ -Kernels can be fast ◮ Full system binary-compatible with Linux runs 5%–10% slower. ◮ FluxOSKit: Kernels from reusable components ◮ Write fully-functional research OS in weeks Operating System Kernels CS 614, Fall 2005

Recommend


More recommend