ADAPTIVE ALGORITHMS FOR LOAD SHARING BETWEEN PROCESSORS WITH APPLICATIONS TO ROUTING SCHEMES.

Sykas, ED; Markovitch, DP; Protonotarios, EN

dc.contributor.author	Sykas, ED	en
dc.contributor.author	Markovitch, DP	en
dc.contributor.author	Protonotarios, EN	en
dc.date.accessioned	2014-03-01T02:47:36Z
dc.date.available	2014-03-01T02:47:36Z
dc.date.issued	1985	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33274
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022314745&partnerID=40&md5=0ff1d16b43b75e5225349d128810a215	en
dc.subject.other	MATHEMATICAL TECHNIQUES - Algorithms	en
dc.subject.other	PROBABILITY - Queueing Theory	en
dc.subject.other	ADAPTIVE ALGORITHMS	en
dc.subject.other	ADAPTIVE ROUTING	en
dc.subject.other	COMPUTER SYSTEMS, DIGITAL	en
dc.title	ADAPTIVE ALGORITHMS FOR LOAD SHARING BETWEEN PROCESSORS WITH APPLICATIONS TO ROUTING SCHEMES.	en
heal.type	conferenceItem	en
heal.publicationDate	1985	en
heal.abstract	A simple queueing system exhibiting features that make it appropriate for the study of load sharing problems or adaptive routing algorithms is examined. The system consists of m parallel servers with different, in general, processing rates. Arrivals are classified into two types: jobs that require service from a particular server and jobs that can be served by any one server. The latter are assigned to a server according to the decisions of a dispatcher. The dispatcher bases its decisions on information about the queue lengths in all servers and the assignment policy is deterministic and state dependent. Heuristic assignment policies can be constructed as follows: The dispatcher assigns a job to the server characterized, at the time of its arrival, by the largest value of a certain decision function. Several decision functions are proposed and the performance of the corresponding system is determined for the case where there are two servers. In this case, an efficient numerical solution method can be developed.	en
heal.publisher	North-Holland, Amsterdam, Neth	en
heal.journalName	[No source information available]	en
dc.identifier.spage	291	en
dc.identifier.epage	296	en