Log in

Relevant bibliographies by topics / Server model / Journal articles

To see the other types of publications on this topic, follow the link: Server model.

Journal articles on the topic 'Server model'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Server model.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Oluwatosin, Haroon Shakirat. "Client-Server Model." IOSR Journal of Computer Engineering 16, no. 1 (2014): 57–71. http://dx.doi.org/10.9790/0661-16195771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chakravarthy, Srinivas R. "A multi-server queueing model with server consultations." European Journal of Operational Research 233, no. 3 (2014): 625–39. http://dx.doi.org/10.1016/j.ejor.2013.10.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Artalejo, J. R., D. S. Orlovsky, and A. N. Dudin. "Multi-server retrial model with variable number of active servers." Computers & Industrial Engineering 48, no. 2 (2005): 273–88. http://dx.doi.org/10.1016/j.cie.2005.01.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Klimenok, Valentina I. "Multi-server queueing system with reserve servers." Journal of the Belarusian State University. Mathematics and Informatics, no. 3 (November 29, 2019): 57–70. http://dx.doi.org/10.33581/2520-6508-2019-3-57-70.

Full text

Abstract:

In this paper, we investigate a multi-server queueing system with an unlimited buffer, which can be used in the design of energy consumption schemes and as a mathematical model of unreliable real stochastic systems. Customers arrive to the system in a batch Markovian arrival process, the service times are distributed according to the phase law. If the service time of the customer by the server exceeds a certain random value distributed according to the phase law, this server receives assistance from the reserve server from a finite set of reserve servers. In the paper, we calculate the station

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Weina, Qiaomin Xie, and Mor Harchol-Balter. "Zero Queueing for Multi-Server Jobs." Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, no. 1 (2021): 1–25. http://dx.doi.org/10.1145/3447385.

Full text

Abstract:

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-server-per-job model: an arrival might not "fit'' into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a m

APA, Harvard, Vancouver, ISO, and other styles

6

Ramanujam, Sukumar, Mahesh T R, and Mouleeshwaran S K. "A Novel Approach for Enhancing Performance of VoD Systems." International Journal of Advanced Research in Engineering 4, no. 4 (2018): 7. http://dx.doi.org/10.24178/ijare.2018.4.4.07.

Full text

Abstract:

Multimedia applications such as Video-on-Demand (VoD), Live streaming, Internet stock quotes, Internet radio, audio/music delivery, video surveillance are of growing interest among general public. Existing systems that support these kinds of applications such as centralized server, independent server nodes, and proxy incur significant delay and serve only less number of videos. In this research, a multi-server system that utilizes a split and merge scheme is proposed to reduce the waiting time. This system helps us to achieve load balancing, while increasing the number of videos being served.

APA, Harvard, Vancouver, ISO, and other styles

7

INOUE, TAKURO, TOMOYA ENOKIDO, AILIXIER AIKEBAIER, and MAKOTO TAKIZAWA. "AN APPLICATION-ORIENTED POWER CONSUMPTION MODEL OF STORAGE SERVERS." Journal of Interconnection Networks 12, no. 03 (2011): 261–75. http://dx.doi.org/10.1142/s0219265911002988.

Full text

Abstract:

The electric power consumption of each information system has to be reduced in order to realize green societies. In information systems, clients issue requests to servers and the servers spend electric power to handle the requests. We have to reduce the power consumption of servers since servers mainly consume electric power compared with clients. There are computation (CP), communication (CM), and storage (ST) types of applications to be performed on servers. In CP and CM applications, CPU and communication resources are mainly consumed, respectively. In this paper, we consider ST application

APA, Harvard, Vancouver, ISO, and other styles

8

Dudin, Alexander, Olga Dudina, Sergei Dudin, and Konstantin Samouylov. "Analysis of Multi-Server Queue with Self-Sustained Servers." Mathematics 9, no. 17 (2021): 2134. http://dx.doi.org/10.3390/math9172134.

Full text

Abstract:

A novel multi-server vacation queuing model is considered. The distinguishing feature of the model, compared to the standard queues, is the self-sufficiency of servers. A server can terminate service and go on vacation independently of the system manager and the overall situation in the system. The system manager can make decisions whether to allow the server to start work after vacation completion and when to try returning some server from a vacation to process customers. The arrival flow is defined by a general batch Markov arrival process. The problem of optimal choice of the total number o

APA, Harvard, Vancouver, ISO, and other styles

9

