es at least one message.
- An optimization that cuts the number of two-phase commit flows to one agent in half by leaving the last agent out of the first phase of the commit process and giving the last agent the commit decision during the second phase. An initiator or last agent can use this optimization with only one of its subordinates, which is called the optimized last agent (or simply the last agent).
last agent pending (LAP)
The last agent pending logical unit of work (LUW) state indicates that the current LUW is in doubt. This system has prepared to commit, but has not received the final vote from the last agent. The LAP state only occurs at the initiator and at a last agent.
The element visited last in an iteration over a collection. Each collection has its own definition for last element. For example, the last element of a sorted set is the element with the largest value.
A request unit (RU) whose request header (RH) end chain indicator is on and whose RH begin chain indicator is off. See also RU chain.
last-in first-out costing
A method of cost accounting that can be used to make an inventory valuation, based on actual receipt costs. Last-in first-out costing uses the "last in" (newest) item cost for inventory transactions. See also first-in first-out costing.
last record indicator
In RPG, an indicator that signals when the last record (LR) is processed. This indicator can then be used to condition calculation and output operations that are to be done at the end of the program.
See lexical answer type.
- An electronic circuit that permanently records (until reset) the status of a signal.
- An internal mechanism for controlling concurrent events or the use of system resources.
- A programming device that provides short-term serialization for IMS tasks running in the online IMS system. Similar in function to an z/OS lock.
late arriving fact processing
The process of dealing with transaction records that arrive in the data warehouse out of sequence. These transactions are linked back to their dimension records that were current at the time of the transaction.
To connect one process to another process so that the connection is resolved dynamically in the runtime environment and the calling process uses the currently valid version of the process that it is invoking.
The connection between two processes that is resolved dynamically in the runtime environment. As a result, the calling process uses up the currently valid version of the process that it is invoking.
- The time from the initiation of an operation until something actually starts happening (for example, data transmission begins).
- The time interval between the initiation of a send operation by a source task and the completion of the matching receive operation by the target task. More generally, latency is the time between a task initiating data transfer and the time that transfer is recognized as complete at the data destination.
- The time delay between the moment an operation is initiated, and the moment it begins to take effect.
- The time interval between the instant at which an instruction control unit initiates a call for data and the instant at which the actual transfer of the data starts.
- The amount of time between the time when a network device originally receives a packet and the time when the packet is retransmitted.
- In replication, part or all of the approximate difference between the time that a source table is changed and the time that the change is applied to the corresponding target table. See also Apply latency, Capture latency, end-to-end latency, Q Apply latency, Q Capture latency.
latest out time
See latest start time.
latest start time
The time before which the job or job stream must start. The job or job stream can start before the latest start time provided that all other dependencies are satisfied. See also actual start time, earliest start time, planned start time, scheduled time.
See Latin alphabet no. 1.
See Latin alphabet no. 1.
The IBM Core Interchange fonts complement that includes characters for Belgian French, Belgian Du