Meiosis is a type of cell division that reduces the number of chromosomes in the parent cell by half and produces four gamete cells. This process is required to produce egg and sperm cells for sexual reproduction. During reproduction, when the sperm and egg unite to form a single cell, the number of chromosomes is restored in the offspring. Meiosis begins with a parent cell that is diploid, meaning it has two copies of each chromosome. The parent cell undergoes one round of DNA replication followed by two separate cycles of nuclear division. The process results in four daughter cells that are haploid, which means they contain half the number of chromosomes of the diploid parent cell. Meiosis has both similarities to and differences from mitosis, which is a cell division process in which a parent cell produces two identical daughter cells. Meiosis begins following one round of DNA replication in cells in the male or female sex organs. The process is split into meiosis I and meiosis II, and both meiotic divisions have multiple phases. Meiosis I is a type of cell division unique to germ cells, while meiosis II is similar to mitosis. Meiosis I, the first meiotic division, begins with prophase I. During prophase I, the complex of DNA and protein known as chromatin condenses to form chromosomes. The pairs of replicated chromosomes are known as sister chromatids, and they remain joined at a central point called the centromere. A large structure called the meiotic spindle also forms from long proteins called microtubules on each side, or pole, of the cell. Between prophase I and metaphase I, the pairs of homologous chromosome form tetrads. Within the tetrad, any pair of chromatid arms can overlap and fuse in a process called crossing-over or recombination. Recombination is a process that breaks, recombines and rejoins sections of DNA to produce new combinations of genes. In metaphase I, the homologous pairs of chromosomes align on either side of the equatorial plate. Then, in anaphase I, the spindle fibers contract and pull the homologous pairs, each with two chromatids, away from each other and toward each pole of the cell. During telophase I, the chromosomes are enclosed in nuclei. The cell now undergoes a process called cytokinesis that divides the cytoplasm of the original cell into two daughter cells. Each daughter cell is haploid and has only one set of chromosomes, or half the total number of chromosomes of the original cell. Meiosis II is a mitotic division of each of the haploid cells produced in meiosis I. During prophase II, the chromosomes condense, and a new set of spindle fibers forms. The chromosomes begin moving toward the equator of the cell. During metaphase II, the centromeres of the paired chromatids align along the equatorial plate in both cells. Then in anaphase II, the chromosomes separate at the centromeres. The spindle fibers pull the separated chromosomes toward each pole of the cell. Finally, during telophase II, the chromosomes are enclosed in nuclear membranes. Cytokinesis follows, dividing the cytoplasm of the two cells. At the conclusion of meiosis, there are four haploid daughter cells that go on to develop into either sperm or egg cells.In computing, a process is the instance of a computer program that is being executed by one or many threads. There are many different process models, some of which are light weight, but almost all processes (even entire virtual machines) are rooted in an operating system (OS) process which comprises the program code, assigned system resources, physical and logical access permissions, and data structures to initiate, control and coordinate execution activity. Depending on the OS, a process may be made up of multiple threads of execution that execute instructions concurrently.[1][2] While a computer program is a passive collection of instructions typically stored in a file on disk, a process is the execution of those instructions after being loaded from the disk into memory. Several processes may be associated with the same program; for example, opening up several instances of the same program often results in more than one process being executed. Multitasking is a method to allow multiple processes to share processors (CPUs) and other system resources. Each CPU (core) executes a single task at a time. However, multitasking allows each processor to switch between tasks that are being executed without having to wait for each task to finish (preemption). Depending on the operating system implementation, switches could be performed when tasks initiate and wait for completion of input/output operations, when a task voluntarily yields the CPU, on hardware interrupts, and when the operating system scheduler decides that a process has expired its fair share of CPU time (e.g, by the Completely Fair Scheduler of the Linux kernel). A common form of multitasking is provided by CPU's time-sharing that is a method for interleaving the execution of users' processes and threads, and even of independent kernel tasks – although the latter feature is feasible only in preemptive kernels such as Linux. Preemption has an important side effect for interactive processes that are given higher priority with respect to CPU bound processes, therefore users are immediately assigned computing resources at the simple pressing of a key or when moving a mouse. Furthermore, applications like video and music reproduction are given some kind of real-time priority, preempting any other lower priority process. In time-sharing systems, context switches are performed rapidly, which makes it seem like multiple processes are being executed simultaneously on the same processor. This simultaneous execution of multiple processes is called concurrency. For security and reliability, most modern operating systems prevent direct communication between independent processes, providing strictly mediated and controlled inter-process communication functionality. A list of processes as displayed by htop A process table as displayed by KDE System Guard In general, a computer system process consists of (or is said to own) the following resources:
The operating system holds most of this information about active processes in data structures called process control blocks. Any subset of the resources, typically at least the processor state, may be associated with each of the process' threads in operating systems that support threads or child processes. The operating system keeps its processes separate and allocates the resources they need, so that they are less likely to interfere with each other and cause system failures (e.g., deadlock or thrashing). The operating system may also provide mechanisms for inter-process communication to enable processes to interact in safe and predictable ways. A multitasking operating system may just switch between processes to give the appearance of many processes executing simultaneously (that is, in parallel), though in fact only one process can be executing at any one time on a single CPU (unless the CPU has multiple cores, then multithreading or other similar technologies can be used).[a] It is usual to associate a single process with a main program, and child processes with any spin-off, parallel processes, which behave like asynchronous subroutines. A process is said to own resources, of which an image of its program (in memory) is one such resource. However, in multiprocessing systems many processes may run off of, or share, the same reentrant program at the same location in memory, but each process is said to own its own image of the program. Processes are often called "tasks" in embedded operating systems. The sense of "process" (or task) is "something that takes up time", as opposed to "memory", which is "something that takes up space".[b] The above description applies to both processes managed by an operating system, and processes as defined by process calculi. If a process requests something for which it must wait, it will be blocked. When the process is in the blocked state, it is eligible for swapping to disk, but this is transparent in a virtual memory system, where regions of a process's memory may be really on disk and not in main memory at any time. Note that even portions of active processes/tasks (executing programs) are eligible for swapping to disk, if the portions have not been used recently. Not all parts of an executing program and its data have to be in physical memory for the associated process to be active. Process statesThe various process states, displayed in a state diagram, with arrows indicating possible transitions between states. An operating system kernel that allows multitasking needs processes to have certain states. Names for these states are not standardised, but they have similar functionality.[1]
When processes need to communicate with each other they must share parts of their address spaces or use other forms of inter-process communication (IPC). For instance in a shell pipeline, the output of the first process need to pass to the second one, and so on; another example is a task that can be decomposed into cooperating but partially independent processes which can run at once (i.e., using concurrency, or true parallelism – the latter model is a particular case of concurrent execution and is feasible whenever enough CPU cores are available for all the processes that are ready to run). It is even possible for two or more processes to be running on different machines that may run different operating system (OS), therefore some mechanisms for communication and synchronization (called communications protocols for distributed computing) are needed (e.g., the Message Passing Interface, often simply called MPI). By the early 1960s, computer control software had evolved from monitor control software, for example IBSYS, to executive control software. Over time, computers got faster while computer time was still neither cheap nor fully utilized; such an environment made multiprogramming possible and necessary. Multiprogramming means that several programs run concurrently. At first, more than one program ran on a single processor, as a result of underlying uniprocessor computer architecture, and they shared scarce and limited hardware resources; consequently, the concurrency was of a serial nature. On later systems with multiple processors, multiple programs may run concurrently in parallel. Programs consist of sequences of instructions for processors. A single processor can run only one instruction at a time: it is impossible to run more programs at the same time. A program might need some resource, such as an input device, which has a large delay, or a program might start some slow operation, such as sending output to a printer. This would lead to processor being "idle" (unused). To keep the processor busy at all times, the execution of such a program is halted and the operating system switches the processor to run another program. To the user, it will appear that the programs run at the same time (hence the term "parallel"). Shortly thereafter, the notion of a "program" was expanded to the notion of an "executing program and its context". The concept of a process was born, which also became necessary with the invention of re-entrant code. Threads came somewhat later. However, with the advent of concepts such as time-sharing, computer networks, and multiple-CPU shared memory computers, the old "multiprogramming" gave way to true multitasking, multiprocessing and, later, multithreading.
Wikiversity has learning resources about Processes and Threads at Operating Systems/Process and Thread
|
What do you call a process that has a number of distinct possible?
Pos Terkait
Copyright © 2024 ketiadaan Inc.
