Thursday, July 30, 2009 at 4:07 AM | 0 comments  
Many-to-One
* Many user-level threads mapped to single kernel thread
* Examples:
-Solaris Green Threads-GNU Portable Threads





















One-to-One
* Each user-level thread maps to kernel thread
* Examples
-Windows NT/XP/2000
-Linux
-Solaris 9 and later










Many-to-Many Model
* Allows many user level threads to be mapped to many kernel threads
* Allows the operating system to create a sufficient number of kernel threads
* Solaris prior to version 9* Windows NT/2000 with the Thread Fiber package




Posted by Roger Labels:
* Thread library provides programmer with API for creating and managing threads
* Two primary ways of implementing
-Library entirely in user space
-Kernel-level library supported by the OS
Posted by Roger Labels:
* Supported by the Kernel
* Examples
-Windows XP/2000
-Solaris
-Linux
-Tru64 UNIX
-Mac OS X
Posted by Roger Labels:
User thread
* Thread management done by user-level threads library
* Three primary thread libraries:
- POSIX Threads
- Win32 threads
- Java threads
Posted by Roger Labels:
In computer science, a thread of execution results from a fork of a computer program into two or more concurrently running tasks. The implementation of threads and processes differs from one operating system to another, but in most cases, a thread is contained inside a process. Multiple threads can exist within the same process and share resources such as memory, while different processes do not share these resources.


single thread process

Single-threaded Apartments-Single-threaded apartments consist of exactly one thread, so all COM objects that live in a single-threaded apartment can receive method calls only from the one thread that belongs to that apartment. All method calls to a COM object in a single-threaded apartment are synchronized with the windows message queue for the single-threaded apartment's thread. A process with a single thread of execution is simply a special case of this model.



multi-thread process

Multithreaded Apartments-Multithreaded apartments consist of one or more threads, so all COM objects that live in an multithreaded apartment can receive method calls directly from any of the threads that belong to the multithreaded apartment. Threads in a multithreaded apartment use a model called free-threading. Calls to COM objects in a multithreaded apartment are synchronized by the objects themselves."
Posted by Roger Labels:
Direct Communication

* Processes must name each other explicitly:
- Send (P, message) – send a message to process P
- receive (Q, message) – receive a message from process Q
* Properties of communication link
- Links are established automatically.
- A link is associated with exactly one pair of communicating
Processes.
- Between each pair there exists exactly one link.
- The link may be unidirectional, but is usually bi-directional.
* Asymmetric variant
- receive (id, message) – receive a message from any
Process, pid stored in id




Indirect Communication

*Messages are directed and received from mailboxes (als
Referred to as ports).
- Each mailbox has a unique id.
- Processes can communicate only if they share a mailbox.
Properties of communication link
- Link established only if processes share a common mailbox
- A link may be associated with many processes.
- Each pair of processes may share several communications
Links.
- Link may be unidirectional or bi-directional.
* Operations
- create a new mailbox
- send and receive messages through mailbox
- destroy a mailbox
* Primitives are defined as:
Send (A, message) – send a message to mailbox A
Receive (A, message) – receive a message from mailbox A
* Mailbox sharing
- P1, P2, and P3 share mailbox A.
- P1, sends; P2 and P3 receive.
- Who gets the message?
* Solutions
- Allow a link to be associated with at most two processes.
- Allow only one process at a time to execute a receive
Operation.
- Allow the system to select arbitrarily the receiver. Sender is
Notified who the receiver was.



Synchronization

*Message passing may be either blocking or non-blocking.
* locking is considered synchronous
* Non-blocking is considered asynchronous
* send and receive primitives may be either blocking or
non-blocking.



Buffering

* Queue of messages attached to the link; implemented in
One of three ways.
1. Zero capacity – 0 messages
Sender must wait for receiver (rendezvous).
2. Bounded capacity – finite length of nmessages
Sender must wait if link full.
3. Unbounded capacity – infinite length
Sender never waits.
Exercise: Read about Mach and Windows 2000



Producer consumer example

In computer science the producer-consumer problem (also known as the bounded-buffer problem) is a classical example of a multi-process synchronization problem. The problem describes two processes, the producer and the consumer, who share a common, fixed-size buffer. The producer's job is to generate a piece of data, put it into the buffer and start again. At the same time the consumer is consuming the data (i.e. removing it from the buffer) one piece at a time. The problem is to make sure that the producer won't try to add data into the buffer if it's full and that the consumer won't try to remove data from an empty buffer.The solution for the producer is to go to sleep if the buffer is full. The next time the consumer removes an item from the buffer, it wakes up the producer who starts to fill the buffer again. In the same way, the consumer goes to sleep if it finds the buffer to be empty. The next time the producer puts data into the buffer, it wakes up the sleeping consumer. The solution can be reached by means of inter-process communication, typically using semaphores. An inadequate solution could result in a deadlock where both processes are waiting to be awakened.
Posted by Roger Labels:
* Mechanism for processes to communicate and to synchronize their actions.
* Message system – processes communicate with each other without resorting to shared variables.n IPC facility provides two operations:
: send(message) –message size fixed or variable
: receive(message)
* If P and Q wish to communicate, they need to:
: establish a communication link between them
: exchange messages via send/receive
* Implementation of communication link
: physical (e.g., shared memory, hardware bus) considered later
: logical (e.g., logical properties) now
Posted by Roger Labels:
* Independent process cannot affect or be affected by the execution of another process.
* Cooperating process can affect or be affected by the execution of another process
* Advantages of process cooperation
: Information sharing
: Computation speed-up
: Modularity
: Convenience
Posted by Roger Labels:
Process State

