| dc.description.abstract | We consider a set-up in which there are multiple servers and multiple clients in a large distributed
computing system. Clients request servers to process jobs. Servers can only process one job in unit time.
There is no coordinating agent to route client requests to servers, and clients choose servers independently
and simultaneously, and only have access to the outcomes of their own past requests. If more than one
clients choose the same server, then only one randomly chosen client’s request will be fulfilled. If some
servers do not receive any request, they remain idle. In this paper, we show that a large category of
strategies are not effective in terms of server utilization. We devise strategies for clients that improve
server utilization of such systems over those of strategies known in the current literature | en_US |
