Answer Posted / prakash balakrishnan
It is the condition, where the graph will stop processing
due to mutual dependency of data.
For Ex:
Let’s consider a concatenate component, having three
inputs. Let’s say first i/p receives 20 million records,
second i/p receives 1000 records, third i/p receives 500
records.
Now even though the concatenate receives i/p’s at second
and third i/p port, the concatenate won’t work until it
receives all the i/p’s at it’s first i/p port. So the
graph’ll stop processing until the first i/p port receives
all its data. This condition is called DEADLOCK.
This is now minimised (not prevented) by “Automated flow
buffering”. This will in turn provide more workspace in
network resource allocation. So that the processing’ll be
faster.
The Automated flow buffering is available from 1.8 version.
| Is This Answer Correct ? | 17 Yes | 1 No |
Post New Answer View All Answers
What do you know about partition and also tell us about partition components in abinitio?
How you can run a graph infinitely in ab initio?
What dedup-component and replicate component does?
Can you explain data flow graph with an example?
Explain about ab initio’s dependency analysis?
How can you import XML repositories exported from different tools like ODI
what is the use of catlog or catlogfile?
Difference between output_index and output_indexes in reformat
What are the factors on which storage of data depends?
What is the ab initio business rules environment (bre)?
How many components in your most complicated graph?
Describe how you would ensure that database object definitions (tables, indices, constraints, triggers, users, logins, connection options, and server options etc)are consistent and repeatable between multiple database instances (i.e.: A test and production copy of a database)?
What are the different types of parallelism used in abinitio?
How does the bre work with the co>operating system?
Explain how abinitio eme is segregated?