Nasir, Saja, Muayad Croock, and Salih Al-Qaraawi. "Software engineering based fault tolerance model for information system in plants shopping center." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 6 (2020): 6664. http://dx.doi.org/10.11591/ijece.v10i6.pp6664-6672.

Full text

Abstract:

The rapid development of mobile phone technologies in recent years promoted them for being used in various areas of life, such as commercial, health, transportation and tourism and other uses. In this paper, a software engineering based fault tolerance model is proposed to manage the expected faults in the adopted servers. The underlying QR based information system in plants shopping center employs different local serves allocated at local shops that are connected to the main server. In a fault case detection at any local server, the main server can cover the management of the system until the

APA, Harvard, Vancouver, ISO, and other styles

10

Chakravarthy, Srinivas R., Shruti, and Rakhee Kulshrestha. "A queueing model with server breakdowns, repairs, vacations, and backup server." Operations Research Perspectives 7 (2020): 100131. http://dx.doi.org/10.1016/j.orp.2019.100131.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ross, Sheldon M. "Optimal Server Selection in a Queueing Loss Model with Heterogeneous Exponential Servers, Discriminating Arrivals, and Arbitrary Arrival Times." Journal of Applied Probability 51, no. 3 (2014): 880–84. http://dx.doi.org/10.1239/jap/1409932680.

Full text

Abstract:

We consider a multiple server queueing loss system where the service times of server i are exponential with rate μi, where μi decreases in i. Arrivals have associated vectors (X1, …, Xn) of binary variables, with Xi = 1 indicating that server i is eligible to serve that arrival. Arrivals finding no idle eligible servers are lost. Letting Ij be the indicator variable for the event that the jth arrival enters service, we show that, for any arrival process, the policy that assigns arrivals to the smallest numbered idle eligible server stochastically maximizes the vector (I1, …, Ir) for every r if

APA, Harvard, Vancouver, ISO, and other styles

12

Ross, Sheldon M. "Optimal Server Selection in a Queueing Loss Model with Heterogeneous Exponential Servers, Discriminating Arrivals, and Arbitrary Arrival Times." Journal of Applied Probability 51, no. 03 (2014): 880–84. http://dx.doi.org/10.1017/s0021900200011736.

Full text

Abstract:

We consider a multiple server queueing loss system where the service times of server i are exponential with rate μ i , where μ i decreases in i. Arrivals have associated vectors (X 1, …, X n ) of binary variables, with X i = 1 indicating that server i is eligible to serve that arrival. Arrivals finding no idle eligible servers are lost. Letting I j be the indicator variable for the event that the jth arrival enters service, we show that, for any arrival process, the policy that assigns arrivals to the smallest numbered idle eligible server stochastically maximizes the vector (I 1, …, I r ) for

APA, Harvard, Vancouver, ISO, and other styles

13

Malhotra, Anshu, Animesh Sit, Neeraj Dubey, Abhinav Tyagi, and Pranav Bhatia. "Security Enhancement Using Two-Server Model." International Journal of Innovative Research in Computer and Communication Engineering 02, no. 12 (2014): 7178–81. http://dx.doi.org/10.15680/ijircce.2014.0212007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hoflack, L., S. De Vuyst, S. Wittevrongel, and H. Bruneel. "Analytic traffic model of web server." Electronics Letters 44, no. 1 (2008): 61. http://dx.doi.org/10.1049/el:20083020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Choudhury, Amit. "Impatience in Single Server Queueing Model." American Journal of Mathematical and Management Sciences 28, no. 1-2 (2008): 177–211. http://dx.doi.org/10.1080/01966324.2008.10737723.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Yao, Kai. "An Uncertain Single-Server Queueing Model." Journal of Uncertain Systems 14, no. 01 (2021): 2150001. http://dx.doi.org/10.1142/s175289092150001x.

Full text

Abstract:

In the queueing theory, the interarrival times between customers and the service times for customers are usually regarded as random variables. This paper considers human uncertainty in a queueing system, and proposes an uncertain queueing model in which the interarrival times and the service times are regarded as uncertain variables. The busyness index is derived analytically which indicates the service efficiency of a queueing system. Besides, the uncertainty distribution of the busy period is obtained.

APA, Harvard, Vancouver, ISO, and other styles

17

