JPH0731698B2 - Data processing system - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a data processing system in which a plurality of data processing devices are connected via a line.

[Prior Art] In recent years, in a large store or the like, a data processing device installed in each sales floor, for example, a slave-side ECR (electronic cash register) is inline to a predetermined data processing device, for example, a master-side ECR. A data processing system is adopted in which the master side collects sales data transmitted from each slave side. In some of such data processing systems, the master side has a schedule function of collecting data of each slave side when a predetermined time is reached. That is, for example, if the command file number "1" is set to collect the adjustment data and inspection data of all slaves from the inline to the master side at the execution time "15:00", the set time will be reached. The collection is performed.

[Problems to be Solved by the Invention] However, in the data processing system having the schedule function as described above, the schedule function is surely executed at the predetermined time even when the master side is in the registration mode. However, since registration is prohibited during that time, there is a problem that the waiting time of customers becomes longer when a large number of customers are waiting for registration.

Further, if the customer registration is prioritized, the collection by the schedule function will not be accurately executed at the set predetermined time.

An object of the present invention is to allow collection by, for example, a schedule function or the like to be executed by another data processing device instead of a predetermined data processing device.

[Means for Solving the Problems] Means of the present invention are as follows.

A data processing system in which a plurality of data processing devices having a collecting function are connected via a line, and the means provided in the predetermined data processing device are as follows.

The instruction means gives an instruction to execute the collection function.

The first discriminating unit discriminates whether or not the processing by the collecting function can be executed when the execution of the collecting function is instructed by the instructing unit.

The first instructing means designates another data processing device connected via the line when the determining means determines that the processing by the collecting function cannot be executed.

Further, the following means are provided in the other data processing device.

The second determination means determines whether or not the processing by the collecting function can be executed when the execution of the processing by the collecting function is instructed by the predetermined data processing device.

The second designating means designates yet another data processing device connected via the line when the second discriminating means discriminates that the processing by the collecting function cannot be executed. .

When the data processing device specified by the second specifying means cannot execute the process by the collecting function,
The data processing devices are sequentially designated so that the data processing device capable of executing the processing by the collecting function can execute the processing by the collecting function.

[Operation of Means for Solving the Problem] The operation of the means of the present invention is as follows.

A data processing system in which a plurality of data processing devices having a collection function are connected via a line, and the predetermined data processing device is configured to instruct execution of the collection function by an instruction means such as a schedule function. The first determining means determines whether or not the processing by the collecting function can be executed, and when the determining means determines that the processing by the collecting function cannot be executed, the line Another data processing device connected via the is designated by the first designating means.

Further, the other data processing device determines whether or not the process by the collecting function can be executed by the second determining means when the predetermined data processing device instructs to execute the process by the collecting function. However, when it is determined by the second determining means that the processing by the collecting function cannot be executed, the second specifying means specifies the further data processing device connected via the line. To do.

When the data processing device designated by the second designating unit cannot execute the processing by the collecting function, the data processing devices are sequentially designated and the processing by the collecting function can be executed. Then, the processing by the collection function is executed.

Therefore, it is possible to surely execute the collection without unnecessarily executing the collection.

[Example] An example will be specifically described below.

Configuration of Embodiment FIG. 2 is a schematic configuration diagram of a data transmission system. In the figure, 1 is a master side ECR that works as a normal master, and this master side ECR1 is connected to a plurality of slave side ECRs 3 ...
Data can be sent and received between R1, 3 ... In this embodiment, the ECR1 on the master side and the ECR3 on the slave side are configured to be capable of functioning as a master or a slave, respectively.

The master side ECR1 is constructed as shown in FIG. In the input section 11 of this ECR1, in addition to the number keys KA for inputting the amount of money and various function keys KB on the keyboard, it is operated when many customers are registered.
BUSY key KC, date / time input key KD used to set schedule setting date / time, cash / deposit key KE, PLU (price look up) key KF, clear key KG, lending key KH is provided. On the keyboard of the input section 11, a rotary mode selector switch MS
Is provided. This mode changeover switch MS has "setting", "registration", "power off",
It switches to each mode of "inspection" and "payment". Further, on the keyboard of the input unit 11, a schedule start display lamp LP for notifying the start of the schedule function is provided, and further, a slide switch type master / slave changeover switch M / S is provided. The master / slave selector switch M / S functions as a master or a slave depending on its switching position "M (master)" or "S (slave)". Therefore, the key input signal output from the input unit 11 corresponding to the operation key or the mode designation signal output according to the switching position of the mode changeover switch MS and the master / slave changeover switch M / S is the CPU (central processing unit). Processing circuit) 12.

