Bài giảng Operating system Concepts - Module 21: Windows 2000 (Chuẩn kiến thức)

Nội dung text: Bài giảng Operating system Concepts - Module 21: Windows 2000 (Chuẩn kiến thức)

1. Module 21: Windows 2000 n History n Design Principles n System Components n Environmental Subsystems n File system n Networking n Programmer Interface Operating System Concepts 21.1 Silberschatz, Galvin and Gagne 2002
2. Windows 2000 n 32-bit preemptive multitasking operating system for Intel microprocessors. n Key goals for the system: F portability F security F POSIX compliance F multiprocessor support F extensibility F international support F compatibility with MS-DOS and MS-Windows applications. n Uses a micro-kernel architecture. n Available in four versions, Professional, Server, Advanced Server, National Server. n In 1996, more NT server licenses were sold than UNIX licenses Operating System Concepts 21.2 Silberschatz, Galvin and Gagne 2002
3. History n In 1988, Microsoft decided to develop a “new technology” (NT) portable operating system that supported both the OS/2 and POSIX APIs. n Originally, NT was supposed to use the OS/2 API as its native environment but during development NT was changed to use the Win32 API, reflecting the popularity of Windows 3.0. Operating System Concepts 21.3 Silberschatz, Galvin and Gagne 2002
4. Design Principles n Extensibility — layered architecture. F Executive, which runs in protected mode, provides the basic system services. F On top of the executive, several server subsystems operate in user mode. F Modular structure allows additional environmental subsystems to be added without affecting the executive. n Portability — 2000 can be moved from on hardware architecture to another with relatively few changes. F Written in C and C++. F Processor-dependent code is isolated in a dynamic link library (DLL) called the “hardware abstraction layer” (HAL). Operating System Concepts 21.4 Silberschatz, Galvin and Gagne 2002
5. Design Principles (Cont.) n Reliability — 2000 uses hardware protection for virtual memory, and software protection mechanisms for operating system resources. n Compatibility — applications that follow the IEEE 1003.1 (POSIX) standard can be complied to run on 2000 without changing the source code. n Performance — 2000 subsystems can communicate with one another via high-performance message passing. F Preemption of low priority threads enables the system to respond quickly to external events. F Designed for symmetrical multiprocessing. n International support — supports different locales via the national language support (NLS) API. Operating System Concepts 21.5 Silberschatz, Galvin and Gagne 2002
6. 2000 Architecture n Layered system of modules. n Protected mode — HAL, kernel, executive. n User mode — collection of subsystems F Environmental subsystems emulate different operating systems. F Protection subsystems provide security functions. Operating System Concepts 21.6 Silberschatz, Galvin and Gagne 2002
7. Depiction of 2000 Architecture Operating System Concepts 21.7 Silberschatz, Galvin and Gagne 2002
8. System Components — Kernel n Foundation for the executive and the subsystems. n Never paged out of memory; execution is never preempted. n Four main responsibilities: F thread scheduling F interrupt and exception handling F low-level processor synchronization F recovery after a power failure n Kernel is object-oriented, uses two sets of objects. F dispatcher objects control dispatching and synchronization (events, mutants, mutexes, semaphores, threads and timers). F control objects (asynchronous procedure calls, interrupts, power notify, power status, process and profile objects.) Operating System Concepts 21.8 Silberschatz, Galvin and Gagne 2002
9. Kernel — Process and Threads n The process has a virtual memory address space, information (such as a base priority), and an affinity for one or more processors. n Threads are the unit of execution scheduled by the kernel’s dispatcher. n Each thread has its own state, including a priority, processor affinity, and accounting information. n A thread can be one of six states: ready, standby, running, waiting, transition, and terminated. Operating System Concepts 21.9 Silberschatz, Galvin and Gagne 2002
10. Kernel — Scheduling n The dispatcher uses a 32-level priority scheme to determine the order of thread execution. Priorities are divided into two classes F The real-time class contains threads with priorities ranging from 16 to 32. F The variable class contains threads having priorities from 0 to 15. n Characteristics of 2000’s priority strategy. F Trends to give very good response times to interactive threads that are using the mouse and windows. F Enables I/O-bound threads to keep the I/O devices busy. F Complete-bound threads soak up the spare CPU cycles in the background. Operating System Concepts 21.10 Silberschatz, Galvin and Gagne 2002
11. Kernel — Scheduling (Cont.) n Scheduling can occur when a thread enters the ready or wait state, when a thread terminates, or when an application changes a thread’s priority or processor affinity. n Real-time threads are given preferential access to the CPU; but 2000 does not guarantee that a real-time thread will start to execute within any particular time limit. Operating System Concepts 21.11 Silberschatz, Galvin and Gagne 2002
12. Kernel — Trap Handling n The kernel provides trap handling when exceptions and interrupts are generated by hardware of software. n Exceptions that cannot be handled by the trap handler are handled by the kernel's exception dispatcher. n The interrupt dispatcher in the kernel handles interrupts by calling either an interrupt service routine (such as in a device driver) or an internal kernel routine. n The kernel uses spin locks that reside in global memory to achieve multiprocessor mutual exclusion. Operating System Concepts 21.12 Silberschatz, Galvin and Gagne 2002
13. Executive — Object Manager n 2000 uses objects for all its services and entities; the object manger supervises the use of all the objects. F Generates an object handle F Checks security. F Keeps track of which processes are using each object. n Objects are manipulated by a standard set of methods, namely create, open, close, delete, query name, parse and security. Operating System Concepts 21.13 Silberschatz, Galvin and Gagne 2002
14. Executive — Naming Objects n The 2000 executive allows any object to be given a name, which may be either permanent or temporary. n Object names are structured like file path names in MS- DOS and UNIX. n 2000 implements a symbolic link object, which is similar to symbolic links in UNIX that allow multiple nicknames or aliases to refer to the same file. n A process gets an object handle by creating an object by opening an existing one, by receiving a duplicated handle from another process, or by inheriting a handle from a parent process. n Each object is protected by an access control list. Operating System Concepts 21.14 Silberschatz, Galvin and Gagne 2002
15. Executive — Virtual Memory Manager n The design of the VM manager assumes that the underlying hardware supports virtual to physical mapping a paging mechanism, transparent cache coherence on multiprocessor systems, and virtual addressing aliasing. n The VM manager in 2000 uses a page-based management scheme with a page size of 4 KB. n The 2000 VM manager uses a two step process to allocate memory. F The first step reserves a portion of the process’s address space. F The second step commits the allocation by assigning space in the 2000 paging file. Operating System Concepts 21.15 Silberschatz, Galvin and Gagne 2002
16. Virtual-Memory Layout Operating System Concepts 21.16 Silberschatz, Galvin and Gagne 2002
17. Virtual Memory Manager (Cont.) n The virtual address translation in 2000 uses several data structures. F Each process has a page directory that contains 1024 page directory entries of size 4 bytes. F Each page directory entry points to a page table which contains 1024 page table entries (PTEs) of size 4 bytes. F Each PTE points to a 4 KB page frame in physical memory. n A 10-bit integer can represent all the values form 0 to 1023, therefore, can select any entry in the page directory, or in a page table. n This property is used when translating a virtual address pointer to a bye address in physical memory. n A page can be in one of six states: valid, zeroed, free standby, modified and bad. Operating System Concepts 21.17 Silberschatz, Galvin and Gagne 2002
18. Virtual-to-Physical Address Translation n 10 bits for page directory entry, 20 bits for page table entry, and 12 bits for byte offset in page. Operating System Concepts 21.18 Silberschatz, Galvin and Gagne 2002
19. Page File Page-Table Entry n 5 bits for page protection, 20 bits for page frame address, 4 bits to select a paging file, and 3 bits that describe the page state. V = 0 Operating System Concepts 21.19 Silberschatz, Galvin and Gagne 2002
20. Executive — Process Manager n Provides services for creating, deleting, and using threads and processes. n Issues such as parent/child relationships or process hierarchies are left to the particular environmental subsystem that owns the process. Operating System Concepts 21.20 Silberschatz, Galvin and Gagne 2002
21. Executive — Local Procedure Call Facility n The LPC passes requests and results between client and server processes within a single machine. n In particular, it is used to request services from the various 2000 subsystems. n When a LPC channel is created, one of three types of message passing techniques must be specified. F First type is suitable for small messages, up to 256 bytes; port's message queue is used as intermediate storage, and the messages are copied from one process to the other. F Second type avoids copying large messages by pointing to a shared memory section object created for the channel. F Third method, called quick LPC was used by graphical display portions of the Win32 subsystem. Operating System Concepts 21.21 Silberschatz, Galvin and Gagne 2002
22. Executive — I/O Manager n The I/O manager is responsible for F file systems F cache management F device drivers F network drivers n Keeps track of which installable file systems are loaded, and manages buffers for I/O requests. n Works with VM Manager to provide memory-mapped file I/O. n Controls the 2000 cache manager, which handles caching for the entire I/O system. n Supports both synchronous and asynchronous operations, provides time outs for drivers, and has mechanisms for one driver to call another. Operating System Concepts 21.22 Silberschatz, Galvin and Gagne 2002
23. File I/O Operating System Concepts 21.23 Silberschatz, Galvin and Gagne 2002
24. Executive — Security Reference Manager n The object-oriented nature of 2000 enables the use of a uniform mechanism to perform runtime access validation and audit checks for every entity in the system. n Whenever a process opens a handle to an object, the security reference monitor checks the process’s security token and the object’s access control list to see whether the process has the necessary rights. Operating System Concepts 21.24 Silberschatz, Galvin and Gagne 2002
25. Environmental Subsystems n User-mode processes layered over the native 2000 executive services to enable 2000 to run programs developed for other operating system. n 2000 uses the Win32 subsystem as the main operating environment; Win32 is used to start all processes. It also provides all the keyboard, mouse and graphical display capabilities. n MS-DOS environment is provided by a Win32 application called the virtual dos machine (VDM), a user-mode process that is paged and dispatched like any other 2000 thread. Operating System Concepts 21.25 Silberschatz, Galvin and Gagne 2002
26. Environmental Subsystems (Cont.) n 16-Bit Windows Environment: F Provided by a VDM that incorporates Windows on Windows. F Provides the Windows 3.1 kernel routines and sub routines for window manager and GDI functions. n The POSIX subsystem is designed to run POSIX applications following the POSIX.1 standard which is based on the UNIX model. Operating System Concepts 21.26 Silberschatz, Galvin and Gagne 2002
27. File System n The fundamental structure of the 2000 file system (NTFS) is a volume. F Created by the 2000 disk administrator utility. F Based on a logical disk partition. F May occupy a portions of a disk, an entire disk, or span across several disks. n All metadata, such as information about the volume, is stored in a regular file. n NTFS uses clusters as the underlying unit of disk allocation. F A cluster is a number of disk sectors that is a power of two. F Because the cluster size is smaller than for the 16-bit FAT file system, the amount of internal fragmentation is reduced. Operating System Concepts 21.27 Silberschatz, Galvin and Gagne 2002
28. File System — Internal Layout n NTFS uses logical cluster numbers (LCNs) as disk addresses. n A file in NTFS is not a simple byte stream, as in MS-DOS or UNIX, rather, it is a structured object consisting of attributes. n Every file in NTFS is described by one or more records in an array stored in a special file called the Master File Table (MFT). n Each file on an NTFS volume has a unique ID called a file reference. F 64-bit quantity that consists of a 48-bit file number and a 16- bit sequence number. F Can be used to perform internal consistency checks. n The NTFS name space is organized by a hierarchy of directories; the index root contains the top level of the B+ tree. Operating System Concepts 21.28 Silberschatz, Galvin and Gagne 2002
29. File System — Recovery n All file system data structure updates are performed inside transactions. F Before a data structure is altered, the transaction writes a log record that contains redo and undo information. F After the data structure has been changed, a commit record is written to the log to signify that the transaction succeeded. F After a crash, the file system data structures can be restored to a consistent state by processing the log records. Operating System Concepts 21.29 Silberschatz, Galvin and Gagne 2002
30. File System — Recovery (Cont.) n This scheme does not guarantee that all the user file data can be recovered after a crash, just that the file system data structures (the metadata files) are undamaged and reflect some consistent state prior to the crash n The log is stored in the third metadata file at the beginning of the volume. n The logging functionality is provided by the 2000 log file service. Operating System Concepts 21.30 Silberschatz, Galvin and Gagne 2002
31. File System — Security n Security of an NTFS volume is derived from the 2000 object model. n Each file object has a security descriptor attribute stored in this MFT record. n This attribute contains the access token of the owner of the file, and an access control list that states the access privileges that are granted to each user that has access to the file. Operating System Concepts 21.31 Silberschatz, Galvin and Gagne 2002
32. Volume Management and Fault Tolerance — FtDisk, the fault tolerant disk driver for 2000, provides several ways to combine multiple SCSI disk drives into one logical volume. n Logically concatenate multiple disks to form a large logical volume, a volume set. n Interleave multiple physical partitions in round-robin fashion to form a stripe set (also called RAID level 0, or “disk striping”). F Variation: stripe set with parity, or RAID level 5. n Disk mirroring, or RAID level 1, is a robust scheme that uses a mirror set — two equally sized partitions on tow disks with identical data contents. n To deal with disk sectors that go bad, FtDisk, uses a hardware technique called sector sparing and NTFS uses a software technique called cluster remapping. Operating System Concepts 21.32 Silberschatz, Galvin and Gagne 2002
33. Volume Set On Two Drives Operating System Concepts 21.33 Silberschatz, Galvin and Gagne 2002
34. Stripe Set on Two Drives Operating System Concepts 21.34 Silberschatz, Galvin and Gagne 2002
35. Stripe Set With Parity on Three Drives Operating System Concepts 21.35 Silberschatz, Galvin and Gagne 2002
36. Mirror Set on Two Drives Operating System Concepts 21.36 Silberschatz, Galvin and Gagne 2002
37. File System — Compression n To compress a file, NTFS divides the file’s data into compression units, which are blocks of 16 contiguous clusters. n For sparse files, NTFS uses another technique to save space. F Clusters that contain all zeros are not actually allocated or stored on disk. F Instead, gaps are left in the sequence of virtual cluster numbers stored in the MFT entry for the file. F When reading a file, if a gap in the virtual cluster numbers is found, NTFS just zero-fills that portion of the caller’s buffer. Operating System Concepts 21.37 Silberschatz, Galvin and Gagne 2002
38. Networking n 2000 supports both peer-to-peer and client/server networking; it also has facilities for network management. n To describe networking in 2000, we refer to two of the internal networking interfaces: F NDIS (Network Device Interface Specification) — Separates network adapters from the transport protocols so that either can be changed without affecting the other. F TDI (Transport Driver Interface) — Enables any session layer component to use any available transport mechanism. n 2000 implements transport protocols as drivers that can be loaded and unloaded from the system dynamically. Operating System Concepts 21.38 Silberschatz, Galvin and Gagne 2002
39. Networking — Protocols n The server message block (SMB) protocol is used to send I/O requests over the network. It has four message types: - Session control - File - Printer - Message n The network basic Input/Output system (NetBIOS) is a hardware abstraction interface for networks. Used to: F Establish logical names on the network. F Establish logical connections of sessions between two logical names on the network. F Support reliable data transfer for a session via NetBIOS requests or SMBs Operating System Concepts 21.39 Silberschatz, Galvin and Gagne 2002
40. Networking — Protocols (Cont.) n NetBEUI (NetBIOS Extended User Interface): default protocol for Windows 95 peer networking and Windows for Workgroups; used when 2000 wants to share resources with these networks. n 2000 uses the TCP/IP Internet protocol to connect to a wide variety of operating systems and hardware platforms. n PPTP (Point-to-Point Tunneling Protocol) is used to communicate between Remote Access Server modules running on 2000 machines that are connected over the Internet. n The 2000 NWLink protocol connects the NetBIOS to Novell NetWare networks. Operating System Concepts 21.40 Silberschatz, Galvin and Gagne 2002
41. Networking — Protocols (Cont.) n The Data Link Control protocol (DLC) is used to access IBM mainframes and HP printers that are directly connected to the network. n 2000 systems can communicate with Macintosh computers via the Apple Talk protocol if an 2000 Server on the network is running the Windows 2000 Services for Macintosh package. Operating System Concepts 21.41 Silberschatz, Galvin and Gagne 2002
42. Networking — Dist. Processing Mechanisms n 2000 supports distributed applications via named NetBIOS,named pipes and mailslots, Windows Sockets, Remote Procedure Calls (RPC), and Network Dynamic Data Exchange (NetDDE). n NetBIOS applications can communicate over the network using NetBEUI, NWLink, or TCP/IP. n Named pipes are connection-oriented messaging mechanism that are named via the uniform naming convention (UNC). n Mailslots are a connectionless messaging mechanism that are used for broadcast applications, such as for finding components on the network, n Winsock, the windows sockets API, is a session-layer interface that provides a standardized interface to many transport protocols that may have different addressing schemes. Operating System Concepts 21.42 Silberschatz, Galvin and Gagne 2002
43. Distributed Processing Mechanisms (Cont.) n The 2000 RPC mechanism follows the widely-used Distributed Computing Environment standard for RPC messages, so programs written to use 2000 RPCs are very portable. F RPC messages are sent using NetBIOS, or Winsock on TCP/IP networks, or named pipes on LAN Manager networks. F 2000 provides the Microsoft Interface Definition Language to describe the remote procedure names, arguments, and results. Operating System Concepts 21.43 Silberschatz, Galvin and Gagne 2002
44. Networking — Redirectors and Servers n In 2000, an application can use the 2000 I/O API to access files from a remote computer as if they were local, provided that the remote computer is running an MS-NET server. n A redirector is the client-side object that forwards I/O requests to remote files, where they are satisfied by a server. n For performance and security, the redirectors and servers run in kernel mode. Operating System Concepts 21.44 Silberschatz, Galvin and Gagne 2002
45. Access to a Remote File n The application calls the I/O manager to request that a file be opened (we assume that the file name is in the standard UNC format). n The I/O manager builds an I/O request packet. n The I/O manager recognizes that the access is for a remote file, and calls a driver called a Multiple Universal Naming Convention Provider (MUP). n The MUP sends the I/O request packet asynchronously to all registered redirectors. n A redirector that can satisfy the request responds to the MUP. F To avoid asking all the redirectors the same question in the future, the MUP uses a cache to remember with redirector can handle this file. Operating System Concepts 21.45 Silberschatz, Galvin and Gagne 2002
46. Access to a Remote File (Cont.) n The redirector sends the network request to the remote system. n The remote system network drivers receive the request and pass it to the server driver. n The server driver hands the request to the proper local file system driver. n The proper device driver is called to access the data. n The results are returned to the server driver, which sends the data back to the requesting redirector. Operating System Concepts 21.46 Silberschatz, Galvin and Gagne 2002
47. Networking — Domains n NT uses the concept of a domain to manage global access rights within groups. n A domain is a group of machines running NT server that share a common security policy and user database. n 2000 provides three models of setting up trust relationships. F One way, A trusts B F Two way, transitive, A trusts B, B trusts C so A, B, C trust each other F Crosslink – allows authentication to bypass hierarchy to cut down on authentication traffic. Operating System Concepts 21.47 Silberschatz, Galvin and Gagne 2002
48. Name Resolution in TCP/IP Networks n On an IP network, name resolution is the process of converting a computer name to an IP address. e.g., www.bell-labs.com resolves to 135.104.1.14 n 2000 provides several methods of name resolution: F Windows Internet Name Service (WINS) F broadcast name resolution F domain name system (DNS) F a host file F an LMHOSTS file Operating System Concepts 21.48 Silberschatz, Galvin and Gagne 2002
49. Name Resolution (Cont.) n WINS consists of two or more WINS servers that maintain a dynamic database of name to IP address bindings, and client software to query the servers. n WINS uses the Dynamic Host Configuration Protocol (DHCP), which automatically updates address configurations in the WINS database, without user or administrator intervention. Operating System Concepts 21.49 Silberschatz, Galvin and Gagne 2002
50. Programmer Interface — Access to Kernel Obj. n A process gains access to a kernel object named XXX by calling the CreateXXX function to open a handle to XXX; the handle is unique to that process. n A handle can be closed by calling the CloseHandle function; the system may delete the object if the count of processes using the object drops to 0. n 2000 provides three ways to share objects between processes. F A child process inherits a handle to the object. F One process gives the object a name when it is created and the second process opens that name. — DuplicateHandle function: 4 Given a handle to process and the handle’s value a second process can get a handle to the same object, and thus share it. Operating System Concepts 21.50 Silberschatz, Galvin and Gagne 2002
51. Programmer Interface — Process Management n Process is started via the CreateProcess routine which loads any dynamic link libraries that are used by the process, and creates a primary thread. n Additional threads can be created by the CreateThread function. n Every dynamic link library or executable file that is loaded into the address space of a process is identified by an instance handle. Operating System Concepts 21.51 Silberschatz, Galvin and Gagne 2002
52. Process Management (Cont.) n Scheduling in Win32 utilizes four priority classes: - IDLE_PRIORITY_CLASS (priority level 4) - NORMAL_PRIORITY_CLASS (level8 — typical for most processes - HIGH_PRIORITY_CLASS (level 13) - REALTIME_PRIORITY_CLASS (level 24) n To provide performance levels needed for interactive programs, 2000 has a special scheduling rule for processes in the NORMAL_PRIORITY_CLASS. F 2000 distinguishes between the foreground process that is currently selected on the screen, and the background processes that are not currently selected. F When a process moves into the foreground, 2000 increases the scheduling quantum by some factor, typically 3. Operating System Concepts 21.52 Silberschatz, Galvin and Gagne 2002
53. Process Management (Cont.) n The kernel dynamically adjusts the priority of a thread depending on whether it is I/O-bound or CPU-bound. n To synchronize the concurrent access to shared objects by threads, the kernel provides synchronization objects, such as semaphores and mutexes. F In addition, threads can synchronize by using the WaitForSingleObject or WaitForMultipleObjects functions. F Another method of synchronization in the Win32 API is the critical section. Operating System Concepts 21.53 Silberschatz, Galvin and Gagne 2002
54. Process Management (Cont.) n A fiber is user-mode code that gets scheduled according to a user-defined scheduling algorithm. F Only one fiber at a time is permitted to execute, even on multiprocessor hardware. F 2000 includes fibers to facilitate the porting of legacy UNIX applications that are written for a fiber execution model. Operating System Concepts 21.54 Silberschatz, Galvin and Gagne 2002
55. Programmer Interface — Interprocess Comm. n Win32 applications can have interprocess communication by sharing kernel objects. n An alternate means of interprocess communications is message passing, which is particularly popular for Windows GUI applications. F One thread sends a message to another thread or to a window. F A thread can also send data with the message. n Every Win32 thread has its won input queue from which the thread receives messages. n This is more reliable than the shared input queue of 16-bit windows, because with separate queues, one stuck application cannot block input to the other applications. Operating System Concepts 21.55 Silberschatz, Galvin and Gagne 2002
56. Programmer Interface — Memory Management n Virtual memory: - VirtualAlloc reserves or commits virtual memory. - VirtualFree decommits or releases the memory. F These functions enable the application to determine the virtual address at which the memory is allocated. n An application can use memory by memory mapping a file into its address space. F Multistage process. F Two processes share memory by mapping the same file into their virtual memory. Operating System Concepts 21.56 Silberschatz, Galvin and Gagne 2002
57. Memory Management (Cont.) n A heap in the Win32 environment is a region of reserved address space. F A Win 32 process is created with a 1 MB default heap. F Access is synchronized to protect the heap’s space allocation data structures from damage by concurrent updates by multiple threads. n Because functions that rely on global or static data typically fail to work properly in a multithreaded environment, the thread-local storage mechanism allocates global storage on a per-thread basis. F The mechanism provides both dynamic and static methods of creating thread-local storage. Operating System Concepts 21.57 Silberschatz, Galvin and Gagne 2002