198 results about "Queue number" patented technology

A system for service queue management is disclosed including a terminal controlled by the system having a processing platform to generate service queue information for a user, and a mechanism for the user to request or receive the service queue information. The processing platform preferably transmits promotions related to goods and services associated with the service queue information to a user. The mechanism for the user to request or receive service queue information may preferably include a user's mobile communications device or a manually-activated device located on the terminal. Service queue information may include a queue number, next queue number to be issued, estimated wait time for service, a predicted time of service, time of issuance of ticket, predicted queue-waiting time, marketing messages, instructions for use of said ticket dispenser, and average queue-waiting time.

An advertising placement processing method and system enabling the information placement application process to be accomplished over the Internet, the system being a system for placing various information, including advertisements, introductions, event announcements, help wanted ads, looking to buy notices, announcements, and requests for assistance, on receipts issued from a POS terminal, vouchers issued by a kiosk terminal, and queuing number tickets issued from queuing number issuing devices in banks, for example. Information relating to the advertising application, advertising information, and advertising fee payment information is sent from a client PC via the Internet to a server system; the server system calculates fee information according to the received advertising information, and sends it via the Internet to the client PC. After confirming completion of the payment process, the server system sends the advertising information to a central system, and the central system distributes the received advertising information to the plural POS systems connected to the central system. A store POS system that receives the advertising information prints the advertising information together with the transaction information for the purchased products on the receipt issued during the customer purchase transaction process.

A Segment Interface Program (SIP) is disclosed that enables a user to choose locations in other applications to receive segments, and to mark segments for manual or automatic transmission to those applications. The SIP comprises an Application Interface Program (AIP), a Segment Creator Program (SCP), a Segment Queue Program (SQP), and a Segment Delivery Program (SDP). The SIP accesses a Rules database, a codes database, and a queue database. The AIP enables a user to select a location in an application and assign an application code and a location code to the location. The SCP enables a user to select a segment in a chat transcript, assign an application code and a location code to the segment, and send the segment to the SQP. The SQP receives the segment, assigns a queue number, and places the segment in a queue table. The SDP reads the user code, the application code and, when the application is active, sends the segment to the location in the application with the corresponding code. A single segment may be inserted into an application in multiple locations by creating additional codes for multiple instances of a location.

The invention discloses a realizing method for NVME protocol multi-command queues. The method includes the steps that commands and queue information of the command queues are stored separately; uniform command storage caches are set to store the concrete commands corresponding to elements of all the command queues and queue numbers corresponding to the commands; a queue information table is set to store the queue information of all the queues existing at the Host end at present; when an SSD controller executes the concrete commands according to the sequence, the corresponding queue information is searched for from the queue information table according to the queue numbers corresponding to the concrete commands. The invention discloses a realizing system for the NVME protocol multi-command queues. As the commands are actively read from the command queues at the Host end, the uniform command storage areas are opened up in the controller to store the commands, and the command queue information is obtained by searching the table when the commands are executed; the realizing method has the advantages that few storage resources are consumed when one item of command queue support is added to a control chip, a large number of command queues can be supported, and IOPS can be improved greatly.

The invention discloses a method for window service industry service lobby real-time interactive service rapid transaction. The method comprises the steps that a service transaction terminal is obtained, a required service type is selected, a user is prompted to show certificates needed for service transaction, an electronic service application form is filled through the service transaction terminal, the electronic service application form filled by the user is checked by a server, the electronic service application form is submitted to a service lobby comprehensive system, meanwhile, a queue number is generated, the relevant certificates are submitted by the user, the user signs and confirms the printed service application form so that a window operator can check and confirm the service application form, and thus service transaction is completed. The method for window service industry service lobby real-time interactive service rapid transaction has the advantages of being rapid in service transaction, capable of improving the transaction efficiency of the window operator and reducing the labor intensity of the window operator and the like. Therefore, the method for window service industry service lobby real-time interactive service rapid transaction can be widely used in various window service industries such as service lobbies of banks, telecommunication and government relevant departments. The invention further discloses a system for window service industry service lobby real-time interactive service rapid transaction.