* As a process executes, it changes state
: new: The process is being created.
: running: Instructions are being executed.
: waiting: The process is waiting for some event to occur.
: ready: The process is waiting to be assigned to a processor
: terminated: The process has finished execution.


Process Control Block

*Information associated with each process.
: Process ID
: Process staten Program counter
: CPU registersn CPU scheduling information
: Memory-management information
: Accounting information
: I/O status information
Posted by Roger Labels:
Process Creation



Parent process creates children processes, which, in turn create other processes, forming a tree of processes.
Resource sharing

* Parent and children share all resources.
* Children share subset of parent’s resources.
* Parent and child share no resources.
Execution

* Parent and children execute concurrently.
* Parent waits until children terminate.
Address space

* Child duplicate of parent.
* Child has a program loaded into it.
UNIX examples

* fork system call creates new process
* fork returns 0 to child , process id of child for parent
* exec system call used after a fork to replace the process’ memory space with a new program



Process Termination

Process executes last statement and asks the operating system to delete it (exit).
*Output data from child to parent (via wait).
*Process’ resources are deallocated by operating system.
Parent may terminate execution of children processes (abort).
*Child has exceeded allocated resources.
*Task assigned to child is no longer required.
*Parent is exiting.
:Operating system does not allow child to continue if its parent terminates.
:Cascading termination.
*In Unix, if parent exits children are assigned init as parent
Posted by Roger Labels:
Scheduling Queues

*Job queue – set of all processes in the system.
*Ready queue – set of all processes residing in main memory, ready and waiting to execute.
*Device queues – set of processes waiting for an I/O device.
*Processes migrate between the various queues.

Schedulers

*Long-term scheduler (or job scheduler) – selects which processes should be brought into the ready queue.
*Short-term scheduler (or CPU scheduler) – selects whichprocess should be executed next and allocates CPU.
* Short-term scheduler is invoked very frequently (milliseconds) fi (must be fast).
* Long-term scheduler is invoked very infrequently (seconds, minutes) fi (may be slow).
* The long-term scheduler controls the degree of multiprogramming.
* Processes can be described as either:
* I/O-bound process – spends more time doing I/O than computations, many short CPU bursts.
* CPU-bound process – spends more time doing computations; few very long CPU bursts


Context Switch

* When CPU switches to another process, the ssave the state of the old process and load the for the new process.
* Context-switch time is overhead; the system douseful work while switching.
* Time dependent on hardware support.
Posted by Roger Labels:
Tuesday, July 7, 2009 at 3:47 AM | 0 comments  
  • Operating system must be made available to hardware so hardware can start it
    * Small piece of code – bootstrap loader, locates the kernel, loads it into memory, and starts it
    * Sometimes two-step process where boot block at fixed location loads bootstrap loader
    * When power initialized on system, execution starts at a fixed memory location
Posted by Roger Labels:
  • Operating systems are designed to run on any of a class of machines; the system must be configured for each specific computer site.
  • SYSGEN program obtains information concerning the specific configuration of the hardware system.
  • Booting – starting a computer by loading the kernel.
  • Bootstrap program – code stored in ROM that is able to locate the kernel, load it into memory, and start its execution.
Posted by Roger Labels:

  • A virtual machine takes the layered approach to its logical conclusion. It treats hardware and the operating system kernel as though they were all hardware.
  • A virtual machine provides an interface identical to the underlying bare hardware.
  • The operating system creates the illusion of multiple processes, each executing on its own processor with its own (virtual) memory.
  • The resources of the physical computer are shared to create the virtual machines.
    * CPU scheduling can create the appearance that users have their own processor.
    * Spooling and a file system can provide virtual card readers and virtual line printers.
    * A normal user time-sharing terminal serves as the virtual machine operator’s console.

IMPLEMENTAION

  • Traditionally written in assembly language, operating systems can now be written in higher-level languages.
  • Code written in a high-level language:
    * can be written faster.
    * is more compact.
    * is easier to understand and debug.
  • An operating system is far easier to port (move to some other hardware) if it is written in a high-level language.

BENEFITS

  • The virtual-machine concept provides complete protection of system resources since each virtual machine is isolated from all other virtual machines. This isolation, however, permits no direct sharing of resources.
  • A virtual-machine system is a perfect vehicle for operating-systems research and development. System development is done on the virtual machine, instead of on a physical machine and so does not disrupt normal system operation.
  • The virtual machine concept is difficult to implement due to the effort required to provide an exact duplicate to the underlying machine.


