Long lock in the tibco iProcess

Describe the term Long lock in the tibco iProcess in brief.




The lock which is persistent and can only be eliminated by using sal_llock_frm_init() by the user holding the lock. Long locks are not generally employed by TIBCO iProcess Workspace, however might be set by SAL SDK programs or the TIBCO iProcess Objects Client. Re-starting the iProcess Engine consists of no effect on long locks; therefore a work item locked in this manner remains inaccessible to each and every iProcess user till it is manually unlocked.

   Related Questions in Programming Languages

  • Q : How class can be prevented from

    How class can be prevented from inheriting further?

  • Q : Define Container Abstractions Container

    Container Abstractions: Abstractions for containers (such as lists, stacks, sets, or queues) may represent just the state of a container—e.g., full or empty—and abstract away from the actual container content. The list operations also need

  • Q : Calculate the summation of 1 to some

    Write two programs to calculate the summation of 1 to some integer n using a function called

    int summation(int n)

    a) Using a non recursive solution, with a for(i=1, i<=n; i++) loop and b) using a recursive solution, based on the following conditions summation(n) = summation(n-1

  • Q : Explain the relationship between XHTML

    Explain the relationship between XHTML and SGML.

  • Q : What is First in-first out First in,

    First in, first out: It is FIFO semantics of the queue data structure. Items are eliminated in the order in which they arrived in the queue; therefore older items are always eliminated before newer ones.

  • Q : Program to controls a quiz show in C++

    Foundations of Computer Science

    In this project, we will write a program that controls a quiz show, much like the many popular TV shows. The program will read in a group of questions and thei

  • Q : Define the term core validation Define

    Define the term core validation?

  • Q : Explain Right shift operator Right

    Right shift operator: Right shift operator (>>) is the bit manipulation operator. It shifts the bits in its left operand zero (0) or many places to the right, according to the value of its accurate operand. The most important bit from before the

  • Q : Explain the term Test Fusion Report of

    Explain the term Test Fusion Report of QTP?

  • Q : Define Bounds Bounds : It is the limits

    Bounds: It is the limits of an array or collection. In Java, the lower limit is for all time zero (0). In case of an array, the upper bound is one less than the length of the array, and is fixed. Indexing exterior the bounds of an array or collection