esiur/esiur-dotnet
2
0
Fork 0
mirror of https://github.com/esiur/esiur-dotnet.git synced 2025-06-27 05:23:13 +00:00
Code Issues Projects Releases Wiki Activity

eBook

Browse Source
This commit is contained in:
Ahmed Zamil
2023-04-20 15:55:20 +03:00
parent 0ceaee88aa
commit a95b68c610
46 changed files with 2361 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Esiur.Analysis/Coding/BlockCode.cs
View File

@ -26,8 +26,8 @@ namespace Esiur.Analysis.Coding
for(var j = 0; j < p.Columns; j++)
g[i, j] = p[i, j];
for (var i = 0; i < k; i++)
g[i, p.Columns + i] = (T)1;
//for (var i = 0; i < k; i++)
// g[i, p.Columns + i] = (T)1;
}
}

2
Esiur.Analysis/Esiur.Analysis.csproj
View File

@ -1,4 +1,4 @@
<Project Sdk="Microsoft.NET.Sdk">
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<TargetFramework>netstandard2.1</TargetFramework>

21
Esiur.Analysis/LICENSE Normal file
View File

@ -0,0 +1,21 @@
MIT License
Copyright (c) 2022 - 2023 Esiur Foundation, Ahmed Kh. Zamil.
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.

107
Esiur.Analysis/Queueing/MeanValueAnalysis.cs Normal file
View File

@ -0,0 +1,107 @@
/*
Copyright (c) 2023 Ahmed Kh. Zamil
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.
*/
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Text;
namespace Esiur.Analysis.Queueing
{
public class MeanValueAnalysis
{
public Queue[] Nodes { get; set; }
public MeanValueAnalysis(Queue[] queues)
{
Nodes = queues;
}
public double NormalizationConstant { get; set; }
public class MVAResult
{
public Queue Node { get; set; }
public double MeanNumberOfCustomers { get; set; }
public double MeanResponseTime { get; set; }
public double Throughput { get; set; }
public double NormalizationConstant { get; set; }
}
public MVAResult[] Process(int customers)
{
var R = new double[Nodes.Length];
var L = new double[Nodes.Length];
var X = 0.0;
var G = 1.0;
// initialize
for (var k = 1; k <= customers; k++)
{
X = 0;
// Compute response time R
for (var i = 0; i < Nodes.Length; i++)
{
if (k == 1 || Nodes[i].Servers == 0)
R[i] = (1 / Nodes[i].ServiceRate);
else if (Nodes[i].Servers == 1)
R[i] = (1 / Nodes[i].ServiceRate) * (1 + L[i]);
// Compute throughput X
X += R[i] * Nodes[i].VisitRatio;
}
X = k / X;
// Compute normalization factor G
G = G / X;
// Compute mean number of customers L
for (var i = 0; i < Nodes.Length; i++)
L[i] = X * Nodes[i].VisitRatio * R[i];
//Debug.Print(String.Join(" ", R));
}
var rt = new MVAResult[Nodes.Length];
for (var i = 0; i < Nodes.Length; i++)
rt[i] = new MVAResult() { MeanNumberOfCustomers = L[i], MeanResponseTime = R[i], Node = Nodes[i], NormalizationConstant = G, Throughput = L[i] / R[i] };
//Console.WriteLine(X);
return rt;
}
}
}

118
Esiur.Analysis/Queueing/Queue.cs Normal file
View File

@ -0,0 +1,118 @@
/*
Copyright (c) 2023 Ahmed Kh. Zamil
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.
*/
using Esiur.Analysis.Statistics;
using System;
using System.Collections.Generic;
using System.Text;
using System.Text.RegularExpressions;
namespace Esiur.Analysis.Queueing
{
public enum ProcessType
{
Markovian
}
public enum Discipline
{
}
public class Queue
{
public ProcessType ArrivalProcess { get; set; }
public ProcessType ServiceProcess { get; set; }
public double ArrivalRate { get; set; }
public double VisitRatio { get; set; } // for Mean Value Analysis
public double ServiceRate { get; set; }
public int Capacity { get; set; }
public int Servers { get; set; }
public int Population { get; set; }
public string Label { get; set; }
public double TrafficIntensity => Servers > 0 ? ArrivalRate / (Servers * ServiceRate) : ArrivalRate / ServiceRate;
public double Pie(int n)
{
var rho = TrafficIntensity;
// MM1
if (Servers == 1 && Capacity == 0 && Population == 0)
return Math.Pow(rho, n) * (1 - rho);
// M/M/1/K
if (Servers == 1 && Capacity == 1 && Population == 0)
{
if (rho == 1)
return Math.Pow(rho, n) * (1 / (Servers + Capacity + 1));
else
return Math.Pow(rho, n) * ((1 - rho) / (1 - Math.Pow(rho, Servers + Capacity + 1)));
}
// M/M/Infinity
if (Servers == 0 && Capacity == 0 && Population == 0)
return (Math.Pow(rho, n) / n.Factorial()) * Math.Exp(-rho);
// M/M/C
if (Servers > 0 && Capacity > 0 && Population ==0)
{
double pie0 = 1;
for (var i = 1; i < Capacity - 1; i++)
pie0 += Math.Pow(Servers * rho, i) / i.Factorial();
pie0 += Math.Pow(Servers * rho, Servers) / (Servers.Factorial() * (1 - rho));
pie0 = 1 / pie0;
return (Math.Pow(Servers * rho, n) / n.Factorial()) * pie0;
}
// M/M/C/K
if (Servers > 0 && Capacity > 0 && Population > 0)
{
double pie0 = 1;
for (var i = 1; i < Capacity - 1; i++)
pie0 += Math.Pow(Servers * rho, i) / i.Factorial();
double cc = Math.Pow(Servers, Servers) / Servers.Factorial();
for(var i = Servers; i <= Servers + Capacity; i++)
pie0 += cc * Math.Pow(rho, i);
pie0 = 1 / pie0;
return (Math.Pow(Servers * rho, n) / n.Factorial()) * pie0;
}
return 0;
}
}
}