The invention discloses a method and system for dynamically adjusting an allocation threshold value of output port resources. The method comprises the following steps of: allocating an abandon threshold value group and a mapped service area to each output port or queue; mapping a corresponding service area number according to a port number or a queue number of output identification information; counting the number of cache units occupied by a current data packet; determining the congestion degree of a current cache service area according to the number of the cache units occupied by the current data packet; selecting an abandon threshold value matched with the congestion degree from the abandon threshold value group according to the current congestion degree; and deciding to perform corresponding abandon operation on the current data packet according to the selected abandon threshold value. By the method and the system, the abandon threshold values of the output ports can be adjusted dynamically according to the congestion degree of the cache service area, so cached resource sharing of all theoutput network ports can be adjusted and controlled rationally.

A multi-queue FIFO memory device that uses existing pins of the device to load a desired number of queues (N) into a queue number register is provided. The queue number register is coupled to a queue size look-up table (LUT), which provides a queue size value in response to the contents of the queue number register. The queue size value indicates the amount of memory (e.g., the number of memory blocks) to be included in each of the N queues. The queue size value is provided to a queue start/end address generator, which automatically generates the start and end address associated with each queue in response to the queue size value. These start and end addresses are stored in queue address register files, which enable proper memory read/write and flag counter operations.

The embodiment of the invention provides a credit scheduling method and device and a bypass device for solving a linear speed of a packet. The method comprises the following steps of: receiving a queue number and a packet length value of a data packet entering a queue corresponding to the queue number; increasing the packet length value to a length value of the queen corresponding to the queue number to obtain an updated queue length value; judging whether the difference value between the updated queue length value of the queue and a current token credit of the queue is larger than zero, if so, applying scheduling, or non applying the scheduling; allocating the credit which does not exceed the updated queue length value to the queue when the scheduling is not applied; and removing the credit allocated to the queue already from the updated queue length value and the current credit. By virtue of the method, a situation of scheduler idling caused by allocating no necessary scheduling to the queue with a remaining credit by a scheduler is avoided, and linear speed is favorably reached at an outlet in a packet occasion. Moreover, bandwidth resources of the credit scheduler are saved, and more reasonable and efficient scheduling is realized.

The embodiment of the invention provides a prediction method of waiting time of passengers in a pickup region of taxis and a device. The method comprises steps of acquiring queuing information of passengers in the pickup region of the taxis and the number of the taxis of a waiting place; determining whether the number of the waiting passengers is smaller than or equal to the passenger carrying ability of the taxis in the waiting place, wherein the passenger carrying ability of the taxis in the waiting place is equal to the product of the number of the taxis of a waiting place and the average passenger carrying quantity of the taxis; and if the number of the waiting passengers is smaller than or equal to the passenger carrying ability of the taxis in the waiting place, determining the waiting time of the passengers according to average getting up time and the queuing information of the passengers. According to the invention, by acquiring the data of queuing number of passengers in the current waiting place and the number of the taxis in a parking lot, and combining factors of the number of released vehicles, the average passenger carrying quantity of the taxis and the average service time of the taxis, the waiting time of the passengers in the pickup region of the taxis is predicted, the current situation of aimless queuing and waiting of the passengers is changed and passengers waiting in the pickup region are allowed to timely adjust own journeys according to the waiting time.

The embodiment of the invention discloses a message dispatching method and a device thereof and relates to the field of communication, the utilization rate of data cache can be raised, and resources are saved. The method comprises the following step: (1) the message dispatching device receives a message and stores the message into internal package cache, the message information is extracted and queue entering request information is generated, and the queue entering request information comprises a queue number and a message length; (2) the corresponding queue descriptor is read from a stored queue descriptor list according to the queue number; (3) whether a packet is lost or not is judged according to the queue descriptor, and if a judgment result is that the packet is lost, first queue entering request response information is generated according to the data length, the message length and the unit space size of a queue tail message descriptor in the queue message descriptor; (4) the message is written into an external memory according to the first queue entering response information, queue entering information is generated, and the message enters the queue according to the queue entering information. The message dispatching method and the device are used for the message dispatching.