Parimala, R. Sree, and S. Palaniammal. "Single server queueing model with server delayed vacation and switch over state." Applied Mathematical Sciences 8 (2014): 8113–24. http://dx.doi.org/10.12988/ams.2014.49774.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Seenivasan, M., and K. S.Subasri. "Batch Arrival Queueing Model with Unreliable Server." International Journal of Engineering & Technology 7, no. 4.10 (2018): 269. http://dx.doi.org/10.14419/ijet.v7i4.10.20910.

Full text

Abstract:

The unreliable server with provision of temporary server in the context of application has been investigated. A temporary server is installed when the primary server is over loaded i.e., a ﬁxed queue length of K-policy customers including the customer with the primary server has been build up. The primary server may breakdown while rendering service to the customers; it is sent for the repair. This type of queuing system has been investigated using Matrix Geometric Method to obtain the probabilities of the system steady state.AMS subject classiﬁcation number— 60K25, 60K30 and 90B22.

APA, Harvard, Vancouver, ISO, and other styles

19

Haji, Babak. "ON THE ADAN–WEISS LOSS MODEL HAVING SKILL-BASED SERVERS AND LONGEST IDLE ASSIGNMENT RULE." Probability in the Engineering and Informational Sciences 29, no. 2 (2015): 181–89. http://dx.doi.org/10.1017/s026996481400028x.

Full text

Abstract:

We consider a queueing loss system with heterogeneous skill based servers with arbitrary distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. Arrivals can only be assigned to a server that is both idle and eligible. We assume arrivals are assigned to the idle eligible server that has been idle the longest and derive, up to a multiplicative constant, the limiting distribution for this system. We show that the limiting probabilities of the ordered list of idle servers depend on the service time distributions only t

APA, Harvard, Vancouver, ISO, and other styles

20

Stanford, David A., and Winfried K. Grassmann. "The Bilingual Server System: A Queueing Model Featuring Fully And Partially Qualified Servers." INFOR: Information Systems and Operational Research 31, no. 4 (1993): 261–77. http://dx.doi.org/10.1080/03155986.1993.11732230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Prasad, Vijay, Badshah V.H, and Tariq Ahmad Koka. "Mathematical analysis of single queue multi server and multi queue multi server queuing models: comparison study." Global Journal of Mathematical Analysis 3, no. 3 (2015): 97. http://dx.doi.org/10.14419/gjma.v3i3.4689.

Full text

Abstract:

<p>In the research paper entitled Mathematical Analysis of Single Queue Multi Server and Multi Queue Multi Server Queuing Model, Prasad and Badshah [7] were proved that single queue multi server model is better than multi queue multi server model, and discussed the relation between the performance measures of these two models, and derive the mathematical equations. In this paper we derive the total cost with assumption of certain Waiting cost in both cases. Also, prove that the expected total cost is less for single queue multi server model as comparing with multi queue multi server mode

APA, Harvard, Vancouver, ISO, and other styles

22

Korolkova, Liubov, Nematulla Mashrabov, and Alexandr Murzin. "Multi-server queue with batch arrivals." MATEC Web of Conferences 224 (2018): 04026. http://dx.doi.org/10.1051/matecconf/201822404026.

Full text

Abstract:

A multi-server queueing system, that is loaded continuously in certain periods of time and which functions for a certain amount of time allocated for the functioning of the system, is considered. Based on the renewal theory, an expression is obtained for the distribution density of the number of arrivals served herewith the service time for each server can be different. In the numerical example, the distributions of the number of services for the systems consisting of one, two, five servers are obtained. The approach to optimization of the queue using the stochastic model of supply and demand

APA, Harvard, Vancouver, ISO, and other styles

23

Et. al., Dr Navneet Kumar Verma,. "Optimization Of Queueing Model." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (2021): 3025–28. http://dx.doi.org/10.17762/turcomat.v12i2.2342.

Full text

Abstract:

in thepaper, we are considering the single server queueing system have interdependent arrival of the service processes having bulk service.In this article, we consider that the customers are served at any instance except when less then are in the system &ready to provide service at which time customers are served.

APA, Harvard, Vancouver, ISO, and other styles

24

Flatto, Leopold. "The Longer Queue Model." Probability in the Engineering and Informational Sciences 3, no. 4 (1989): 537–59. http://dx.doi.org/10.1017/s0269964800001376.

Full text

Abstract:

Two queues forming two independent Poisson processes are served by one server with exponential service time. The server always works on the longer queue and, in case that they are of equal length, chooses either one with probability ½. Let πij be the probability that the two queue lengths equal i andj at equilibrium and π(z, w) = ∑πi j Ziwj. We determine π(z, w) and derive from this asymptotic formulas forπij as i, j → ∞. These asymptotic formulas are used to study the interdependence of the queue lengths. In particular, we obtain limit laws for the queue lengths conditioned on each other.

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Kaixi, and Fangchun Yang. "A conference control model between a web server and a telecom application server." Journal of Electronics (China) 25, no. 2 (2008): 232–38. http://dx.doi.org/10.1007/s11767-006-0160-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Suriansyah, Mohamad Iqbal, Iyan Mulyana, Junaidy Budi Sanger, and Sandi Winata. "Compute functional analysis leveraging the IAAS private cloud computing service model in packstack development." ILKOM Jurnal Ilmiah 13, no. 1 (2021): 9–17. http://dx.doi.org/10.33096/ilkom.v13i1.693.9-17.

Full text

Abstract:

Analyzing compute functions by utilizing the IAAS model for private cloud computing services in packstack development is one of the large-scale data storage solutions. Problems that often occur when implementing various applications are the increased need for server resources, the monitoring process, performance efficiency, time constraints in building servers and upgrading hardware. These problems have an impact on long server downtime. The development of private cloud computing technology could become a solution to the problem. This research employed Openstack and Packstack by applying one s

APA, Harvard, Vancouver, ISO, and other styles

27

Cha, Ji Hwan, and Eui Yong Lee. "A Stochastic Breakdown Model for an Unreliable Web Server System and an Optimal Admission Control Policy." Journal of Applied Probability 48, no. 02 (2011): 453–66. http://dx.doi.org/10.1017/s0021900200007981.

Full text

Abstract:

Web servers have to be protected against overload since overload can lead to a server breakdown, which in turn causes high response times and low throughput. In this paper, a stochastic model for breakdowns of server systems due to overload is proposed and an admission control policy which protects Web servers by controlling the amount and rate of work entering the system is studied. Requests from the clients arrive at the server following a nonhomogeneous Poisson process and each requested job takes a random time to be completed. It is assumed that the breakdown rate of the server depends on

APA, Harvard, Vancouver, ISO, and other styles

28

Cha, Ji Hwan, and Eui Yong Lee. "A Stochastic Breakdown Model for an Unreliable Web Server System and an Optimal Admission Control Policy." Journal of Applied Probability 48, no. 2 (2011): 453–66. http://dx.doi.org/10.1239/jap/1308662638.

Full text

Abstract:

Web servers have to be protected against overload since overload can lead to a server breakdown, which in turn causes high response times and low throughput. In this paper, a stochastic model for breakdowns of server systems due to overload is proposed and an admission control policy which protects Web servers by controlling the amount and rate of work entering the system is studied. Requests from the clients arrive at the server following a nonhomogeneous Poisson process and each requested job takes a random time to be completed. It is assumed that the breakdown rate of the server depends on

APA, Harvard, Vancouver, ISO, and other styles

29

Pustovoitov, Pavlo, Kateryna Kostyk, Volodimir Kompaniiets, Vitalii Voronets, and Hasan Хасан. "Mathematical model of server requests intensity description." Bulletin of the National Technical University «KhPI» Series: New solutions in modern technologies, no. 2(4) (July 12, 2020): 76–84. http://dx.doi.org/10.20998/2413-4295.2020.02.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Sameer, Syed Shujauddin. "Simulation : Analysis of Single Server Queuing Model." International Journal on Information Theory 3, no. 3 (2014): 47–54. http://dx.doi.org/10.5121/ijit.2014.3305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Adan, Ivo, Ton de Kok, and Jacques Resing. "A multi-server queueing model with locking." European Journal of Operational Research 116, no. 2 (1999): 249–58. http://dx.doi.org/10.1016/s0377-2217(98)00224-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Chaurasia, Nisha, Shashikala Tapaswi, and Joydip Dhar. "Server Consolidation Using a Dynamic Model Approach." International Journal of Multimedia and Ubiquitous Engineering 12, no. 1 (2017): 215–24. http://dx.doi.org/10.14257/ijmue.2017.12.1.18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Esfarjani, K., and S. Y. Nof. "Client-server model of integrated production facilities." International Journal of Production Research 36, no. 12 (1998): 3295–321. http://dx.doi.org/10.1080/002075498192076.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lee, Moon, Alexander Dudin, Valentina Klimenok, and Chang Kim. "Multi-Server Queueing Model with Broadcasting Service." IEEE Communications Letters 11, no. 6 (2007): 546–48. http://dx.doi.org/10.1109/lcomm.2007.061834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Stolt, S. S., and E. Normand. "A Multicore Server SEE Cross Section Model." IEEE Transactions on Nuclear Science 59, no. 6 (2012): 2803–10. http://dx.doi.org/10.1109/tns.2012.2222437.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Batta, Rajan, Richard C. Larson, and Amedeo R. Odoni. "A single-server priority queueing-location model." Networks 18, no. 2 (1988): 87–103. http://dx.doi.org/10.1002/net.3230180202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Benkert, Pascal, Michael Künzli, and Torsten Schwede. "QMEAN server for protein model quality estimation." Nucleic Acids Research 37, suppl_2 (2009): W510—W514. http://dx.doi.org/10.1093/nar/gkp322.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