72
Esiur.Analysis/Scheduling/SPF.cs Normal file
View File

@ -0,0 +1,72 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace Esiur.Analysis.Scheduling
{
public class Process
{
public double Burst { get; set; }
public double Arrival { get; set; }
public double WaitTime => StartTime - Arrival;
public double StartTime { get; set; }
public int Priority { get; set; }
public string Title { get; set; }
public override string ToString()
{
return $"{Title} - Arrival: {Arrival} Priority: {Priority} WaitTime: {WaitTime} Burst: {Burst} Start: {StartTime}";
}
}
public class SPF
{
public static void Schedule(Process[] processes)
{
processes = processes.OrderBy(x => x.Burst).ToArray();
processes[0].StartTime = processes[0].Arrival;
// Calculation of Waiting Times
for (int i = 1; i < processes.Length; i++)
{
if (processes[i - 1].StartTime + processes[i - 1].Burst > processes[i].Arrival)
processes[i].StartTime = processes[i - 1].Arrival + processes[i - 1].Burst - processes[i].Arrival;
}
}
public static Process[] ScheduleHybrid(Process[] processes)
{
processes = processes.OrderBy(x => x.Arrival)
.ThenBy(x => x.Priority)
.ThenBy(x=>x.Burst)
.ToArray();
processes[0].StartTime = processes[0].Arrival;
// Calculation of StartTime.
// WaitTime = StartTime - ArrivalTime
for (int i = 1; i < processes.Length; i++)
{
if (processes[i - 1].StartTime + processes[i - 1].Burst > processes[i].Arrival)
processes[i].StartTime = processes[i - 1].StartTime + processes[i - 1].Burst;
else
processes[i].StartTime = processes[i].Arrival;
}
return processes;
}
}
}

55
Esiur.Analysis/Statistics/Distributions.cs Normal file
View File

@ -0,0 +1,55 @@
using System;
using System.Collections.Generic;
using System.Text;
namespace Esiur.Analysis.Statistics
{
public static class Distributions
{
public static int Factorial(this int n)
{
var rt = 1;
while (n > 1)
rt *= n--;
return rt;
}
public static int Permutation(int n, int k)
{
var rt = 1;
var l = n - k;
while (n > l)
rt *= n--;
return n;
}
public static int Combination(int n, int k)
{
var rt = 1;
while (n > k)
rt *= n--;
rt /= Factorial(n - k);
return rt;
}
public static Probability Binomial(Probability p, int n, int x)
{
return Combination(n, x) * p.Power(x) * (1 - p.Power(n - x));
}
public static Probability Poisson(double l, int x)
{
return Math.Exp(-l) * Math.Pow(l, x) / Factorial(x);
}
public static Probability Geometric(Probability p, int x)
{
// joint probability of failures and one success
return p.Inverse().Power(x - 1) * p;
}
}
}

11
Esiur.Analysis/Statistics/Probability.cs
View File

@ -12,6 +12,7 @@ namespace Esiur.Analysis.Statistics
public static implicit operator Probability(double v) => new Probability(v);
public static implicit operator double(Probability v) => v.Value;
public Probability(double value)
{
if (value > 1 || value < 0)
@ -27,5 +28,15 @@ namespace Esiur.Analysis.Statistics
{
return (Math.Round(Value * 10000) / 100) + "%";
}
public Probability Power(double exponent)
{
return Math.Pow(Value, exponent);
}
public Probability Inverse()
{
return 1 - Value;
}
}
}

5
Esiur.Analysis/Statistics/StatisticalFunctions.cs
View File

@ -28,8 +28,11 @@ namespace Esiur.Analysis.Statistics
double rt = 0;
for (var i = 0; i < n; i++)
{
rt += (x[i] - X) * (y[i] - Y);
rt += (x[i] * y[i] - Y * x[i] - X * y[i] + X * Y);// - X) * (y[i] - Y);
}
return rt / n;
}