《基于单片机的银行排队系统翻译》由会员分享，可在线阅读，更多相关《基于单片机的银行排队系统翻译（5页珍藏版）》请在金锄头文库上搜索。
1、Bank Queuing System Based on single chip microcomputerAbstractQueuing is the process of moving customers in aspecific sequence to a specific service according to the customerneed. The term scheduling stands for the process of computing aschedule. This may be done by a queuing based scheduler.This pa
2、per focuses on the banks lines system, the differentqueuing algorithms that are used in banks to serve the customers,and the average waiting time. The aim of this paper is to buildautomatic queuing system for organizing the banks queuingsystem that can analyses the queue status and take decision whi
3、chcustomer to serve. The new queuing architecture model canswitch between different scheduling algorithms according to thetesting results and the factor of the average waiting time. Themain innovation of this work concerns the modeling of theaverage waiting time is taken into processing, in addition
4、 with theprocess of switching to the scheduling algorithm that gives thebest average waiting time.I. INTRODUCTIONToday banks are one of the most important units of thepublic. Since the foundational work of banks, manyresearchers try to get full advantage of any new technology toincrease customer sat
5、isfaction. Therefore an active researchhas focused on analyzing the queues to optimize theiroperations and to reduce waiting time for customers 1,2,3.This paper focuses on the bank lines system and thedifferent queuing algorithms that used in banks to serve thecustomers. Most banks used standard que
6、uing models. Toavoid standing in a queue for a long time or in a wrong line,most banks use automatic queue system to give tickets to allcustomers. The customer can push a specific button in a ticketssupplier device according to their needs.The aim of this paper is to decrease customers waiting timeb
7、y building a homogenous way that analyze the queue statusand take decisions about which customer to serve by using theappropriate scheduling algorithm.The rest of this paper is organized as follows. Section 2consists of queuing systems characteristics, most commonscheduling algorithms, and the queue
8、 models. Then ourproposed queuing system model is shown in section 3.Experimental results are shown in section 4, followed by briefconclusions and suggestions for future work are shown insection 5. II. QUEUING SYSTEMSA queuing system consists of one or more servers thatprovide service to arriving cu
9、stomers. The population of customers may be finite or infinite .The arrival processdescribes how customers enter the system. The customersarrive to the service center in a random fashion.Queue represents a certain number of customers waitingfor service. The capacity of a queue is either limited orun
10、limited. Bank is an example of unlimited queue length.The service is an activity requested by a customer, whereeach service takes a specific time. The scheduling algorithm isused to order the customers and to choose the next customerfrom the queue. The most common scheduling algorithms area) FCFS (F
11、irst Come First Serve): The customers are:served in the order of their arrival, which is most visibly fairbecause all customers think of themselves as equal.b) RSS (Random Selection for Service): In thisalgorithm, customers are selected for service at random, soeach customer in the queue has the sam
12、e probability of beingselected for service irrespective of his/her arrival in theservice system.c) PRI (Priority Service): The customers are grouped inpriority classes according to some external factors. Thecustomer with the highest priority is served first.d) SPF (Shortest Processed First): The alg
13、orithmassumes that the service times are known in advance. Whenseveral customers are waiting in the queue, the SPF algorithmpicks the shortest service time first.The departure represents the way customers leave thesystem.In queuing system, there are many types of queue modelssuch as :a) SQ (Single Q
14、ueue): In this model each customerwaits till the service point is ready to take him for servicing.b) MQ (Multiple Queues): In this model each customertries to choose the shortest queue from a number of individualqueues.c) DQ (Diffuse Queue): In this model each customertake a ticket from a ticket mac
15、hine with single or multiplebuttons each for specific service. After the customer registershis/her place in the queue by a ticket he/she will monitor theticket number being served. The customers can not estimatewhen they will be served.III. THE PROPOSED QUEUING SYSTEM MODELWe know present a new tech
16、nique for queue managementsystem in banks. Our technique is to builds an automaticqueuing system that can test the status of the queuing systemsuch as DQ and choose the appropriate algorithm among morethan one scheduling algorithms that already defined in thesystem such as FCFS and SPF to select the next customer
