Model for synchronizer of marked pairs in fork-join network

نویسندگان

  • S. V. Vyshenski
  • P. V. Grigoriev
  • Yu. Yu. Dubenskaya
چکیده

We introduce a model for synchronizer of marked pairs, which is a node for joining results of parallel processing in two-branch fork-join queueing network. A distribution for number of jobs in the synchro-nizer is obtained. 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 a mean quantity of jobs in the synchronizer 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 synchro-nizer. A domain of network parameters is found, where the flow of jobs departing from the synchronizer does not manifest a statistically significant difference from the Poisson type, despite the correlation between job flows from both branches of the fork-join network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ideal synchronizer for marked pairs in fork-join network

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 queue...

متن کامل

Response Time Approximations in Fork-Join Queues

Fork-join queueing networks model a network of parallel servers in which an arriving job splits into a number of subtasks that are serviced in parallel. Fork-join queues can be used to model disk arrays. A response time approximation of the fork-join queue is presented that attempts to comply with the additional constraints of modelling a disk array. This approximation is compared with existing...

متن کامل

Towards Holistic Analysis for Fork-Join Parallel/Distributed Real-Time Tasks

Parallel/distributed processing is a solution for providing scaling computing power for computational-intensive applications. Parallel/distributed applications are commonly based on the fork-join model, where precedence constraints have to be considered on the development of an adequate timing analysis. Moreover, as the main difference with multicore architectures, distributed systems entail th...

متن کامل

An Analytical Approximation for the Throughput of a Closed Fork/Join Network with Multi-Station Input Subnetworks

Fork/join stations are used for modeling synchronization between entities, and fork/join queueing networks are natural models for a variety of communication and manufacturing systems: Parallel computer networks, fabrication/assembly systems, supply chains and material control strategies for manufacturing systems. Exact solutions of general fork/join networks can only be obtained by using numeri...

متن کامل

SystemCSP: A graphical language for designing concurrent component-based embedded control systems

ion representing a guarded alternative contains data members for guarded event ends and for associated logical conditions. The guarded alternative control flow element participates in the synchronization mechanism on the behalf of the event-ends it is guarding. The renaming operator specifies renaming rules as a set of strings containing pairs of old and new names. The hiding operator maintains...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0801.2092  شماره 

صفحات  -

تاریخ انتشار 2008