PyPI - most-queue - Versions diffs - 1.32__tar.gz → 1.34__tar.gz - Mend

most-queue 1.32tar.gz → 1.34tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.

This version of most-queue might be problematic. Click here for more details.

Files changed (84) hide show

{most_queue-1.32 → most_queue-1.34}/LICENSE RENAMED Viewed

File without changes

{most_queue-1.32 → most_queue-1.34}/PKG-INFO RENAMED Viewed

@@ -1,104 +1,104 @@
-Metadata-Version: 2.1
-Name: most_queue
-Version: 1.32
-Summary: Software package for calculation and simulation of queuing systems
-Home-page: https://github.com/xabarov/mps
-Author: Xabarov Roman
-Author-email: Xabarov Roman <xabarov1985@gmail.com>
-License: Copyright (c) 2018 The Python Packaging Authority
-        Permission is hereby granted, free of charge, to any person obtaining a copy
-        of this software and associated documentation files (the "Software"), to deal
-        in the Software without restriction, including without limitation the rights
-        to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-        copies of the Software, and to permit persons to whom the Software is
-        furnished to do so, subject to the following conditions:
-        The above copyright notice and this permission notice shall be included in all
-        copies or substantial portions of the Software.
-        THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-        IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-        FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-        AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-        LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-        OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-        SOFTWARE.
-Project-URL: Homepage, https://github.com/xabarov/mps
-Classifier: Programming Language :: Python :: 3
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Operating System :: OS Independent
-Requires-Python: >=3.7
-Description-Content-Type: text/markdown
-License-File: LICENSE
-# most_queue
-Python package for calculation and simulation of queuing systems (QS) and networks
-## Authors
-- [xabarov](https://github.com/xabarov)
-## Installation
-Install most-queue with pip
-```bash
-  pip install most-queue
-```
-## DESCRIPTION
-Most_queue consists of two main parts:
- - **.theory** contains programs that implement methods for calculating queuing theory models.
- - **.sim** contains simulation programs.
-### Package .theory
-| #   | Package name                      | Description                                                                                                                                                                                                                                                |
-|-----|-----------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
-| 1.  | diff5dots                         | Numerical calculation of the derivative of a function                                                                                                                                                                                                      |
-| 2.  | fj_calc                           | Numerical calculation of the initial moments of the random variables maximum distribution                                                                                                                                                                  |
-| 3.  | m_ph_n_prty                       | Numerical calculation of QS M/Ph/n with 2 classes and PR - priority. Based on the approximation of busy periods                                                                                                                                         |
-| 4.  | mg1_calc                          | Numerical calculation of QS M/G/1                                                                                                                                                                                                                       |
-| 5.  | gi_m_1_calc                       | Numerical calculation of QS GI/M/1                                                                                                                                                                                                                      |
-| 6.  | gi_m_n_calc                       | Numerical calculation of QS GI/M/n                                                                                                                                                                                                                      |
-| 7.  | m_d_n_calc                        | Numerical calculation of QS M/D/n                                                                                                                                                                                                                       |
-| 8.  | ek_d_n_calc                       | Numerical calculation of QS Ek/D/n                                                                                                                                                                                                                      |
-| 9.  | mg1_warm_calc                     | Numerical calculation of QS M/G/1 with "warm-up"                                                                                                                                                                                                        |
-| 10. | mgn_tt                            | Numerical calculation of QS M/H2/n by the Takahashi-Takami method with complex parameters when approximating the serving time by the H2 distribution                                                                                                    |
-| 11. | mmn3_pnz_cox_approx               | Calculation of QS M/M/2 with 3 classes, PR - priority by the Takahashi-Takami numerical method based on the approximation of busy period by the Cox distribution                                                                                        |
-| 12. | mmn_prty_pnz_approx               | Calculation of QS M/M/2 with 2 classes, PR - priority by the Takahashi-Takami numerical method based on the approximation of the busy period by the Cox distribution                                                                                    |
-| 13. | mmnr_calc                         | Calculation of QS M/M/n/r                                                                                                                                                                                                                               |
-| 14. | network_calc                      | Calculation of queuing network with priorities in nodes                                                                                                                                                                                                    |
-| 15. | passage_time                      | Calculation of the initial transition times between arbitrary tiers of the Markov chain                                                                                                                                                                    |
-| 16. | priority_calc                     | A set of functions for calculating QS with priorities (single-channel, multi-channel). The multichannel calculation is carried out by the method of relation invariants                                                                                 |
-| 17. | student_stat                      | Calculation of confidence probability, confidence intervals for random variable with unknown RMS based on Student's t-distribution.                                                                                                                        |
-| 18. | convolution_sum_calc              | Calculate the initial moments of sums of random variables                                                                                                                                                                                                  |
-| 19. | weibull                           | Selection of Weibull distribution parameters, calculation of CDF, PDF, Tail values                                                                                                                                                                         |
-| 20. | flow_sum                          | Flow summation, numerical calculation                                                                                                                                                                                                                      |
-| 21. | impatience_calc                   | Calculation of M/M/1 with exponential impatience                                                                                                                                                                                                           |
-| 22. | batch_mm1                         | Calculation of QS M/M/1 with batch arrival                                                                                                                                                                                                              |
-| 23. | engset_model.py                   | Calculation of QS M/M/1 with finite sources                                                                                                                                                                                                             |
-| 24. | generate_pareto_noise.py.py       | Create noise by Pareto dist                                                                                                                                                                                                                                |
-| 25. | network_viewer.py                 | Utility to view network structure                                                                                                                                                                                                                          |
-| 26. | mmn_with_h2_cold_h2_warmup.py     | Multichannel queuing system with exp serving time, H2 warm-up and H2 cold (vacations). The system uses complex parameters, which allows to calculate systems with arbitrary warm-up and cold variation coefficients                                        |
-| 27. | mgn_with_h2_delay_cold_warm.py    | Multichannel queuing system with H2 serving time, H2 warm-up, H2 cold delay and H2 cold (vacations). The system uses complex parameters, which allows you to calculate systems with arbitrary serving, warm-up, cold-delay and cold variation coefficients |
-### Package .sim
-| #  | Package name               | Description |
-| ------------- |----------------------------|------------- |
-| 1.  | fj_delta_sim               | Simulation of QS fork-join with a delay in the start of processing between channels |
-| 2.  | fj_sim                     | Simulation of QS with fork-join process |
-| 3.  | priority_network           | Simulation of queuing network with priorities in nodes |
-| 4.  | rand_distribution          | A set of functions and classes designed to generate a PRNG and select parameters for distributions H2, C2, Ek, Pa, Gamma |
-| 5.  | qs_sim                     | Simulation of QS GI/G/m/n  |
-| 6.  | priority_queue_sim         | Simulation of QS GI/G/m/n  with priorities  |
-| 7.  | flow_sum_sim               | Simulation of flow summation |
-| 8.  | impatient_sim.py           | Simulation of QS GI/G/m/n with impatience |
-| 9.  | batch_sim.py               | Simulation of QS GI/G/m/n with batch arrival |
-| 10.  | queue_finite_source_sim.py | Simulation of QS GI/G/m/n with finite sources |
-## Usage
-Look [here](https://github.com/xabarov/most-queue/tree/main/most_queue/tests) for examples
+Metadata-Version: 2.1
+Name: most_queue
+Version: 1.34
+Summary: Software package for calculation and simulation of queuing systems
+Home-page: https://github.com/xabarov/mps
+Author: Xabarov Roman
+Author-email: Xabarov Roman <xabarov1985@gmail.com>
+License: Copyright (c) 2018 The Python Packaging Authority
+        Permission is hereby granted, free of charge, to any person obtaining a copy
+        of this software and associated documentation files (the "Software"), to deal
+        in the Software without restriction, including without limitation the rights
+        to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+        copies of the Software, and to permit persons to whom the Software is
+        furnished to do so, subject to the following conditions:
+        The above copyright notice and this permission notice shall be included in all
+        copies or substantial portions of the Software.
+        THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+        IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+        FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+        AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+        LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+        OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+        SOFTWARE.
+Project-URL: Homepage, https://github.com/xabarov/mps
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+# most_queue
+Python package for calculation and simulation of queuing systems (QS) and networks
+## Authors
+- [xabarov](https://github.com/xabarov)
+## Installation
+Install most-queue with pip
+```bash
+  pip install most-queue
+```
+## DESCRIPTION
+Most_queue consists of two main parts:
+ - **.theory** contains programs that implement methods for calculating queuing theory models.
+ - **.sim** contains simulation programs.
+### Package .theory
+| #   | Package name                      | Description                                                                                                                                                                                                                                                |
+|-----|-----------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| 1.  | diff5dots                         | Numerical calculation of the derivative of a function                                                                                                                                                                                                      |
+| 2.  | fj_calc                           | Numerical calculation of the initial moments of the random variables maximum distribution                                                                                                                                                                  |
+| 3.  | m_ph_n_prty                       | Numerical calculation of QS M/Ph/n with 2 classes and PR - priority. Based on the approximation of busy periods                                                                                                                                         |
+| 4.  | mg1_calc                          | Numerical calculation of QS M/G/1                                                                                                                                                                                                                       |
+| 5.  | gi_m_1_calc                       | Numerical calculation of QS GI/M/1                                                                                                                                                                                                                      |
+| 6.  | gi_m_n_calc                       | Numerical calculation of QS GI/M/n                                                                                                                                                                                                                      |
+| 7.  | m_d_n_calc                        | Numerical calculation of QS M/D/n                                                                                                                                                                                                                       |
+| 8.  | ek_d_n_calc                       | Numerical calculation of QS Ek/D/n                                                                                                                                                                                                                      |
+| 9.  | mg1_warm_calc                     | Numerical calculation of QS M/G/1 with "warm-up"                                                                                                                                                                                                        |
+| 10. | mgn_tt                            | Numerical calculation of QS M/H2/n by the Takahashi-Takami method with complex parameters when approximating the serving time by the H2 distribution                                                                                                    |
+| 11. | mmn3_pnz_cox_approx               | Calculation of QS M/M/2 with 3 classes, PR - priority by the Takahashi-Takami numerical method based on the approximation of busy period by the Cox distribution                                                                                        |
+| 12. | mmn_prty_pnz_approx               | Calculation of QS M/M/2 with 2 classes, PR - priority by the Takahashi-Takami numerical method based on the approximation of the busy period by the Cox distribution                                                                                    |
+| 13. | mmnr_calc                         | Calculation of QS M/M/n/r                                                                                                                                                                                                                               |
+| 14. | network_calc                      | Calculation of queuing network with priorities in nodes                                                                                                                                                                                                    |
+| 15. | passage_time                      | Calculation of the initial transition times between arbitrary tiers of the Markov chain                                                                                                                                                                    |
+| 16. | priority_calc                     | A set of functions for calculating QS with priorities (single-channel, multi-channel). The multichannel calculation is carried out by the method of relation invariants                                                                                 |
+| 17. | student_stat                      | Calculation of confidence probability, confidence intervals for random variable with unknown RMS based on Student's t-distribution.                                                                                                                        |
+| 18. | convolution_sum_calc              | Calculate the initial moments of sums of random variables                                                                                                                                                                                                  |
+| 19. | weibull                           | Selection of Weibull distribution parameters, calculation of CDF, PDF, Tail values                                                                                                                                                                         |
+| 20. | flow_sum                          | Flow summation, numerical calculation                                                                                                                                                                                                                      |
+| 21. | impatience_calc                   | Calculation of M/M/1 with exponential impatience                                                                                                                                                                                                           |
+| 22. | batch_mm1                         | Calculation of QS M/M/1 with batch arrival                                                                                                                                                                                                              |
+| 23. | engset_model.py                   | Calculation of QS M/M/1 with finite sources                                                                                                                                                                                                             |
+| 24. | generate_pareto_noise.py.py       | Create noise by Pareto dist                                                                                                                                                                                                                                |
+| 25. | network_viewer.py                 | Utility to view network structure                                                                                                                                                                                                                          |
+| 26. | mmn_with_h2_cold_h2_warmup.py     | Multichannel queuing system with exp serving time, H2 warm-up and H2 cold (vacations). The system uses complex parameters, which allows to calculate systems with arbitrary warm-up and cold variation coefficients                                        |
+| 27. | mgn_with_h2_delay_cold_warm.py    | Multichannel queuing system with H2 serving time, H2 warm-up, H2 cold delay and H2 cold (vacations). The system uses complex parameters, which allows you to calculate systems with arbitrary serving, warm-up, cold-delay and cold variation coefficients |
+### Package .sim
+| #  | Package name               | Description |
+| ------------- |----------------------------|------------- |
+| 1.  | fj_delta_sim               | Simulation of QS fork-join with a delay in the start of processing between channels |
+| 2.  | fj_sim                     | Simulation of QS with fork-join process |
+| 3.  | priority_network           | Simulation of queuing network with priorities in nodes |
+| 4.  | rand_distribution          | A set of functions and classes designed to generate a PRNG and select parameters for distributions H2, C2, Ek, Pa, Gamma |
+| 5.  | qs_sim                     | Simulation of QS GI/G/m/n  |
+| 6.  | priority_queue_sim         | Simulation of QS GI/G/m/n  with priorities  |
+| 7.  | flow_sum_sim               | Simulation of flow summation |
+| 8.  | impatient_sim.py           | Simulation of QS GI/G/m/n with impatience |
+| 9.  | batch_sim.py               | Simulation of QS GI/G/m/n with batch arrival |
+| 10.  | queue_finite_source_sim.py | Simulation of QS GI/G/m/n with finite sources |
+## Usage
+Look [here](https://github.com/xabarov/most-queue/tree/main/most_queue/tests) for examples

{most_queue-1.32 → most_queue-1.34}/README.md RENAMED Viewed

File without changes

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/__init__.py RENAMED Viewed

File without changes

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/batch_sim.py RENAMED Viewed

@@ -81,37 +81,3 @@ class QueueingSystemBatchSim(QueueingSystemSimulator):
                         break
-if __name__ == '__main__':
-    from most_queue.theory.batch_mm1 import BatchMM1
-    ls = [0.2, 0.3, 0.1, 0.2, 0.2]
-    moments = [0.0, 0.0]
-    for j in range(len(moments)):
-        for i in range(len(ls)):
-            moments[j] += pow(i + 1, j + 1)
-        moments[j] /= len(ls)
-    n = 1
-    lam = 0.7
-    ro = 0.8
-    mu = lam * moments[0] / ro
-    n_jobs = 1000000
-    batch_calc = BatchMM1(lam, mu, ls)
-    v1 = batch_calc.get_v1()
-    qs = QueueingSystemBatchSim(n, ls)
-    qs.set_sources(lam, 'M')
-    qs.set_servers(mu, 'M')
-    qs.run(n_jobs)
-    v1_im = qs.v[0]
-    print("\nЗначения среднего времени пребывания заявок в системе:\n")
-    print("{0:^15s}|{1:^15s}|{2:^15s}".format("№ момента", "Числ", "ИМ"))
-    print("-" * 45)
-    print("{0:^16d}|{1:^15.5g}|{2:^15.5g}".format(1, v1, v1_im))

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/fj_delta_sim.py RENAMED Viewed

@@ -2,7 +2,7 @@ from fj_sim import ForkJoinSim
 from fj_sim import SubTask as SubTask
 from fj_sim import Task as Task
 from qs_sim import Server
-from most_queue.theory import convolution_sum_calc
+from sim_utils import get_conv_moments, get_self_concolution_moments
 import rand_destribution as rd
@@ -40,7 +40,7 @@ class ServerWarmUp(Server):
                 elif self.dist.type == 'Gamma':
                     b = rd.Gamma.calc_theory_moments(*self.dist.params)
-                f_summ = convolution_sum_calc.get_moments(b, self.delta)
+                f_summ = get_conv_moments.get_moments(b, self.delta)
                 # variance = f_summ[1] - math.pow(f_summ[0], 2)
                 # coev = math.sqrt(variance)/f_summ[0]
                 params = rd.Gamma.get_mu_alpha(f_summ)
@@ -127,7 +127,7 @@ class ForkJoinSimDelta(ForkJoinSim):
                 if not isinstance(self.delta, list):
                     t.subtasks[i].future_arr_time = self.ttek + i * self.delta
                 else:
-                    b_delta = convolution_sum_calc.get_self_concolution(self.delta, i)
+                    b_delta = get_self_concolution_moments(self.delta, i)
                     params_delta = rd.Gamma.get_mu_alpha(b_delta)
                     t.subtasks[i].future_arr_time = self.ttek + rd.Gamma.generate_static(*params_delta)
                 self.subtask_arr_queue.append(t.subtasks[i])
@@ -300,69 +300,3 @@ class ForkJoinSimDelta(ForkJoinSim):
         return res
-if __name__ == '__main__':
-    from most_queue.theory import fj_calc
-    from most_queue.theory import mg1_warm_calc
-    from most_queue.utils.tables import times_print
-    n = 3
-    l = 1.0
-    b1 = 0.35
-    coev = 1.2
-    b1_delta = 0.1
-    b_params = rd.H2_dist.get_params_by_mean_and_coev(b1, coev)
-    delta_params = rd.H2_dist.get_params_by_mean_and_coev(b1_delta, coev)
-    b_delta = rd.H2_dist.calc_theory_moments(*delta_params)
-    b = rd.H2_dist.calc_theory_moments(*b_params, 4)
-    qs = ForkJoinSimDelta(n, n, b_delta, True)
-    qs.set_sources(l, 'M')
-    qs.set_servers(b_params, 'H')
-    qs.run(100000)
-    v_im = qs.v
-    b_max_warm = fj_calc.getMaxMomentsDelta(n, b, 4, b_delta)
-    b_max = fj_calc.getMaxMoments(n, b, 4)
-    ro = l * b_max[0]
-    v_ch = mg1_warm_calc.get_v(l, b_max, b_max_warm)
-    print("\n")
-    print("-" * 60)
-    print("{:^60s}".format('СМО Split-Join c задержкой начала обслуживания'))
-    print("-" * 60)
-    print("Коэфф вариации времени обслуживания: ", coev)
-    print("Среднее время задежки начала обслуживания: {:4.3f}".format(b1_delta))
-    print("Коэфф вариации времени задержки: {:4.3f}".format(coev))
-    print("Коэффициент загрузки: {:4.3f}".format(ro))
-    times_print(v_im, v_ch, is_w=False)
-    coev = 0.53
-    b1 = 0.5
-    b1_delta = 0.1
-    delta_params = rd.Erlang_dist.get_params_by_mean_and_coev(b1_delta, coev)
-    b_delta = rd.Erlang_dist.calc_theory_moments(*delta_params)
-    b_params = rd.Erlang_dist.get_params_by_mean_and_coev(b1, coev)
-    b = rd.Erlang_dist.calc_theory_moments(*b_params, 4)
-    qs = ForkJoinSimDelta(n, n, b_delta, True)
-    qs.set_sources(l, 'M')
-    qs.set_servers(b_params, 'E')
-    qs.run(100000)
-    v_im = qs.v
-    b_max_warm = fj_calc.getMaxMomentsDelta(n, b, 4, b_delta)
-    b_max = fj_calc.getMaxMoments(n, b, 4)
-    ro = l * b_max[0]
-    v_ch = mg1_warm_calc.get_v(l, b_max, b_max_warm)
-    print("\n\nКоэфф вариации времени обслуживания: ", coev)
-    print("Коэффициент загрузки: {:4.3f}".format(ro))
-    print("Среднее время задежки начала обслуживания: {:4.3f}".format(b1_delta))
-    print("Коэфф вариации времени задержки: {:4.3f}".format(coev))
-    times_print(v_im, v_ch, is_w=False)

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/fj_sim.py RENAMED Viewed

@@ -277,53 +277,3 @@ class QueueingSystemException(Exception):
     def __str__(self, text):
         return text
-if __name__ == '__main__':
-    from most_queue.theory import mg1_calc
-    from most_queue.theory import fj_calc
-    from most_queue.utils.tables import times_print
-    n = 3
-    l = 1.0
-    b1 = 0.37
-    coev = 1.5
-    params = rd.H2_dist.get_params_by_mean_and_coev(b1, coev)
-    b = rd.H2_dist.calc_theory_moments(*params, 4)
-    qs = ForkJoinSim(n, n, True)
-    qs.set_sources(l, 'M')
-    qs.set_servers(params, 'H')
-    qs.run(100000)
-    v_im = qs.v
-    b_max = fj_calc.getMaxMoments(n, b, 4)
-    ro = l * b_max[0]
-    v_ch = mg1_calc.get_v(l, b_max)
-    print("\n")
-    print("-" * 60)
-    print("{:^60s}".format('СМО Split-Join'))
-    print("-" * 60)
-    print("Коэфф вариации времени обслуживания: ", coev)
-    print("Коэффициент загрузки: {:4.3f}".format(ro))
-    times_print(v_im, v_ch, is_w=False)
-    coev = 0.8
-    b1 = 0.5
-    params = rd.Erlang_dist.get_params_by_mean_and_coev(b1, coev)
-    b = rd.Erlang_dist.calc_theory_moments(*params, 4)
-    qs = ForkJoinSim(n, n, True)
-    qs.set_sources(l, 'M')
-    qs.set_servers(params, 'E')
-    qs.run(100000)
-    v_im = qs.v
-    b_max = fj_calc.getMaxMoments(n, b, 4)
-    ro = l * b_max[0]
-    v_ch = mg1_calc.get_v(l, b_max)
-    print("\n\nКоэфф вариации времени обслуживания: ", coev)
-    print("Коэффициент загрузки: {:4.3f}".format(ro))
-    times_print(v_im, v_ch, is_w=False)

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/flow_sum_sim.py RENAMED Viewed

File without changes

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/impatient_queue_sim.py RENAMED Viewed

@@ -1,5 +1,5 @@
 import rand_destribution as rd
-from qs_sim import QueueingSystemSimulator, QueueSystemException, Task
+from qs_sim import QueueingSystemSimulator, Task, SetSmoException
 class ImpatientTask(Task):
@@ -53,7 +53,7 @@ class ImpatientQueueSim(QueueingSystemSimulator):
         elif self.impatience_types == "D":
             self.impatience = rd.Det_dist(self.impatience_params)
         else:
-            raise QueueSystemException(
+            raise SetSmoException(
                 "Неправильно задан тип распределения нетерпения заявок. Варианты М, Н, Е, С, D, Pa, Uniform")
     def arrival(self):
@@ -163,30 +163,4 @@ class ImpatientQueueSim(QueueingSystemSimulator):
         print(f'Task {num_of_task_earlier} is earlier to leave at {moment_to_leave_earlier:8.3f}')
-if __name__ == '__main__':
-    from most_queue.theory import impatience_calc
-    n = 1
-    l = 1.0
-    ro = 0.8
-    n_jobs = 300000
-    mu = l / (ro * n)
-    gamma = 0.2
-    v1 = impatience_calc.get_v1(l, mu, gamma)
-    qs = ImpatientQueueSim(n)
-    qs.set_sources(l, 'M')
-    qs.set_servers(mu, 'M')
-    qs.set_impatiens(gamma, 'M')
-    qs.run(n_jobs)
-    v1_im = qs.v[0]
-    print("\nЗначения среднего времени пребывания заявок в системе:\n")
-    print("{0:^15s}|{1:^15s}|{2:^15s}".format("№ момента", "Числ", "ИМ"))
-    print("-" * 45)
-    print("{0:^16d}|{1:^15.5g}|{2:^15.5g}".format(1, v1, v1_im))

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/priority_network.py RENAMED Viewed

@@ -3,7 +3,7 @@ import rand_destribution as rd
 import numpy as np
 import math
 from priority_queue_sim import Task
-from most_queue.theory import network_calc
+from theory import network_calc
 import time
 from tqdm import tqdm
 import sys
@@ -155,91 +155,3 @@ class PriorityNetwork:
             print(Style.RESET_ALL)
-if __name__ == '__main__':
-    from most_queue.utils.tables import times_print_with_classes
-    k_num = 3
-    n_num = 5
-    n = [3, 2, 3, 4, 3]
-    R = []
-    b = []  # k, node, j
-    for i in range(k_num):
-        R.append(np.matrix([
-            [1, 0, 0, 0, 0, 0],
-            [0, 0.4, 0.6, 0, 0, 0],
-            [0, 0, 0, 0.6, 0.4, 0],
-            [0, 0, 0, 0, 1, 0],
-            [0, 0, 0, 0, 1, 0],
-            [0, 0, 0, 0, 0, 1]
-        ]))
-    L = [0.1, 0.3, 0.4]
-    nodes_prty = []
-    jobs_num = 100000
-    serv_params = []
-    h2_params = []
-    for m in range(n_num):
-        nodes_prty.append([])
-        for j in range(k_num):
-            if m % 2 == 0:
-                nodes_prty[m].append(j)
-            else:
-                nodes_prty[m].append(k_num - j - 1)
-        b1 = 0.9 * n[m] / sum(L)
-        coev = 1.2
-        h2_params.append(rd.H2_dist.get_params_by_mean_and_coev(b1, coev))
-        serv_params.append([])
-        for i in range(k_num):
-            serv_params[m].append({'type': 'H', 'params': h2_params[m]})
-    for k in range(k_num):
-        b.append([])
-        for m in range(n_num):
-            b[k].append(rd.H2_dist.calc_theory_moments(*h2_params[m], 4))
-    prty = ['NP'] * n_num
-    qn = PriorityNetwork(k_num, L, R, n, prty, serv_params, nodes_prty)
-    qn.run(jobs_num)
-    v_sim = qn.v_network
-    calc_res = network_calc.network_prty_calc(R, b, n, L, prty, nodes_prty)
-    v_ch = calc_res['v']
-    loads = calc_res['loads']
-    print("\n")
-    print("-" * 60)
-    print("{0:^60s}\n{1:^60s}".format("Сравнение данных ИМ и результатов расчета времени пребывания",
-                                      "в СеМО с многоканальными узлами и приоритетами"))
-    print("-" * 60)
-    print("Количество каналов в узлах:")
-    for nn in n:
-        print("{0:^1d}".format(nn), end=" ")
-    print("\nКоэффициенты загрузки узлов:")
-    for load in loads:
-        print("{0:^1.3f}".format(load), end=" ")
-    print("\n")
-    print("-" * 60)
-    print("{0:^60s}".format("Относительный приоритет"))
-    print("-" * 60)
-    times_print_with_classes(v_sim, v_ch, is_w=False)
-    prty = ['PR'] * n_num
-    qn = PriorityNetwork(k_num, L, R, n, prty, serv_params, nodes_prty)
-    qn.run(jobs_num)
-    v_sim = qn.v_network
-    calc_res = network_calc.network_prty_calc(R, b, n, L, prty, nodes_prty)
-    v_ch = calc_res['v']
-    print("-" * 60)
-    print("{0:^60s}".format("Абсолютный приоритет"))
-    print("-" * 60)
-    times_print_with_classes(v_sim, v_ch, is_w=False)

{most_queue-1.32 → most_queue-1.34}/most_queue/sim/priority_queue_sim.py RENAMED Viewed

@@ -1,4 +1,4 @@
-from most_queue.sim import rand_destribution as rd
+from sim import rand_destribution as rd
 import time
 import sys
@@ -810,73 +810,4 @@ class Server:
         return res
-if __name__ == "__main__":
-    from most_queue.theory import priority_calc
-    import math
-    import rand_destribution as rd
-    from most_queue.utils.tables import times_print_with_classes
-    n = 5
-    k = 3
-    l = [0.2, 0.3, 0.4]
-    lsum = sum(l)
-    num_of_jobs = 100000
-    b1 = [0.45 * n, 0.9 * n, 1.35 * n]
-    b2 = [0] * k
-    coev = 0.577
-    for i in range(k):
-        b2[i] = (b1[i] ** 2) * (1 + coev ** 2)
-    b_sr = sum(b1) / k
-    ro = lsum * b_sr / n
-    params = []
-    for i in range(k):
-        params.append(rd.Gamma.get_mu_alpha([b1[i], b2[i]]))
-    b = []
-    for j in range(k):
-        b.append(rd.Gamma.calc_theory_moments(params[j][0], params[j][1], 4))
-    print("\nСравнение данных ИМ и результатов расчета методом инвариантов отношения (Р) \n"
-          "времени пребывания в многоканальной СМО с приоритетами")
-    print("Число каналов: " + str(n) + "\nЧисло классов: " + str(k) + "\nКоэффициент загрузки: {0:<1.2f}".format(ro) +
-          "\nКоэффициент вариации времени обслуживания: " + str(coev) + "\n")
-    print("Абсолютный приоритет")
-    qs = PriorityQueueSimulator(n, k, "PR")
-    sources = []
-    servers_params = []
-    for j in range(k):
-        sources.append({'type': 'M', 'params': l[j]})
-        servers_params.append({'type': 'Gamma', 'params': params[j]})
-    qs.set_sources(sources)
-    qs.set_servers(servers_params)
-    qs.run(num_of_jobs)
-    v_im = qs.v
-    v_teor = priority_calc.get_v_prty_invar(l, b, n, 'PR')
-    times_print_with_classes(v_im, v_teor, is_w=False)
-    print("Относительный приоритет")
-    qs = PriorityQueueSimulator(n, k, "NP")
-    sources = []
-    servers_params = []
-    for j in range(k):
-        sources.append({'type': 'M', 'params': l[j]})
-        servers_params.append({'type': 'Gamma', 'params': params[j]})
-    qs.set_sources(sources)
-    qs.set_servers(servers_params)
-    qs.run(num_of_jobs)
-    v_im = qs.v
-    v_teor = priority_calc.get_v_prty_invar(l, b, n, 'NP')
-    times_print_with_classes(v_im, v_teor, is_w=False)

most-queue 1.32__tar.gz → 1.34__tar.gz

Potentially problematic release.

most-queue 1.32tar.gz → 1.34tar.gz