The CPU 12 controls various operations according to a pre-stored microprogram, for example, input processing,
Registration processing, data transmission processing, data collection processing, etc. are executed. Further, the CPU 12 is configured to have an arithmetic unit and a control unit in addition to A, B, C, D, E and registers used for register numbers and arithmetic operations. Then, the CPU 12 exchanges data with the RAM (random access memory) 13.
Accumulates various data in RAM13, controls the opening operation of drawer 14, digitally displays sales data on display unit (fluorescent display tube, etc.) 15, and drives printing unit (thermal printer, etc.) 16. Then, the sales data is printed on the receipt paper and the journal paper, and the current time is read from the clock circuit unit 17.

RAM13 is a data read and write operations are controlled under the control of the CPU12, total memory M1 by PLU, total memory M2 by transaction, other total memory M3, other preset content storage unit M4, Schedule time storage
M5, a machine number storage unit M6 for storing the machine number of another ECR to which the schedule contents should be transferred is provided. The schedule content storage unit M4 and the schedule time storage unit M5 can store a plurality of schedule contents and times.

FIG. 1 (B) shows the configuration of the slave side ECR3 .... Since the slave side ECR3 of this embodiment is configured to be capable of functioning as a master, the slave side ECR3 has substantially the same configuration as the master side ECR1. . In addition,
The slave side ECR 3 is not provided with a clock circuit section, and the RAM 13 is not provided with a schedule content storage section and a schedule time storage section.

Operation of the Embodiment FIG. 3 is a flow chart in which the master side ECR1 starts execution by interruption every fixed time, specifically every second.
First, when this flow is entered, the schedule times corresponding to a plurality of preset schedule contents are sequentially read from the RAM 13, loaded into the B register in the CPU 12, and compared with the current time read from the clock circuit section 11 into the A register. , The match is detected (step S1). here,
If it does not match any of the schedule times, the interrupt process ends, but if it is detected that any of the schedule times matches, the process proceeds to step S2, and the schedule corresponding to the detected match schedule time. The contents are read from the RAM 13 and set in the D register of the CPU 12. Then, it is checked whether or not it is currently registered (step S3), and if it is not registered, the schedule disclosure display lamp LP for clearly indicating the start of the schedule is turned on (step S4). This allows the cashier to confirm that the scheduled time has come, but when there are many customers and registration is busy, the BUSY key KC is operated. In this case, press the BUSY key
Since the BUSY input code is set, in the next step S5 the presence or absence of the operation of the BUSY key is checked according to the contents of the C register, but if it is not operated, a fixed time (for example, 10 seconds) has passed since the scheduled time. Is checked (step S6). If a certain time has not passed,
Return to step S4. If the BUSY key is not operated within a certain time after the scheduled time, the schedule start display lamp LP is turned off (step S
7) After that, a process of collecting the schedule contents called to the D register, for example, adjustment data or inspection data of all slaves is executed (step S
8). When the execution of the schedule contents is finished, finally, an initialization process (step S9) for clearing each of A, B, C, D, E and the register is performed.

On the other hand, if it is detected that the registration is being performed in step S3 even if the schedule time has come, or that the BUSY key has been operated within a certain time after the schedule time has come in step S5, , (Step S10)
To the slave side corresponding to the machine number by reading the contents from the transfer machine number storage section M6 of RAM13.
Select ECR3 alternatively to transfer the schedule contents in the D register to that ECR. Here, the transfer machine number is determined in advance, and a plurality of slave side ECR3 ...
Specify one of them. When the schedule contents are transferred as described above, the contents of the A, B, C, and E registers except the D register are cleared (step S11). Therefore, in this case, the master side does not execute the schedule contents, one of the slave side ECRs is specified and the schedule contents are transmitted, and the E
Schedule right will be transferred to CR.

FIG. 4 is a flowchart executed by the ECR 3 on the slave side by an interrupt when the schedule contents are transmitted from other ECRs (including the ECR on the slave side). First, when entering this flow, it is checked whether or not it is currently registered (step S21). If you are not registered here,
It is checked whether the BUSY key is operated within a certain time after turning on the schedule start display lamp LP (step
S22, S23, S24). As a result, if the BUSY key is not operated within the fixed time, the schedule start display lamp LP is turned off (step S25). Then, the schedule contents are executed based on the contents of the A register in which the transferred schedule contents are stored (step S2
6) After that, the contents of the schedule, the machine number of this slave ECR and the execution end code of the schedule are transferred to the master side (step S27). And A,
The contents of the B and C registers are cleared respectively (step S2
8).

