- Tytuł:
- Classical and non-classical processor sharing systems with non-homogeneous customers
- Autorzy:
- Tikhonenko, O.
- Powiązania:
- https://bibliotekanauki.pl/articles/121683.pdf
- Data publikacji:
- 2009
- Wydawca:
- Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
- Tematy:
-
kolejkowanie
system kolejkowania
egalitarne współdzielenie procesora
transformata Laplace'a
queuing
queuing system
egalitarian processor sharing
Laplace transform - Opis:
- We discuss a processor sharing system with non-homogeneous customers. There are resources of two types for their service: 1) resource of the first type is discrete, there are N units (servers) of the resource; 2) resource of the second type (capacity) is not-necessary discrete. The type of a customer is defined by the amount of first type resource units which is used for the customer service. Each customer is also characterized by some random capacity or some amount of the second type resource which is also used for his service. The total capacity of customers present in the system is limited by some value V >0, which is called the memory volume of the system. The customer capacity and length (the work necessary for service) are generally dependent. The joint distribution of these random variables also depends on the customer type. For such systems we determine the stationary distribution of the number of customers of each type present in the system and stationary loss probabilities for each type of customers.
- Źródło:
-
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2009, 14; 133-150
2450-9302 - Pojawia się w:
- Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
- Dostawca treści:
- Biblioteka Nauki
Artykuł