KR20140009733A - Rfid task scheduling device and task scheduling method - Google Patents

Rfid task scheduling device and task scheduling method Download PDF

Info

Publication number
KR20140009733A
KR20140009733A KR1020120076285A KR20120076285A KR20140009733A KR 20140009733 A KR20140009733 A KR 20140009733A KR 1020120076285 A KR1020120076285 A KR 1020120076285A KR 20120076285 A KR20120076285 A KR 20120076285A KR 20140009733 A KR20140009733 A KR 20140009733A
Authority
KR
South Korea
Prior art keywords
task
tasks
highest priority
write
rfid
Prior art date
Application number
KR1020120076285A
Other languages
Korean (ko)
Inventor
김지민
전기용
Original Assignee
삼성테크윈 주식회사
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 삼성테크윈 주식회사 filed Critical 삼성테크윈 주식회사
Priority to KR1020120076285A priority Critical patent/KR20140009733A/en
Publication of KR20140009733A publication Critical patent/KR20140009733A/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • G06K17/0003—Automatic card files incorporating selecting, conveying and possibly reading and/or writing operations
    • G06K17/0009—Automatic card files incorporating selecting, conveying and possibly reading and/or writing operations with sequential access selection of a record carrier from the card-file, e.g. relative movement between selecting device and card-file
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/067—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components
    • G06K19/07—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips
    • G06K19/0723—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips the record carrier comprising an arrangement for non-contact communication, e.g. wireless communication circuits on transponder cards, non-contact smart cards or RFIDs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Toxicology (AREA)
  • Health & Medical Sciences (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Computer Hardware Design (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Electromagnetism (AREA)
  • General Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

An embodiment of the present invention pertains to a device and a method for task scheduling, wherein the task scheduling method comprises the steps of: receiving the task from clients; converting the received task into a running ready state; determining a type of task that is currently running; transmitting a new task to the RFID reader depending on a variety of tasks having a highest priority from among the task that is currently running and the converted task into a running ready state. Therefore, the task scheduling device and method implements the RFID middleware by providing the task scheduling efficiently. [Reference numerals] (11) Reception unit; (12) Step change unit; (13) Scheduler; (14) Transmission unit

Description

Rfid task scheduling device and task scheduling method {RFID task scheduling device and task scheduling method}

Embodiments of the present invention relate to a task scheduling apparatus and a task scheduling method.

Radio frequency identification (RFID) middleware may be understood as relay software for performing a specific purpose between an RF device (RFID reader and RFID tag) and an application (client). In order to effectively implement such RFID middleware, writing tasks executing application level event (ALE) writing application programming interfaces (ALEs) need to have exclusive access to the RFID reader. In addition, since the ALE specification, which is an existing RFID middleware standard, does not consider scheduling ALE tasks, it is difficult to meet a deadline for tasks having a temporal constraint property.

Korea Patent Registration No. 10-0749818

SUMMARY An embodiment of the present invention is to provide an RFID task scheduling apparatus and a task scheduling method capable of effectively implementing an RFID middleware.

In order to solve the above technical problem, according to an aspect of the embodiments of the present invention, the step of receiving a task (task) from the client, the step of transitioning the received task to the ready to run, and the type of the ongoing task And transmitting a new task to the RFID reader according to the task having the highest priority among the tasks currently in progress and the tasks switched to the ready state.

According to another aspect of the present embodiment, when the task in progress is a writing task, the task having the highest priority may be transmitted to the RFID reader after the task in progress is finished.

According to another feature of the present embodiment, if the task currently in progress is a reading task and the task having the highest priority is a read task, the read has a higher priority than the write task having the highest priority before the end of the task currently in progress. The task can be sent to the RFID reader.

According to another feature of the present embodiment, when the task currently in progress is a read task and the task having the highest priority is a write task, the task having the highest priority may be transmitted to the RFID reader after the task in progress is finished.

According to another feature of this embodiment, the task scheduling method may be applied to the RFID middleware.

In order to solve the above technical problem, according to another aspect of the embodiments of the present invention, a task receiving unit for receiving a task (task) from the client, a step switching unit for switching the received task into a ready state, and the ongoing According to the type of the task and the task having the highest priority among the tasks that are switched to the ready state, including a scheduler for determining whether to send a new task to the RFID reader, and a transmitter for transmitting a new task to the RFID reader, Provides a task scheduling device.

According to another aspect of the present embodiment, if the task in progress is a writing task, the scheduler may transmit the task having the highest priority to the RFID reader after the task in progress is finished.

According to another feature of this embodiment, the scheduler has priority over the write task with the highest priority before the end of the currently in progress task if the task currently in progress is a reading task and the task with the highest priority is a read task. Can send a high read task to the RFID reader.

According to another feature of the present embodiment, if the task currently in progress is a read task and the task having the highest priority is a write task, the scheduler may transmit the task having the highest priority to the RFID reader after the task in progress is finished. have.

According to another feature of the present embodiment, the task scheduling apparatus may be applied to a server including an RFID middleware.

By the above configuration, it is possible to effectively implement the RFID middleware.

1 is a diagram schematically showing the configuration of an RFID system.
2 is a block diagram illustrating a configuration of a task scheduling apparatus according to an exemplary embodiment.
3 is a diagram illustrating a flow of tasks according to an exemplary embodiment.
4 is a flowchart illustrating a task scheduling method according to an exemplary embodiment.
FIG. 5 is a flowchart illustrating a method of transitioning a task to an execution state queue according to scheduling in FIG. 4.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. Referring to the accompanying drawings, the same or corresponding components are denoted by the same reference numerals, .

1 is a diagram schematically showing the configuration of an RFID system.

Referring to FIG. 1, the RFID system may include a task scheduling apparatus 1, a plurality of clients 2a to 2n, a plurality of RFID readers 3a to 3m, and a plurality of tags 4a to 4g.

The task scheduling apparatus 1 performs the RFID readers 3a to 3m so that the RFID readers 3a to 3m perform a reading task and a writing task in response to a request from the clients 2a to 2n. Send the command to In addition, the task scheduling apparatus 1 receives necessary data from the RFID readers 3a to 3m in response to a request of the clients 2a to 2n, and transmits the necessary data to the clients 2a to 2n.

RFID middleware is software that collects, filters, and summarizes the information of a large number of tags delivered from a plurality of heterogeneous RFID readers 3a to 3m into meaningful information and provides them to applications running on the clients 2a to 2n. The task scheduling apparatus 1 may be a device such as a server on which the RIFD middleware operating between the clients 2a to 2n and the RFID readers 3a to 3m is implemented. However, the task scheduling apparatus 1 is not limited to the server, and any apparatus capable of performing the above operation may be used.

On the other hand, the task scheduling apparatus 1 according to the present embodiment is the RFID reader (3a ~ 3m) for the reading task and the writing task received from the client (2a ~ 2n) or generated by the request In the transmission process, a task scheduling function of determining in which order to transmit each task is performed. A detailed implementation method of the task scheduling function will be described in more detail with reference to FIGS. 2 to 5.

The clients 2a to 2n receive data necessary for various applications from the RFID reader via the task scheduling apparatus 1 or record the data in the tag via the RFID reader.

The RFID readers 3a to 3m and the tags 4a to 4g are components of an RFID system that transmits and receives data to each other wirelessly. The tag 4a-4g data is read by the RFID readers 3a-3m, and the RFID readers 3a-3m write data to the tag at the request of the clients 2a-2n. The RFID readers 3a to 3m receive data from the tags 4a to 4g and transmit the received data to the task scheduling apparatus 1. Detailed descriptions of the RFID readers 3a to 3m and the tags 4a to 4g will be omitted.

2 is a block diagram showing the configuration of a task scheduling apparatus 1 according to an embodiment of the present invention. 3 is a diagram illustrating a flow of tasks according to an exemplary embodiment.

2 and 3, the task scheduling apparatus 1 may include a receiver 11, a step switcher 12, a scheduler 13, and a transmitter 14.

The receiver 11 receives a specific task to be performed by the RFID readers 3a to 3m from an application driven by the clients 2a to 2n. The specific task may be a read task and a write task.

The step switching unit 12 switches the received tasks to each step at an appropriate timing. The switching step may be a wait queue, a ready queue, a running queue, or the like. A wait state is a state in which a new task request has been received but not yet ready to run, or a running task is waiting for a specific event, or waiting for the next run after completing the current run. The ready state is a ready state for execution. Execution state is the state that executes the task as it is.

The task scheduling method of the scheduler 13 is as follows.

First, each symbol used to describe a task scheduling method is defined.

S: set of read and write tasks that are requested but not completed by clients 2a to 2n

ri : i-th read task

wi : i-th write task

Prio (): task priority

Sready : A set of all tasks ready to run

S r ready : A collection of read tasks ready to run as a subset of S ready .

S w ready : a subset of write tasks ready to run as a subset of S ready

r top : Highest priority read task in S r ready

w top : Highest priority write task in S r ready

S running : set of all running tasks

S r running : A set of read tasks running as a subset of S running

S w running : a subset of write tasks running as a subset of S running

(A write task is running when the S w is not an empty set because it can be executed concurrently with other tasks in a particular time S w is running only has only one write task.)

Scheduling by the scheduler 13 largely occurs when a new task is added to S ready or S running is empty. In more detail, situations in which scheduling may occur are as follows.

Case 1: Read tasks are running (S r running ≠

Figure pat00001
The scheduling algorithm is executed when another read task is inserted into the ready queue. However, if the write task is running, you do not need to reschedule other tasks. This is because, if a write task is running, other higher priority tasks cannot execute even if they are ready.

Case 2: If no task is running (S running =

Figure pat00002
When another read or write task is ready, the scheduling algorithm is executed.

Case 3: Scheduling occurs when the execution of all currently running tasks is completed. That is, S running =

Figure pat00003
If it is.

A more specific situation will be explained using an example.

S r ready = {r2, r3, r4}, S w ready = {w1, w2}

S r running = {r1}, S w running =

Figure pat00004
,

Prio (r1)> Prio (w1)> Prio (r2)> Prio (r3)> Prio (w2)> Prio (r4)

At this time, when two new tasks r5 and r6 arrive and are ready, S r ready = {r2, r3, r4, r5, r6}. If Prio (r5)> Prio (w1)> Prio (r6), the read task r5 can be executed immediately. Therefore, S r running = {r1, r5}.

When the execution of r1 and r5 is completed, the scheduler 13 selects w1 having the highest priority among S r ready and S w ready to execute the task. After the execution of w1 is completed, the scheduler 13 selects r2 and r3 to execute the task.

The transmitter 14 transmits the sequence of tasks inserted into the execution status queue to the corresponding RFID readers 3a to 3m in order. In this case, the transmitter 14 may transmit a task by designating only a specific RFID reader, or may transmit the task to the entire RFID readers 3a to 3m or to the group RFID readers 3a to 3m which may be configured in plurality.

4 is a flowchart illustrating a task scheduling method according to an exemplary embodiment.

Referring to FIG. 4, the receiver 11 determines whether a task has been received (S1), and when the task is received, the step switching unit 12 inserts the received task into a standby queue (S2).

The step switching unit 12 also transfers a task that satisfies the execution start condition from the standby queue to the ready queue (S3). When the execution condition of the scheduling algorithm is reached, the step switching unit 12 executes scheduling on the tasks in the ready queue ( S4).

The tasks are transferred to the execution status queue according to the scheduling result (S5), and the transmitter 14 transmits the tasks of the execution status queue to the RFID reader (S6).

5 is a flowchart illustrating a task scheduling method of the present invention. 5 illustrates step S5 of FIG. 4 in more detail.

Referring to FIG. 5, it is first determined whether there is a read task being executed (S51). If there is no read task being executed, it is determined whether there is a write task being executed (S54). If there is a write task running, the task scheduling is terminated because no additional task is executed.

On the other hand, if it is determined in step S54 that there is no write task being executed, it is determined whether a task having the highest priority, that is, the highest priority in the ready state queue is a read task (S55). If the highest priority task is not a read task, that is, if the highest priority task is a write task, the write task is transferred to the execution state queue so as to be in the running state (S56).

If it is determined that there is a read task being executed in step S51 or if it is determined in step S55 that the highest priority task is a read task, it is determined whether there is a read task having a higher priority than the write task having the highest priority among the write tasks in the ready state. (S52). If such a read task exists, all read tasks having a higher priority than the write task having the highest priority are transferred to the execution state queue so as to be in the execution state (S53). On the other hand, if such a read task does not exist, the task scheduling is terminated.

To effectively implement RFID middleware, write tasks that execute ALE writing APIs must have exclusive access to the RFID reader. In general, this requires a difficult and complex locking mechanism to be used. In this process, a problem such as deadlock may occur due to an incorrect locking. The ALE standard allows more than one client application to request parallel read and write requests to an RFID reader. In addition, even one RFID client can simultaneously generate multiple requests for one RFID reader. However, while read tasks may be allowed to access the RFID reader at the same time, if one write task is writing data to the RFID tag via the RFID reader, other read tasks or write tasks may be used for reliable reading and writing of data. You must wait until the current data record is completed and a locking mechanism is used that is difficult to program.

Meanwhile, ALE-based middleware tasks may optionally have periodicity and strict deadlines. For example, one ALE task may perform a client command that reads tag data every 9 minutes starting at 9:00 am and reports newly added tag data within 5 seconds. However, the ALE specification, which is an existing RFID middleware standard, does not consider scheduling ALE tasks, so it is difficult to meet deadlines for tasks having a temporal constraint.

According to embodiments of the present invention, it is possible to solve the above problems without using a complicated locking mechanism to effectively implement the RFID middleware.

The specific acts described in the present invention are, by way of example, not intended to limit the scope of the invention in any way. For brevity of description, descriptions of conventional electronic configurations, control systems, software, and other functional aspects of such systems may be omitted. Also, the connections or connecting members of the lines between the components shown in the figures are illustrative of functional connections and / or physical or circuit connections, which may be replaced or additionally provided by a variety of functional connections, physical Connection, or circuit connections. Also, unless explicitly mentioned, such as " essential ", " importantly ", etc., it may not be a necessary component for application of the present invention.

The use of the terms " above " and similar indication words in the specification of the present invention (particularly in the claims) may refer to both singular and plural. In addition, in the present invention, when a range is described, it includes the invention to which the individual values belonging to the above range are applied (unless there is contradiction thereto), and each individual value constituting the above range is described in the detailed description of the invention The same. Finally, the steps may be performed in any suitable order, unless explicitly stated or contrary to the description of the steps constituting the method according to the invention. The present invention is not necessarily limited to the order of description of the above steps. The use of all examples or exemplary language (e.g., etc.) in this invention is for the purpose of describing the invention in detail and is not to be construed as a limitation on the scope of the invention, It is not. It will also be appreciated by those skilled in the art that various modifications, combinations, and alterations may be made depending on design criteria and factors within the scope of the appended claims or equivalents thereof.

1 Task Scheduling Device (Server)
11 receiver
12-stage switch
13 scheduler
14 transmitter

Claims (10)

Receiving a task from a client;
Transitioning the received task to a ready state for execution;
Determining a type of task currently in progress; And
And transmitting the new task to the RFID reader according to a task having a highest priority among tasks currently in progress and tasks which have been switched to the ready state for execution. The method of claim 1,
If the current ongoing task is a writing task,
And after the current task ends, transmitting the task having the highest priority among the tasks in the ready state to the RFID reader. The method of claim 1,
If the current task is a reading task and a read task having a higher priority than the write task having the highest priority among the write tasks in the ready state exists,
And transmitting a read task having a higher priority than the write task having the highest priority to the RFID reader before the current task is finished. The method of claim 1,
If the currently in progress task is a reading task and the task having the highest priority among the tasks in the ready state is a write task,
And after the current task ends, transmitting the write task having the highest priority to the RFID reader. The method of claim 1,
The task scheduling method is characterized in that applied to the RFID middleware. A task receiving unit which receives a task from a client;
A step switching unit for switching the received task to a ready state for execution;
A scheduler for determining whether to transmit the new task to an RFID reader according to a type of a task currently in progress and a type of a task having a highest priority among tasks switched to the ready state for execution; And
And a transmitter for transmitting the new task to the RFID reader. The method according to claim 6,
The scheduler comprising:
If the current ongoing task is a writing task,
And after the current task is finished, transmitting the task having the highest priority among the tasks in the ready state to the RFID reader. The method according to claim 6,
The scheduler comprising:
If the current task is a reading task and a read task having a higher priority than the write task having the highest priority among the write tasks in the ready state exists,
And transmitting a read task having a higher priority than the write task having the highest priority to the RFID reader before the current task is finished. The method according to claim 6,
The scheduler comprising:
If the currently in progress task is a reading task and the task having the highest priority among the tasks in the ready state is a write task,
And after the current task ends, transmitting the write task having the highest priority to the RFID reader. The method of claim 1,
The task scheduling apparatus may be applied to a server including an RFID middleware.
KR1020120076285A 2012-07-12 2012-07-12 Rfid task scheduling device and task scheduling method KR20140009733A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020120076285A KR20140009733A (en) 2012-07-12 2012-07-12 Rfid task scheduling device and task scheduling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020120076285A KR20140009733A (en) 2012-07-12 2012-07-12 Rfid task scheduling device and task scheduling method

Publications (1)

Publication Number Publication Date
KR20140009733A true KR20140009733A (en) 2014-01-23

Family

ID=50142756

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020120076285A KR20140009733A (en) 2012-07-12 2012-07-12 Rfid task scheduling device and task scheduling method

Country Status (1)

Country Link
KR (1) KR20140009733A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104915256A (en) * 2015-06-05 2015-09-16 惠州Tcl移动通信有限公司 Method and system for realizing real-time scheduling of task
WO2019066166A1 (en) * 2017-09-27 2019-04-04 주식회사 포에스텍 Middleware server and method for processing data thereof

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104915256A (en) * 2015-06-05 2015-09-16 惠州Tcl移动通信有限公司 Method and system for realizing real-time scheduling of task
WO2019066166A1 (en) * 2017-09-27 2019-04-04 주식회사 포에스텍 Middleware server and method for processing data thereof
CN111279665A (en) * 2017-09-27 2020-06-12 株式会社飞思特 Middleware server and method for processing data thereof

Similar Documents

Publication Publication Date Title
CN100476868C (en) Rf-tag reading system and rf-tag reader/writer control system, and interference avoidance method thereof
US20110173254A1 (en) System and method for scheduling device management
WO2009038247A1 (en) Time slot allocation apparatus and method for preventing collisions between time slots in tdma-based rfid network
CN103888441A (en) Information transmitting method between application and protocol stack and processing device
CN102630315A (en) Method and system for processing data for preventing deadlock
CN105095684A (en) Automatic triaging method for hospital
CN110609755A (en) Message processing method, device, equipment and medium for cross-block chain node
CN111722944B (en) NIO-based AIRT-ROS communication method and system
EP2945298A1 (en) Communication method and apparatus for nfc device, and nfc device
KR20150001146A (en) Storage system and Operating method thereof
KR20140009733A (en) Rfid task scheduling device and task scheduling method
CN111052083B (en) Method and apparatus for managing scheduling of services during startup
CN113641472A (en) Method and device for realizing different conversion and same sharing of distributed application
US20080178182A1 (en) Work state returning apparatus, work state returning method, and computer product
CN102884541A (en) Method for managing communication between electronic device (such as non-contact chip card) and communication apparatus (such as reader) and corresponding electronic device
US20120158824A1 (en) Apparatus and method for distributed processing of radio frequency identification (rfid) middleware
CN107172656B (en) Non-blocking request processing method and device
KR100945563B1 (en) System and Method for RFID Middleware Based on ALE Standard Specification
US20150140928A1 (en) Method, apparatus, and terminal device for controlling near field communication radio frequency discovery
CN105405087A (en) Hospital automatic triage method
KR101921313B1 (en) Method for operating relation server and system using the same
CN105009097A (en) Message transmission device, message transmission method, and message transmission program
JP6213746B2 (en) Optimizing discovery of data network devices to reduce data transfer capacity
CN112019452B (en) Method, system and related device for processing service requirement
CN111224861B (en) Method, system, equipment and storage medium for opening instant message service

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E601 Decision to refuse application