Príklady server

• The server is down again.

• The server crashed.

• We now review the previous research on queuing systems with flexible, failureprone servers and contrast this work with our results.

• The optimal control of a two-stage tandem queueing system with flexible servers.

• Searches using a variety of protein domain servers available on the web failed to ascribe any functional significance to this region.

• Consequently, we performed two sets of numerical experiments aimed at determining the structure of the optimal policy for systems with three unreliable servers.

• Our results indicate that, for these systems, the structure of the optimal policy remains unchanged when the servers are subject to failures.

• We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues.

• Under policies pi2 and p i02, the roles of servers i1 and i2 are reversed (as described earlier).

• There exist standard log entry formats produced by the popular servers, and software available which processes the log files to produce reports.

• I thus had many more interactions with both servers and kitchen workers than with actual bar customers.

• The service times, lifetimes, and repair times of all servers are independent and exponentially distributed random variables.

• Similarly, the optimal policy for systems with two stations and two reliable servers also appears to be optimal when the two servers are unreliable.

• Consider a replicated database in which the processes of a group form a set of distributed servers.

• There is also much research on the optimal use of flexible servers in tandem systems with holding costs.

• We will refer to the polling instant of queue i as the moment when the servers enter that queue.

• More specifically, we show that when the servers are generalists, any nonidling policy is optimal, irrespective of the reliability of the servers.