Ideal synchronizer for marked pairs in fork-join network

Details Ideal synchronizer for marked pairs in fork-join network Ideal synchronizer for marked pairs in fork-join network

2008-01-11

arxiv.org/abs/0801.1784v2

Computer Science

Discrete Mathematics

18 pages, 3 figures, in Russian, typos fixed

Scientific paper

We introduce a new functional element (synchronizer for marked pairs) meant to join results of parallel processing in two-branch fork-join queueing network. Approximations for distribution of sojourn time at the synchronizer are derived along with a validity domain. Calculations are performed assuming that: arrivals to the network form a Poisson process, each branch operates like an M/M/N queueing system. It is shown that mean sojourn time at a real synchronizer node is bounded below by the value, defined by parameters of the network (which contains the synchronizer) and does not depend upon performance and particular properties of the synchronizer.

Affiliated with

Also associated with

No associations

Rating

Ideal synchronizer for marked pairs in fork-join network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ideal synchronizer for marked pairs in fork-join network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ideal synchronizer for marked pairs in fork-join network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548007