The invention discloses a queuing number calling method and a number call server. The queuing number calling method comprises the following steps: acquiring position information of a terminal through the number call server, wherein people can queue and log in through by using the terminal through the number call server; according to the position information of the terminal, confirming a first time that the terminal reaches the number call server; according to the queuing row information of the number call server and the queuing logging information of the terminal, confirming a second time for queuing through the terminal; comparing the first time and the second time, if the difference of the first time and the second time is smaller than a first set threshold, transmitting prompting information to the terminal through the number call server. Therefore, when a user leaves a shop, inform messages can be transmitted to the user through the terminal carried by the user according to the position information of the terminal of the user, and thus the user can be prompted in time.

The invention provides a queuing management system and method, transmitting queuing information to a queuing server or making the queuing server directly obtain the queuing information from the existing queuing system; a user connects to the queuing server by cellphone through wireless netork and Internet and inquires about the queuing information any time and any place, so as to be able to inquire the queuing information in advance and determine whether to go for trade; the user can remotely apply for a queuing number; the user can set prompting conditions so that when the appointed conditions occur, it actively prompt the user. And it can reduce user's waiting time and raise working efficiency.

An electronic queue management system for implementation on a chip. The queue management system comprises a plurality of primitive queue elements each including a register for a next-pointer and a register for a queue number. The next-pointer values may be selected via a register input and can be fed out via a registered output. Such queue elements are associated with a respective entry in a central array which stores the data belonging to the actual request. The separation of the data array and queue elements facilitates queue management as the data amounts are quite large compared to the small amount of data being required for the pre logic of the queue management system. Multiple add requests and multiple remove requests operations for different queue elements may be concurrently achieved in a single cycle.

This invention belongs to network business flow management field, wherein it uses a physical storage device RAM to maintain the CAM and realize dynamic-share-logic FPGA/ASIC; the RAM can buffer data grouping, the CAM can store and lookup the mapping relation between active business flow and physical sequence, and a FPGA/ASIC part included a write module/ RAM manage module/scheduler module/lookup module realizes the dynamic share. This invention can reduce required queue number to less than 1% of total number, and decreases the cost and power consumption less than 6.5% of normal method.

The invention discloses a queue scheduling method based on a timer and MDRR, which is based on a differentiated service model and is mainly composed of three parts of a Time timer, a real-time weight updating algorithm a modified weighted round robin (MDRR) scheduling algorithm, wherein the Time timer is mainly used for controlling the scheduling of a high priority queue, ensures that the queue can obtain higher service quality and ensures fairness in the network; according to the real time situation of the data flow in the queue, the weight parameter in the MDRR scheduling algorithm can be dynamically changed; and when service amount is overlarge, the weight is properly enlarged to ensure effect on other queues is lowered to the minimum. The method realizes the scheduling with configurable support queue number and adjustable rate, and has good expandability and simple operation.

The invention relates to a queue call system and a relative method, wherein it transmits the queue message to the queue server, or the queue server directly obtains queue message from present queue system; the user uses telephone, via wireless network and internet, to connect the queue server, to use mobile phone to inquire the queue message, or inquire the queue message first to decide trade or not; the user can remotely quest queue number; the user can set the prompt condition, to actively prompt the user when the condition is reached. The invention can reduce the wait time of user and improve the working efficiency.

The invention provides a queuing method, a client and a server. The method comprises the following steps: receiving an acquiring request of service information of each service website, which is sent by the client; sending the service information of each service website to the client according to the acquiring request, wherein the service information comprises queuing number of people; receiving a queuing request sent by the client after a queuing service website is determined according to the service information, wherein the queuing request comprises a mark for determining the queuing service website; generating a first queuing number according to the queuing request and sending the first queuing number to the client, wherein the first queuing number is the queuing number of the determined queuing service website. With the adoption of the manner, the service websites can be conveniently and reasonably selected by a user and the waiting time for users to queue is shortened.