de Haan, Roland, Richard J. Boucherie, and Jan-Kees van Ommeren. "A polling model with an autonomous server." Queueing Systems 62, no. 3 (2009): 279–308. http://dx.doi.org/10.1007/s11134-009-9131-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Misra, Sudip, Sumit Goswami, Gyan Prakash Pathak, Nirav Shah, and Isaac Woungang. "Geographic server distribution model for key revocation." Telecommunication Systems 44, no. 3-4 (2010): 281–95. http://dx.doi.org/10.1007/s11235-009-9254-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Shafiq, Muhammad T., Jane Matthews, and Stephen R. Lockley. "Requirements for Model Server Enabled Collaborating on Building Information Models." International Journal of 3-D Information Modeling 1, no. 4 (2012): 8–17. http://dx.doi.org/10.4018/ij3dim.2012100102.

Full text

Abstract:

The application of Building Information Modelling (BIM) has demonstrated enormous potential to deliver consistency in the construction collaboration process. BIM can define an explicit configuration for digitized information exchange; however the technology to collaborate on models has not yet delivered the industry requirements for BIM collaboration. This research project is intended to provide a fresh review of industry requirements for BIM collaboration and will analyse how these requirements can be supported using a model server as a collaboration platform. This paper presents a review of

APA, Harvard, Vancouver, ISO, and other styles

41

Özkan, Erhun, and Jeffrey P. Kharoufeh. "OPTIMAL CONTROL OF A TWO-SERVER QUEUEING SYSTEM WITH FAILURES." Probability in the Engineering and Informational Sciences 28, no. 4 (2014): 489–527. http://dx.doi.org/10.1017/s0269964814000114.

Full text

Abstract:

We consider the problem of controlling a two-server Markovian queueing system with heterogeneous servers. The servers are differentiated by their service rates and reliability attributes (i.e., the slower server is perfectly reliable, whereas the faster server is subject to random failures). The aim is to dynamically route customers at arrival, service completion, server failure, and server repair epochs to minimize the long-run average number of customers in the system. Using a Markov decision process model, we prove that it is always optimal to route customers to the faster server when it is

APA, Harvard, Vancouver, ISO, and other styles

42

Tian, Junfeng, and He Zhang. "A Credible Cloud Service Model based on Behavior Graphs and Tripartite Decision-Making Mechanism." International Journal of Grid and High Performance Computing 8, no. 3 (2016): 38–56. http://dx.doi.org/10.4018/ijghpc.2016070103.

Full text

Abstract:

The credibility of cloud service is the key to the success of the application of cloud services. The dual servers of master server and backup server are applied to cloud services, which can improve the availability of cloud services. In the past, the failures between master server and backup server could be detected by heartbeat algorithm. Because of lacking cloud user's evaluation, the authors put forward a credible cloud service model based on behavior Graphs and tripartite decision-making mechanism. By the quantitative of cloud users' behaviors evidences, the construction of behavior Graphs

APA, Harvard, Vancouver, ISO, and other styles

43

Huang, Zhen Sheng. "Liner Model of Two-Stage Server Numbers and Load Throughputs." Applied Mechanics and Materials 182-183 (June 2012): 1303–7. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.1303.

Full text

Abstract:

This paper discuss Web servers load sharing techniques based on Domain Name Service, identifiers, and two-stage reliable and scalable Server architecture combine with DNS and identifier. Quantitative analyses the performance of the architecture and the relationship between the load throughputs and two-stage server numbers, and than obtain an approach liner regression model.

APA, Harvard, Vancouver, ISO, and other styles

44

