Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site philabs.UUCP
Path: utzoo!linus!philabs!jah
From: jah@philabs.UUCP (Julie Harazduk)
Newsgroups: net.flame
Subject: Re: Supermarket Flames!
Message-ID: <27427@philabs.UUCP>
Date: Fri, 17-Feb-84 08:33:24 EST
Article-I.D.: philabs.27427
Posted: Fri Feb 17 08:33:24 1984
Date-Received: Sat, 18-Feb-84 05:52:18 EST
References: <170@ihu1g.UUCP>, <785@ihuxi.UUCP> <3507@utzoo.UUCP>, <6873@mgweed.UUCP>
Organization: Philips Labs, Briarcliff Manor, NY
Lines: 7

Actually, it's unnecessary to use queuing theory for the supermarket line
problem.  Just consider hashing tables.  People choose lines randomly.  If
you approximate the number of buckets to equally distribute people waiting
(adding more lines for express) then the time spent waiting will be minimized.

			jah (...{!seismo!ucdvax!decvax...}!philabs!jah