The invention relates to a visiting technology of the multinuclear processor system to the shared resource. It can improve the efficient when the multinuclear processor operates the alignment concurrently. The multinuclear can reach the operation of the in/out same queue by the automatic queue number device. The every nuclear reads the value of the register of the in-queue number to make sure the array location and judge the relation of the in-queue number and the out-queue number. If it accords to the correlation, the in-queue operation is done to the queue array, at the same time the automatic queue number device will add one digit to the present register; if not, the alarm will be returned to the present nuclear. The performance of treating the system by the multinuclear has improved greatly. The need of the hardware is low and simple and cost the source of the hardware little.

The invention discloses a restaurant queuing management method and a restaurant queuing management system. A user can acquire queuing number through Wechat and short message. The system can judge if the user is an old customer of the restaurant according to the customer's Wechat and short message. After the user acquires the queuing number, the system can speculate the predicted queuing waiting time of the user and send it to the user by combining with history dinning time data in a database according to the queuing number in front of the user and dinning status of customers in the restaurant.Through collecting user information, the system can judge if the user is an old user, and recommend a menu for the user according to the previous user information, thereby saving user time. Meanwhile, the system can speculate the predicted queuing waiting time of the user according to the customer flow information, customer order and dinning information in the past. Besides, the system counts thelatest dinning status in real time and amends the predicted queuing time, thus the user can acquire the most exact queuing time and the user experience is improved.

The invention discloses a request processing method, a server and a computer readable storage medium. The method comprises the steps that through created multiple receiving threads, multiple reading request threads and multiple task processing threads, connection requests sent by clients are sequentially monitored, read and processed in parallel; and through created multiple sending threads, messages obtained after processing are sent to the clients in parallel, wherein queue numbers of connection queues where the monitored connection requests are stored are mod (values of source socket descriptors of the connection requests and the number of the reading request threads), and queue numbers of sending queues where the messages obtained after processing are stored are mod (the values of thesource socket descriptors of the connection requests and the number of the sending threads). Through the scheme, unnecessary waiting is not needed among the threads, queue locking is not needed, therefore, response time of the server is shortened, and the throughput of the server is improved.

A forwarding table 7 where a next transmission queue is registered is sequentially transferred within a queue chain 30 as a group of queues 131. If a priority of a queue to which the forwarding table 7 is transferred is higher than that of a queue registered in the forwarding table 7 as a next transmission queue, a next transmission queue number or the like is updated. Further, an arbiter 8 outputs a transmission command to a queue registered as the next transmission queue in the forwarding table 7 which has been transferred through all the queues, to transmit the next data frame from the queue having the highest priority. By this arrangement, it is possible to determine data frame transmission priorities among plural queues easily and efficiently while insuring a minimum guaranteed rate defined in each queue.

The invention discloses a method for evenly controlling the running of cooling fan in convertor dust removal flue, the control method comprises the steps of: orderly starting up engines in a state of standby in the queue from the minimum queue number to the end of the queue and leading the engines to the running state, when the temperature in the cooling flue raises and the engines are in need of starting-up; shutting down the running engines from the head of running queue, enabling the end of queue entering the queue to become a new end of queue and leading the engines to the standby state, when the temperature in the cooling flue drops and the engines are in need of shutdown. The invention automatically controls the engines according to the principal first-startup-first-shutdown, the engine running in a long time has the priority of shutdown so that each engine runs evenly; under the condition of fluctuating interval temperature, each engine can averagely share the times of startup and shutdown, which can prolong the service life of the apparatus and improve the dependability. The invention can be suitable for the apparatus including other controlled objects in need of adjustment and using a plurality of engines.