EXAMPLES


  • Compiled Java programs are platform-neutral bytecodes executed by a Java Virtual Machine (JVM).
  • JVM consists of
    - class loader
    - class verifier
    - runtime interpreter
  • Just-In-Time (JIT) compilers increase performance



Posted by Roger Labels:
Thursday, July 2, 2009 at 3:45 AM | 0 comments  
Layered Approach
  • The operating system is divided into a number of layers (levels), each built on top of lower layers. The bottom layer (layer 0), is the hardware; the highest (layer N) is the user interface.
  • With modularity, layers are selected such that each uses functions (operations) and services of only lower-level layers.

Posted by Roger Labels:
  • System calls provide the interface between a running program and the operating system.
    * Generally available as assembly-language instructions.
    * Languages defined to replace assembly language for systems programming allow system calls to be made directly (e.g., C, C++)
  • Three general methods are used to pass parameters between a running program and the operating system.
    * Pass parameters in registers.
    * Store the parameters in a table in memory, and the table address is passed as a parameter in a register.
    * Push (store) the parameters onto the stack by the program, and pop off the stack by operating system.


The main types of system calls are

  • Process Control: These types of system calls are used to control the processes. Ex: End, abort, load, execute, create process, terminate process etc.
  • File Management: These types of system calls are used to manage files. Ex: Create file, delete file, open, close, read, write etc.
  • Device Management: These types of system calls are used to manage devices. Ex: Request device, release device, read, write, get device attributes
Posted by Roger Labels:
  • Program execution – system capability to load a program into memory and to run it.
  • I/O operations – since user programs cannot execute I/O operations directly, the operating system must provide some means to perform I/O.
  • File-system manipulation – program capability to read, write, create, and delete files.
  • Communications – exchange of information between processes executing either on the same computer or on different systems tied together by a network. Implemented via shared memory or message passing.
  • Error detection – ensure correct computing by detecting errors in the CPU and memory hardware, in I/O devices, or in user programs.
  • Additional functions exist not for helping the user, but rather for ensuring efficient system operations.
  • Resource allocation – allocating resources to multiple users or multiple jobs running at the same time.
  • Accounting – keep track of and record which users use how much and what kinds of computer resources for account billing or for accumulating usage statistics.
  • Protection – ensuring that all access to system resources is controlled.
Posted by Roger Labels:

OPERATING SYSTEMS PROCESS MANAGEMENT

  • Program execution – system capability to load a program into memory and to run it.
  • I/O operations – since user programs cannot execute I/O operations directly, the operating system must provide some means to perform I/O.
  • File-system manipulation – program capability to read, write, create, and delete files.
  • Communications – exchange of information between processes executing either on the same computer or on different systems tied together by a network. Implemented via shared memory or message passing.
  • Error detection – ensure correct computing by detecting errors in the CPU and memory hardware, in I/O devices, or in user programs.

MAIN MEMORY MANAGEMENT

  • Memory is a large array of words or bytes, each with its own address. It is a repository of quickly accessible data shared by the CPU and I/O devices.
  • Main memory is a volatile storage device. It loses its contents in the case of system failure.
  • The operating system is responsible for the following activities in connections with memory management:
    * Keep track of which parts of memory are currently being used and by whom.
    * Decide which processes to load when memory space becomes available.
    * Allocate and deallocate memory space as needed.

FILE MANAGEMENT

  • A file is a collection of related information defined by its creator. Commonly, files represent programs (both source and object forms) and data.
  • The operating system is responsible for the following activities in connections with file management:
    * File creation and deletion.
    * Directory creation and deletion.
    * Support of primitives for manipulating files and directories.
    * Mapping files onto secondary storage.
    * File backup on stable (nonvolatile) storage media.


I/O SYSTEM MANAGEMENT

  • The I/O system consists of:
    * A buffer-caching system
    * A general device-driver interface
    * Drivers for specific hardware devices

SECONDARY STORAGE MANAGEMENT

  • Since main memory (primary storage) is volatile and too small to accommodate all data and programs permanently, the computer system must provide secondary storage to back up main memory.
  • Most modern computer systems use disks as the principle on-line storage medium, for both programs and data.
  • The operating system is responsible for the following activities in connection with disk management:
    * Free space management
    * Storage allocation
    * Disk scheduling

PROTECTION SYSTEM

  • Protection refers to a mechanism for controlling access by programs, processes, or users to both system and user resources.
  • The protection mechanism must:
    * distinguish between authorized and unauthorized usage.
    * specify the controls to be imposed.
    * provide a means of enforcement.

COMMAND INTERPRETER SYSTEM

  • Many commands are given to the operating system by control statements which deal with:
    * process creation and management
    * F/O handling
    * secondary-storage management
    * main-memory management
    * file-system access
    * protection
    * networking

  • The program that reads and interprets control statements is called variously:
    *command-line interpreter
    *shell (in UNIX)
  • Its function is to get and execute the next command statement.


Posted by Roger Labels:
Visit the Site
MARVEL and SPIDER-MAN: TM & 2007 Marvel Characters, Inc. Motion Picture © 2007 Columbia Pictures Industries, Inc. All Rights Reserved. 2007 Sony Pictures Digital Inc. All rights reserved. blogger templates