------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Cheddar is a GNU GPL real-time scheduling analysis tool. -- This program provides services to automatically check schedulability and -- other performance criteria of real-time architecture models. -- -- Copyright (C) 2002-2016, Frank Singhoff, Alain Plantec, Jerome Legrand -- -- The Cheddar project was started in 2002 by -- Frank Singhoff, Lab-STICC UMR 6285 laboratory, Université de Bretagne Occidentale -- -- Cheddar has been published in the "Agence de Protection des Programmes/France" in 2008. -- Since 2008, Ellidiss technologies also contributes to the development of -- Cheddar and provides industrial support. -- -- The full list of contributors and sponsors can be found in AUTHORS.txt and SPONSORS.txt -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 2 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program; if not, write to the Free Software -- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -- -- -- Contact : cheddar@listes.univ-brest.fr -- ------------------------------------------------------------------------------ -- Last update : -- $Rev: 1249 $ -- $Date: 2014-08-28 07:02:15 +0200 (Fri, 28 Aug 2014) $ -- $Author: singhoff $ ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ package body Queueing_System.theoretical.Mm1 is procedure Initialize (A_Queueing_System : in out Mm1_Queueing_System_theoretical) is begin Initialize (Generic_Queueing_System_theoretical (A_Queueing_System)); A_Queueing_System.Queueing_System_Type := Qs_Mm1; end Initialize; procedure Qs_Average_Waiting_Time (A_Queueing_System : in Mm1_Queueing_System_theoretical; Result : in out Double) is Arrival_Rate : constant Double := A_Queueing_System.Arrival_Rate.entries (0).data; Service_Rate : constant Double := A_Queueing_System.Service_Rate.entries (0).data; begin Result := 1.0 / (Service_Rate * (1.0 - Arrival_Rate / Service_Rate)); end Qs_Average_Waiting_Time; procedure Qs_Average_Number_Customer (A_Queueing_System : in Mm1_Queueing_System_theoretical; Result : in out Double) is Rho : constant Double := A_Queueing_System.Arrival_Rate.entries (0).data / A_Queueing_System.Service_Rate.entries (0).data; begin Result := Rho / (1.0 - Rho); end Qs_Average_Number_Customer; procedure Qs_Maximum_Number_Customer (A_Queueing_System : in Mm1_Queueing_System_theoretical; Result : in out Double) is begin Result := 0.0; -- raise Not_Implemented; end Qs_Maximum_Number_Customer; procedure Qs_Maximum_Waiting_Time (A_Queueing_System : in Mm1_Queueing_System_theoretical; Result : in out Double) is begin Result := 0.0; -- raise Not_Implemented; end Qs_Maximum_Waiting_Time; function Get_Probability_Of_State (A_Queueing_System : in Mm1_Queueing_System_theoretical; N : in Natural) return Double is Rau : constant Double := A_Queueing_System.Arrival_Rate.entries (0).data / A_Queueing_System.Service_Rate.entries (0).data; Result : Double; begin Result := Pow (Rau, Double (N)); Result := Result * (1.0 - Rau); return (Result); end Get_Probability_Of_State; end Queueing_System.theoretical.Mm1;