Dorsman, Jan-Pieter L., Nir Perel, and Maria Vlasiou. "SERVER WAITING TIMES IN INFINITE SUPPLY POLLING SYSTEMS WITH PREPARATION TIMES." Probability in the Engineering and Informational Sciences 30, no. 2 (2015): 153–84. http://dx.doi.org/10.1017/s0269964815000339.

Full text

Abstract:

We consider a system consisting of a single server serving a fixed number of stations. At each station, there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queueing networks, to an extension of polling systems and surprisingly to random graphs. We are interested in the waiting time of the server. For the case where the server polls the stations cyclically, we give a sufficient condition for the existence of a limiting waiting-time distribution and we study the tail behavior of the stationary waiting time. Furt

APA, Harvard, Vancouver, ISO, and other styles

45

Stolyar, A. L. "Large-scale heterogeneous service systems with general packing constraints." Advances in Applied Probability 49, no. 1 (2017): 61–83. http://dx.doi.org/10.1017/apr.2016.79.

Full text

Abstract:

Abstract A service system with multiple types of customers, arriving according to Poisson processes, is considered. The system is heterogeneous in that the servers can also be of multiple types. Each customer has an independent, exponentially distributed service time, with the mean determined by its type. Multiple customers (possibly of different types) can be placed for service into one server, subject to `packing' constraints, which depend on the server type. Service times of different customers are independent, even if served simultaneously by the same server. The large-scale asymptotic reg

APA, Harvard, Vancouver, ISO, and other styles

46

Huang, Zheng, Jiajun Peng, Huijuan Lian, Jie Guo, and Weidong Qiu. "Deep Recurrent Model for Server Load and Performance Prediction in Data Center." Complexity 2017 (2017): 1–10. http://dx.doi.org/10.1155/2017/8584252.

Full text

Abstract:

Recurrent neural network (RNN) has been widely applied to many sequential tagging tasks such as natural language process (NLP) and time series analysis, and it has been proved that RNN works well in those areas. In this paper, we propose using RNN with long short-term memory (LSTM) units for server load and performance prediction. Classical methods for performance prediction focus on building relation between performance and time domain, which makes a lot of unrealistic hypotheses. Our model is built based on events (user requests), which is the root cause of server performance. We predict the

APA, Harvard, Vancouver, ISO, and other styles

47

Mueen, Zeina. "Estimating server utilization rate in single server queuing models using an approximate solution of stiff fluid flow model." Ain Shams Engineering Journal 11, no. 3 (2020): 805–9. http://dx.doi.org/10.1016/j.asej.2019.12.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kim, Seung-Hae, Won-Hyuk Lee, and Gi-Hwan Cho. "A Study of a Server Selection Model for Selecting a Replicated Server based on Downstream Measurement in the Server-side." Journal of Information Processing Systems 2, no. 2 (2006): 130–34. http://dx.doi.org/10.3745/jips.2006.2.2.130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

KABASSI, KATERINA, MARIA VIRVOU, and GEORGE A. TSIHRINTZIS. "WEB SERVICES USER MODEL SERVER PERFORMING DECISION MAKING." International Journal of Pattern Recognition and Artificial Intelligence 21, no. 02 (2007): 245–64. http://dx.doi.org/10.1142/s0218001407005454.

Full text

Abstract:

This paper presents a user model server based on Web Services. User model servers are very important because they allow reusability of user modeling reasoning mechanisms which are typically very complex and difficult to construct from scratch. In this paper we show how the potential of interoperability, reusability and component sharing offered by the technology of Web Services have been exploited in the design of a user model server that performs decision making. The reasoning of the user modeling is based on a multi-criteria decision making theory and has been implemented as a Web Service to

APA, Harvard, Vancouver, ISO, and other styles

50

Zheng, Xinying, and Yu Cai. "Optimal Server Allocation and Frequency Modulation on Multi-Core Based Server Clusters." International Journal of Green Computing 1, no. 2 (2010): 18–30. http://dx.doi.org/10.4018/jgc.2010070102.

Full text

Abstract:

Multi-core processing has been widely used in high-performance computing systems. Power reduction and energy conservation are important in these systems to minimize operating cost. Two main strategies exist for power management: Dynamic Voltage/Frequency Scaling (DV/FS) and server number controlling: Vary-On Vary-Off (VOVF). In this paper, the authors explore the benefits of DV/FS and VOVF and apply them in a multi-core based server cluster. An optimization problem is formulated to get the optimal resource scheduling strategy given a parallel workload. The presented optimization model provides

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!