Implementing Posix message queue using memory mapping I/O

UNIX Network Programming Volume 2: inter process communication. The fifth chapter Posix message queue sample code implements a message queue based on file memory mapping to create shared memory implementation. In order to avoid access conflicts of different threads, Posix mutual exclusion and Posix conditional variables are introduced. This article mainly records several key points in the implementation process to prepare for a rainy day.

How to circumvent the city SkyDrive free users can only download one file at the same time.

More than a few browsers can download different resources of SkyDrive. Meanwhile, it means that the browser's user data is independent, rather than opening several tabs. For example, you can use IE browser to download the first resource, then open the Edge browser to download second resources, then open the Chrome browser to download third resources, and finally use the Chrome browser's stealth mode to download fourth resources.

Posix message queue summary

This paper gives a brief summary of the fifth chapter Posix message queue of UNIX Network Programming Volume 2: interprocess communication, introduces the flow of message queue function, the method of message queuing interprocess communication, and their pros and cons.