On the other hand, even if the schedule contents are transmitted from another ECR, if it is currently registered or if the BUSY key is operated within a certain time, that is detected in steps S21 and S23, and the process proceeds to step S29. Go to the contents of register A (transferred schedule contents) and contents of register B (RAM13
Transfer to another ECR specified by the schedule contents transfer machine number read from. And step S
At 28, the contents of the A, B and C registers are cleared respectively. Therefore, in this case, even if the schedule execution right is transferred from the master side ECR1, the schedule contents are not executed in the ECR, and the schedule contents are transferred to another ECR by designating another ECR and the schedule execution is executed. The right is further transferred to the next slave side ECR3. In this way, the slave side ECR3 …… is sequentially specified and is it being registered?
Check if there is BUSY input, and as a result, BUSY
Only when there is no input, the schedule contents will be executed in that ECR, but when all slave side ECR3 ... are registered or BUSY input exists, the master side ECR1 is specified in the last specified slave side ECR3. Then, the schedule contents are transferred, and the schedule contents are restored.

Figure 5 shows that in the ECR1 on the master side, when the schedule contents are transferred from the slave side and returned, or when the schedule is executed on the slave side, the schedule contents, machine number, and execution end code are respectively transferred from the slave side. It is a flowchart in which execution is started by interruption when it comes. First, when this flow is entered, it is checked whether or not the schedule execution right is being transferred according to whether or not there is data in the D register (step S31). Now, if the contents of the schedule have already been executed on the master side, the contents of the D register have been cleared, so an error will occur, but if the schedule execution right is being transferred, is there an execution end code in the transmission data? In other words, it is checked whether or not the schedule contents have been executed in the slave side ECR3 (step S32). Now, assuming that the schedule contents have been executed on the slave side, step S3
Proceed to 3 and the schedule contents and machine number are printed and displayed respectively. This makes it possible to confirm in which ECR the schedule contents were executed. If it is determined in step S32 that there is no execution end code, the process proceeds to step S34 to check if registration is in progress, and if registration is in progress, a registration process (step S35) is executed to check whether registration is complete (step S36). ), If registration is not completed, step S35
Return to and wait until registration is complete. Then, if the registration is not in progress, or if the registration is completed, step S37.
Then, the schedule contents are executed based on the contents of the D register. Then, the contents of the D register (schedule contents) are cleared (step S38). Therefore, the schedule contents are not executed in all slave ECRs,
When the schedule contents are returned to the original master side, if the schedule contents are being registered, the schedule contents will be executed after the registration is completed. In this case, the schedule execution right is not transferred to the slave side.

As described above, in the present embodiment, basically, the schedule contents are executed on the master side, but in a specific case where the schedule contents cannot be executed, the schedule execution right is transferred to the slave side.
Here, in the specific case where it is not possible to do it even in the transferred slave ECR, this slave EC
Schedule execution right is transferred from R to other slave ECRs. In this way, the schedule execution right is sequentially transferred to the slave side ECR, and when the slave side ECR in the executable state is searched, the schedule is executed by the ECR. Therefore, the schedule content can be executed without causing the customer to wait, and at the set time, it will be executed at that time as much as possible.

In the above embodiment, when the schedule contents are transferred to all the slave side ECRs and then returned to the original master side ECR, the schedule contents are not further transferred to the slave side. However, the contents of the schedule may be cyclically transferred until the schedule is executed. Alternatively, the master side may sequentially specify the slave side to inquire whether or not the schedule can be executed.

Further, the time when the schedule is executed may be stored in correspondence with the scheduled time.

Furthermore, when the slave side executes the schedule contents, the slave side schedule contents (collected data, etc.)
Instead of being printed, it may be transmitted to the master side and printed by the master side.

Moreover, although the schedule contents are automatically executed at the set time in the above embodiment, the execution of the schedule contents may be instructed by key input on the master side.

[Effects of the Invention] According to the present invention, for example, when a customer is busy waiting such as a schedule function or the like, collection can be performed by another data processing device instead of the predetermined data processing device. Even if the user is busy, it is possible to surely execute the collection by the schedule function or the like without unnecessary execution by the predetermined data processing device.

[Brief description of drawings]

The drawings show embodiments, FIG. 1 (A) is a block circuit diagram of a master side ECR of a data transmission system, FIG. 1 (B) is a block circuit diagram of a slave side ECR, and FIG. 2 is a data transmission system configuration diagram. , Fig. 3 is a flow chart executed by the master side ECR by interruption at regular intervals, Fig. 4 is a flow chart executed by interruption when the slave side ECR receives specific data, and Fig. 5 is a master side ECR.
6 is a flowchart executed by interruption when specific data is received in. 1 …… Master side ECR, 3 …… Slave side ECR, 12 …… CP
U, 13 ... RAM.

Claims (1)

[Claims] 1. A data processing system in which a plurality of data processing devices having a collection function are connected via a line, wherein the predetermined data processing device comprises an instruction means for instructing execution of the collection function. When the instruction means instructs the execution of the collection function, the first determination means determines whether or not the processing by the collection function can be executed, and the processing by the collection function by the determination means. A first designating unit for designating another data processing device connected via the line when it is determined that the data processing device cannot be executed. A second discriminating unit that discriminates whether or not the process by the collecting function can be executed when the data processing device instructs to execute the process by the collecting function; A second designating means for designating yet another data processing device connected through the line when it is determined that the processing by the collecting function cannot be executed; When the data processing device designated by the means cannot execute the processing by the collecting function, the data processing device capable of executing the processing by the collecting function by sequentially designating the data processing devices A data processing system characterized by being executed.