WARNING:
JavaScript is turned OFF. None of the links on this concept map will
work until it is reactivated.
If you need help turning JavaScript On, click here.
This Concept Map, created with IHMC CmapTools, has information related to: Concurrency, Three point test are Point 1: Does the solution ensure that two processes will not enter their critical region?, The Kernel indicate Process Scheduling, Round Robin Scheduling prevents Priority Inversion, Mutual Exclusion by disabling interrupts, Components related to processes and threads are Address space contents Registers Program counter Stack pointer State of system calls All related threads of execution All files from the process and their state, Monolithic kernels (UNIX, OS/360TM, VMSTM) are No protection boundaries within the kernel Difficult to debug, validate, and modify Debugging support virtually nonexistent Not suitable for distributed environments, Monitors eg "synchronized", Threads may be Light Weight, -which is a complier supported programming language constuct that allows a group of procedures, their variables, and the data structure to be grouped together in a package or module; it is an abstract data type. passes Three point test, The Kernel indicate Process Management, Kernel may be Cooperative Multitasking, Asynchronous I/O using "select", Semaphores passes Three point test, Critical Region is -the portion of code or program accssing a shared resource. Only such a needs to prohibit concurrency (concurrency control), Concurrency achieved by Operations, Mutual Exclusion via Semaphores, Task priority is Dynamic, Multiprocessor through Message Passing, Native Threads better on Multi-Core Processors, Scheduling Algorithm schedules Data Flow