Abstract: Generally, piping applications defined by combining stages of programming with a sequence control program and specifying to the sequence control program piping commands. The stages may be functions to send data to a shared queue. The piping commands identify current stages, and parameters for the current stages identify the queue and a key for the data to be sent to the queue. The piping commands do not identify preceding and/or subsequent piping applications.

Abstract: A system for scheduling tasks for execution includes a queue of tasks ordered by scheduled time for execution. A timer thread monitors status of tasks in the queue and selectively dispatches tasks. A guard thread monitors status of tasks in the queue and selectively creates timer threads. The guard thread is responsive to a next task in the queue becoming ready for execution while a first timer thread is still processing a prior task to create a new timer thread to dispatch the next task and mark the first timer thread for closure. Thereafter, the first timer thread closes responsive to the prior task completing.

Abstract: A first piping application is defined by combining first and second stages of programming with a first sequence control program and specifying to the first sequence control program a first piping command. The second stage is a function to send data to a shared queue. The first piping command identifies the first stage, the second stage and parameters for the second stage identifying the queue and a key for the data to be sent to the queue. A second piping application is defined by combining third and fourth stages of programming with a second sequence control program, and specifying to the second sequence control program a second piping command. The third stage is a function to read the data from the queue. The second piping command identifies the fourth stage, the third stage, and parameters for the third stage identifying the queue and the key for the data to be read from the queue.

Abstract: A technique to collectively manage locks by multiple virtual machines and then access shared data protected by the locks. A computer system defines first and second virtual machines and a memory shared by the first and second virtual machines. A lock structure is defined in the shared memory. The lock structure is capable of listing a holder of a lock for shared data in the shared memory. The first virtual machine acquires a lock for the shared data when available by manipulation of the lock structure. After acquiring the lock, the first virtual machine accesses the shared data. The lock structure and the shared data are directly accessible by the first virtual machine. The second virtual machine acquires a lock for the shared data when available by manipulation of the lock structure. After acquiring the lock, the second virtual machine accesses the shared data. The lock structure and shared data are directly accessible by the second virtual machine.

Abstract: A system, computer program product and method for dispatching work items in a virtual machine operating system. The virtual machine operating system defines first and second virtual machines. First and second work queues are created in a memory. The first virtual machine assigns a first work item to the first work queue and a second work item to the second work queue. The first virtual machine schedules work items from the first work queue for execution by the first virtual machine. The first and second work items originate from the first virtual machine. The first and second work queues are directly accessible by the first virtual machine. The second virtual machine assigns a third work item to the first work queue and a fourth work item to the second work queue. The second virtual machine schedules work items from the second work queue for execution by the second virtual machine. The third and fourth work items originate from the second virtual machine.

Abstract: A technique to collectively manage locks by multiple virtual machines and then access shared data protected by the locks. A computer system defines first and second virtual machines and a memory shared by the first and second virtual machines. A lock structure is defined in the shared memory. The lock structure is capable of listing a holder of a lock for shared data in the shared memory. The first virtual machine acquires a lock for the shared data when available by manipulation of the lock structure. After acquiring the lock, the first virtual machine accesses the shared data. The lock structure and the shared data are directly accessible by the first virtual machine. The second virtual machine acquires a lock for the shared data when available by manipulation of the lock structure. After acquiring the lock, the second virtual machine accesses the shared data. The lock structure and shared data are directly accessible by the second virtual machine.

Abstract: A system, computer program product and method for dispatching work items in a virtual machine operating system. The virtual machine operating system defines first and second virtual machines. First and second work queues are created in a memory. The first virtual machine assigns a first work item to the first work queue and a second work item to the second work queue. The first virtual machine schedules work items from the first work queue for execution by the first virtual machine. The first and second work items originate from the first virtual machine. The first and second work queues are directly accessible by the first virtual machine. The second virtual machine assigns a third work item to the first work queue and a fourth work item to the second work queue. The second virtual machine schedules work items from the second work queue for execution by the second virtual machine. The third and fourth work items originate from the second virtual machine.