One of the most basic functions of inter-process communication is the use of the queue. This first queuing article will introduce the simplest of the IBM i queuing mechanisms, the data queue.
Written by Joe Pluta
In programming, queuing is a technique used to transfer data asynchronously between two software components. It differs from a parameter in that the sender can place a message on a queue, go on processing, and then optionally check later to see if the message was processed.
It's time for a review of the basic concepts of MI locks. These examples will help.
Written by Junlei Li
In computer science, a lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. In IBM i, locks are implemented in such a complex and sophisticated manner that they cannot be compared directly with their counterparts in common platforms, such as semaphores, critical sections, read/write locks, and mutexes.