PHP7 Kernel Analysis 2 I/O Model

The content of this article is about the I/O model of PHP7 Kernel Analysis 2. Now I share it with you. Friends in need can refer to it

1. Synchronization: My client (C side) The caller) is a function that does not end before I die waiting for the result.
2. Asynchronous: I (the c-side caller) calls a function and does not know the result of the function. After the function has the result, I will be notified, that is, callback notification
3. Blocking: It means calling me (the s-side is called (or, function), I (s-side callee, function) will not return until I have completely accepted the data or gotten the result.
4. Non-blocking: Just call me (callee on s side, function), I (callee on s side, function) will return immediately, and notify the caller after getting the result

Five I/O models

(1) Blocking I/O

When When the user process makes a system call, the kernel starts the first stage of I/O and prepares data into the buffer. When the data is prepared, the data is copied from the kernel buffer to the memory of the user process. At this time, the user process is released from the block state and runs again.

(2) Non-Blocking I/O

The user process can only The stage is blocked, and the first stage is not blocked. However, in the first stage, the user process does not need to wait blindly and constantly polls the kernel to see if the data is ready. Therefore, this model consumes more CPU. of.

(3) I/O Multiplexing

Both stages of I/O execution are Both user processes are blocked, but the two stages are independent. In a complete I/O operation, the user process initiates two system calls. Different from blocking I/O, the first segment can wait for multiple descriptors to be ready

(4) Signal Driven I/O

Only the user process is blocked in the second stage of I/O execution, but there is no blocking in the first stage. In the first stage of I/O execution, this model will actively notify the user process that the data has been prepared after the data preparation is completed, that is, make a callback to the user process. There are two types of notifications, one is horizontal triggering, that is, notifications will be sent all the time if the user process does not respond, and the other is edge triggering, which is only notified once.

(5) Asynchronous I/O (Asynchrnous I/O)

When the user process initiates a system call, it immediately You can start to do other things, and then until both stages of I/O execution are completed, the kernel will send a notification to the user process to tell the user process that the operation has been completed.

I/O multiplexing technology

select

(1) The mechanism of .select() provides a data structure of fd_set, Each element can establish a connection with an open file handle (whether it is a Socket handle, other file or named pipe or device handle). The work of establishing the connection is completed by the programmer. When select() is called, the kernel determines the connection according to the IO The status modifies the content of fd_set, thereby notifying the process that executed select() which Socket or file is readable or writable. Mainly used for Socket communication.

(2). After the program executes select, if there is no data input, the program will wait (when blocked) until there is data, that is, there is no need for loops and sleep in the program.

(3). Every time select is called, the fd_set collection needs to be copied from user mode to kernel mode. This overhead will be very large when there are many fd_sets.

(4). At the same time, every time Calling select requires the kernel to traverse all fd_sets passed in. This overhead is also very large when there are many fd_sets.

(5). The number of file descriptors supported by select is too small. The default is 1024

poll

(1). The implementation of poll is very similar to select, except that the way to describe the fd_set collection is different. Poll uses the pollfd linked list structure instead of the fd_set structure of select. Everything else is similar.

(2). There is no upper limit on the number of monitoring descriptors;

epoll/kqueue

(1). There is no upper limit on the number of monitoring descriptors;
(2 ). The efficiency is improved, it is not a polling method, and the efficiency will not decrease as the number of fd increases. Only active and available fds will call the callback function; that is, the biggest advantage of epoll/kqueue is that it only cares about your "active" connections and has nothing to do with the total number of connections. Therefore, in the actual network environment, the efficiency of epoll/kqueue will be Much higher than select and poll.
(3). Memory copy, use mmap() file mapping memory to accelerate message passing with kernel space;

Related recommendations:

PHP7 Kernel Analysis 1 CGI and FastCGI

The above is the detailed content of PHP7 Kernel Analysis 2 I/O Model. For more information, please follow other related articles on the PHP Chinese website!