基于单片机的银行排队系统翻译

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

17、 next customer tobe served during a specific period of time.selecting the scheduling algorithm depends on the testingresults to achieve the best waiting time for all the availablecustomers that are waiting to be served.to achieve this goal we add additional components to thetraditional queuing manag

18、ement system .the suggested queuing system consists of the following components:a) customer areab) queuing areac) testing aread) scheduling algorithmse) service areaiv. experimental resultssimulations were carried to test the performance of thenew proposed system. a database of two standard scheduli

19、ngalgorithms was developed to systematically evaluate theproposed system. for the purpose of illustrations, acomparison between the new system and the ordinary system(fcfs) that is used usually in most of the banks queuingsystems.in the proposed system, two scheduling algorithms areused (fcfs, spf).

20、 for the purpose of calculation and reality arandom number generation is used to generate a sequence ofcustomers arrival time and to choose randomly between threedifferent services: open an account, transaction, and balance,with different period of time for each service: 15, 10, and 5respectively.th

21、e proposed system will test the queuing system usingtesting algorithm every specific period of time, lets concederit 15 time unit, to select the appropriate scheduling algorithm.the new queuing system calculates the waiting time foreach customer, then calculates the total waiting time and theaverage

22、 waiting time according to the two algorithms (fcfs,待添加的隐藏文字内容3spf) each 15 time unit, it can switchbetween the two algorithms at the end of the time unit by selecting the algorithm with the minimum average waitingtime.through the extensive experiments conducted, the primarygoal is to determine the

23、ability of the new queuing systemagainst the ordinary queuing systemv. conclusion and future workin a queue system, the balance between dealing with allcustomers fairly and the performance of the system is veryimportant. sometimes the performance of the system is moreimportant than dealing with the

24、customers fairly.in this paper, we have presented a new technique forqueuing system called automatic queuing system. theproposed technique showed improvements in average waitingtime.it will be more effect to add more factors in testing to takethe right decision for choosing one of the available sche

25、dulingalgorithms, such as throughput, utilization, and response time.also adding more scheduling algorithms to the systemdatabase will be useful.基于单片机的银行排队系统 摘要：排队是一种程序根据顾客的需求来让顾客从特定的顺序到特定的服务，这个长期计划以处理一个计划的过程为标准。这可能是被一个排队程序机完成。这篇文章以银行排队系统为焦点，不同的排队方法被应用到银行为顾客服务，还有平均等待时间。这篇文章的目的在于建立一个自动排队系统，能够分析排队情形并决

26、定哪个顾客接受服务。新的排队体系结构模式能在不同调度算法中转换根据测试结果和平均等待时间的因素。这个产品主要创新的平均等待时间模式被纳入了进程，此外调度算法的转换会给出最佳的平均等待时间。1 简介现在银行在公共场合中是最重要的部分之一。自从有了这银行的基础产品，很多研究人员使者试着得到任何新技术的优势来增加顾客的满意度。因此有一个有效的研究已经着力排队可以优化他们的运营和减少顾客的等待时间。很多银行使用的是标准的排队模式。为了避免站很久时间排队或站在错误的队列里，很多银行使用自动排队系统来给所有的顾客提供票。顾客能在给票的机器上按下特定的按钮根据他们的需求。这篇文章的目标在于减少顾客的等待时间

27、通过建立一个同种的通道来分析排队情形并且决定哪个顾客接受服务。其余本文的组织如下：第二节，包括排队系统的特点，最常见的调度算法和排队模式。我们提到的排队系统在第三节。试验结果在第四节，其次是对未来工作的结论和建议在第五节。2. 排队系统 一个排队系统由一个或者很多个能够给顾客提供服务的服务器组成。顾客的数量可能是有限的或者无限的。到达程序描述了顾客怎样进入系统。顾客到达服务中心是随时改变的。一条队伍的数量不是有限的就是无限的，银行就是一个无限队长的例子。这种服务对于顾客来说是一个活动的请求，每种服务都有固定的时间。调度算法就是用来排好顾客的顺序然后从队伍中选出下一个顾客。最常见的调度算法有： （一）fcfs（先到先服务）：顾客根据他们的顺序接受服务，这是最明显的公平因为顾客认为自己是平等的。（二）rss（的随机选择服务）：在这调度中，顾客是被随即选择服务的，所以每个顾客在排队具有相同的概率是选择服务，不论他/她到达的服务系统。（三）pri（优先服务）：客户分组优先等级根据一些外部因素。本顾客的最高优先服务第一。 在排队系统中，有很多种队伍模型比如： （一）sq（单队列）：在这个模型中每个客户等到服务点准备带他服务。（二）mq（多个队列