CN102004891B - Interprocess data communication method and device for RFID (Radio Frequency Identification Device) middleware - Google Patents
Interprocess data communication method and device for RFID (Radio Frequency Identification Device) middleware Download PDFInfo
- Publication number
- CN102004891B CN102004891B CN200910057871.6A CN200910057871A CN102004891B CN 102004891 B CN102004891 B CN 102004891B CN 200910057871 A CN200910057871 A CN 200910057871A CN 102004891 B CN102004891 B CN 102004891B
- Authority
- CN
- China
- Prior art keywords
- queue
- data
- message
- free space
- rfid middleware
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses an interprocess data communication method for an RFID (Radio Frequency Identification Device) middleware. A main module of the RFID middleware and each electronic label acquisition module of the RFID middleware both establish respective message queues; the main module of the RFID middleware regularly sends various commands to the message queues of the electronic label acquisition modules of the RFID middleware; and the electronic label acquisition modules send acquired label data to the message queue of the main module. The invention also discloses an interprocess data communication device for the RFID middleware. The interactive process of interprocess small block data is optimized aiming at the application characteristics of the RFID middleware, thereby realizing data delivery, receiving and release algorithms of constant time complexity; the invention can meet the performance requirements on the RFID middleware for real-time electronic label acquisition, is suitable for the electronic label acquisition modules of the RFID middleware and realizes the loose coupling of the main module and the electronic label acquisition modules of the RFID middleware.
Description
Technical field
The present invention relates to RFID (Radio Frequency Identification, radio-frequency (RF) identification) field of data exchange between middleware process, particularly relate to a kind of method of carrying out data transmission between the process of RFID middleware primary module and RFID middleware electronic tag acquisition module.The invention still further relates to a kind of device for intertask data communication in RFID middleware.
Background technology
RFID middleware can identify and collect the electronic tag data of RFID device automatically, applies to the fields such as various logistics, manufacture and important item tracking widely.RFID middleware is erecting the bridge of data communication between identification (as RFID reader) and application system automatically, and its most basic function is collected and/or filtering electronic label.
When RFID reader works, RFID middleware can ceaselessly reading electronic labels.In a large-scale working environment, hundreds RFID device may be had to work at the same time, and this performance for RFID middleware proposes strict requirement.
In RFID middleware, the data length of each electronic tag is generally tens bytes; Therefore, in the primary equipment scan period, the electronic tag data amount of collection is in most cases all in the scope of tens of byte to hundreds of bytes.
Inter-Process Communication is a requisite function in big-and-middle-sized computer application system, by interprocess communication, can realize two exchanges data mutually independently between process.
In current many application software at home and abroad, memory techniques (comprising shared drive, memory queue, signal lamp etc.) has generally been adopted to realize fast data exchange.But in RFID middleware, not yet there are fast data exchange means between the process for RFID application feature.
Chinese invention patent application prospectus CN1859325 (publication date: on November 8th, 2006) discloses one " progress message transferring method based on chained list ", adopts based on the exchanges data between the message transferring technology of sharing memory pointer and the data structure implementation process of sharing memory linked list.It is a kind of general Inter-Process Communication method, does not have the exchange of small block data, can not realize the message dilivery between the process in constant time, receive and release.
Chinese invention patent application prospectus CN1501277 (publication date: on June 2nd, 2004) discloses one " bus type inter-process communication method ", is applied in the platform with Unix or (SuSE) Linux OS environment.It is in conjunction with the exchanges data between share memory technology and signal lamp integrated technology implementation process.Similar with last patented claim, it is not also for small block data is optimized, and the method simultaneously in this patented claim is not suitable for Windows and WinCE operating system.
Chinese invention patent application prospectus CN101373509 (publication date: on February 25th, 2009) discloses one " a kind of RFID middleware based on distributed ALE ", distributed resource is adopted to carry out parallel computation, namely utilize the concurrent working of multiple stage computing machine to improve the load of system, for solving overload problem.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of method of RFID middleware intertask data communication, is optimized the small block data reciprocal process between process; For this reason, the present invention also will provide a kind of for intertask data communication device in RFID middleware.
For solving the problems of the technologies described above, the method for RFID middleware intertask data communication of the present invention is achieved through the following technical solutions:
RFID middleware primary module and each RFID middleware electronic tag acquisition module set up separately independently message queue, described message queue comprises data queue and free space queue, described data queue comprises multiple message bag, and each message handbag draws together metadata and real data; Described metadata describes the mark of the size of real data, the size of message bag, the type of message of message bag and message bag; The timing of RFID middleware primary module sends electronic tag collection or electronic tag write instruction to the message queue of each RFID middleware electronic tag acquisition module; After RFID middleware electronic tag acquisition module receives electronic tag acquisition instructions, gather electronic tag from RFID device, and the label data collected and equipment state are sent on the message queue of RFID middleware primary module;
Described message queue adopts two-layer memory allocator to realize fast data exchange, and the direct distributing operation system interface of ground floor memory allocator and correspondence memory distribute request; Second layer memory allocator takes different strategies according to different situations, when the memory headroom size needing to distribute is more than 32K byte, directly calls described ground floor memory allocator; Otherwise, then think that it is little block space; Described second layer memory allocator any fritter interval will be adjusted to the multiple of 32 bytes automatically;
Whether described message queue carries out initialized method and comprises the steps: detect-message queue initialization; If message queue is initialization not yet, then initialization free space queue: distribute 1024 free space queues, the free space of each free space queue management fixed length; Initialization mutex amount, conducts interviews to message queue with synchronous multitask or multithreading; If message queue is initialization, then open the shared drive of specifying corresponding to message queue, obtain the information of current data queue and free space queue;
The distribution method of described message queue comprises the steps: if the space of asking is greater than 32K byte, then carry out storage allocation by the direct call operation system of ground floor memory allocator; If the space of current request is less than 32K byte, then automatically adjust to the integral multiple of 32K byte, and be directly targeted to corresponding free space queue; If the available free data of this free space queue, then directly therefrom obtain one piece of free space; If this free space queue does not have idle data, then need again to fill this free space queue;
What the recovery method of described message queue comprised the steps: that the data reclaimed are greater than 32K byte transfers to operating system to carry out Free up Memory by ground floor memory allocator; What be less than 32K byte is directly targeted to corresponding free space queue.
Of the present inventionly to comprise for intertask data communication device in RFID middleware, RFID middleware primary module and multiple RFID middleware electronic tag acquisition module, RFID middleware electronic tag acquisition module is responsible for gathering the electronic tag data in RFID reader, and RFID middleware primary module receives the electronic tag data of each RFID middleware electronic tag acquisition module;
RFID middleware primary module and each RFID middleware electronic tag acquisition module set up respective message queue, and the timing of RFID middleware primary module sends various instruction to the message queue of each RFID middleware electronic tag acquisition module; After RFID middleware electronic tag acquisition module receives electronic tag acquisition instructions, gather electronic tag from RFID device, and the label data collected and equipment state are sent on the message queue of RFID middleware primary module;
Described message queue comprises data queue and free space queue, and described data queue comprises multiple message bag, and each message handbag draws together metadata and real data; Described metadata describes the mark of the size of real data, the size of message bag, the type of message of message bag and message bag;
Described message queue adopts two-layer memory allocator to realize fast data exchange, and the direct distributing operation system interface of ground floor memory allocator and correspondence memory distribute request; Second layer memory allocator takes different strategies according to different situations, when the memory headroom size needing to distribute is more than 32K byte, directly calls described ground floor memory allocator; Otherwise, then think that it is little block space; Described second layer memory allocator any fritter interval will be adjusted to the multiple of 32 bytes automatically;
Described message queue carries out initialized mode: whether detect-message queue initialization; If message queue is initialization not yet, then initialization free space queue: distribute 1024 free space queues, the free space of each free space queue management fixed length; Initialization mutex amount, conducts interviews to message queue with synchronous multitask or multithreading; If message queue is initialization, then open the shared drive of specifying corresponding to message queue, obtain the information of current data queue and free space queue;
The allocation scheme of described message queue is: if the space of request is greater than 32K byte, then carry out storage allocation by the direct call operation system of ground floor memory allocator; If the space of current request is less than 32K byte, then automatically adjust to the integral multiple of 32K byte, and be directly targeted to corresponding free space queue; If the available free data of this free space queue, then directly therefrom obtain one piece of free space; If this free space queue does not have idle data, then need again to fill this free space queue;
The way of recycling of described message queue is: what the data of recovery were greater than 32K byte transfers to operating system to carry out Free up Memory by ground floor memory allocator; What be less than 32K byte is directly targeted to corresponding free space queue.
The present invention by RFID middleware the most frequently between process small block data communication be optimized, achieve constant time complexity data block deliver, receive and release.
The present invention can meet the performance requirement that RFID middleware gathers for real-time electronic label, and makes RFID middleware primary module and RFID middleware electronic tag acquisition module realize loose couplings.
The present invention can work in all operating system with shared drive, comprises Windows, WinCE, Linux and Unix system.
Operationally, most its data volumes of communication process is all between tens of byte to multiple kilobytes for RFID middleware.For this class communication object, each communication object of possibility is very little, but needs to create frequently and destroy, and quantity is a lot.If adopt common dynamic assignment and the way of release, the problem of memory fragmentation and efficiency will be caused.The present invention is by the number of times that reduces actual memory as far as possible and distribute and increase the granularity that actual memory distributes, thus improves performance and can prevent the generation of memory fragmentation.
Accompanying drawing explanation
Below in conjunction with accompanying drawing and embodiment, the present invention is further detailed explanation:
Fig. 1 is the free space queue structure schematic diagram in message queue;
Fig. 2 is the data queue's structural representation in message queue;
Fig. 3 is the data flow diagram between RFID middleware primary module and RFID middleware electronic tag acquisition module.
Embodiment
The present invention, by the message queue based on shared drive, realizes the exchanges data in RFID middleware between process, by the allocation strategy of the memory pool based on fixed size blocks, can be implemented in most cases, the data interaction of constant time complexity.
Shown in Figure 3, the method for described RFID middleware intertask data communication is realized by RFID middleware primary module and multiple RFID middleware electronic tag acquisition module.RFID middleware electronic tag acquisition module is responsible for gathering the electronic tag data in RFID reader, and RFID middleware primary module receives the electronic tag data of each RFID middleware electronic tag acquisition module.
RFID middleware primary module and each RFID middleware electronic tag acquisition module set up respective message queue.The timing of RFID middleware primary module sends various instruction to the message queue of each RFID middleware electronic tag acquisition module; After RFID middleware electronic tag acquisition module receives electronic tag acquisition instructions, gather electronic tag from RFID device, and the label data collected and equipment state are sent on the message queue of RFID middleware primary module.
Described message queue is structured on the shared drive of operating system, and described operating system comprises: Windows, Win CE, Linux and Unix system.
Described message queue comprises data queue's (its structure as shown in Figure 2) and free space queue (its structure as shown in Figure 1, the freed data blocks of the fixed length of each free space queue management some); When different process needs to carry out data communication, transmission process delivers message data in data queue, and receiving process takes out message data in real time from data queue; Message data is put in free space queue after taking out from data queue.
Described message queue is that each message distributes the blocks of data space subscribing length.
Data queue in described message queue comprises multiple message bag, and each message handbag draws together metadata and real data; Described metadata describes the mark of the size of real data, the size of message bag, the type of message of message bag and message bag.
In message queue, the key realizing fast data exchange is in constant time, complete small object (i.e. small block data) distribution and release.For this reason, two-layer memory allocator framework is taken in the present invention: the direct distributing operation system interface response memory of ground floor memory allocator distributes request; Second layer memory allocator then takes different strategies depending on the size in current request space: when the memory headroom size needing to distribute is more than 32K byte, then think its " enough large ", do not belong to the category of little block space, directly call described ground floor memory allocator; Otherwise, then think that it is little block space.In order to reduce system burden, directly from the free space queue of fixed length, obtaining internal memory, and no longer seeking help from ground floor memory allocator.
The memory fragmentation that second layer memory allocator should avoid too many small block data to cause in mechanism.Conveniently manage, second layer memory allocator any fritter interval will be adjusted to multiple (such as client-requested 30 byte of 32 bytes automatically, just automatically be adjusted to 32 bytes), and safeguard the free space queue (free-list) of 1024 fixed length, freed data blocks (i.e. free space) size of each Self management of these free space queues is respectively 32,64,96 ... 32K byte.
Initialization is carried out to described message queue, comprises the steps: detect-message queue whether initialization.If message queue is initialization not yet, then initialization free space queue, distribute 1024 free space queues, each free space queue only manages the free space of fixed length, and they manage size is respectively 32,64,96 ... the fixed length free space of 32K byte.Also need initialization mutex amount simultaneously, with synchronous multitask or multithreading, message queue is conducted interviews.If message queue is initialization, then open the shared drive of specifying corresponding to message queue, obtain the information of current data queue and free space queue.
The distribution of described message queue, comprises the following steps: if the space of request is greater than 32K byte, then carry out storage allocation by the direct call operation system of ground floor memory allocator.If the space of current request is less than 32K byte, then automatically adjust to the integral multiple of 32K byte.Now can be directly targeted to corresponding free space queue, in most cases, if the available free data of this free space queue, then directly therefrom obtain one piece of free space.Owing to taking the free space queue of fixed size, can be implemented in the distribution completing internal memory in constant time complexity, and with free space size and apply for the size of internal memory it doesn't matter.If this free space queue does not have idle data, then need again to fill this free space queue, preset the new memory block obtaining 20 equal sizes, just in case Installed System Memory is not enough, obtains memory block number and may be less than 20.
The recovery of described message queue, comprises the following steps: during data collection, first judges block size, be greater than 32K byte by ground floor memory allocator, transfer to operating system to carry out Free up Memory.What be less than 32K byte is directly targeted to corresponding free space queue.The data of release are suspended to the end of this free space queue.Owing to not needing to carry out linear, two points search, only need to reclaim according to size of data, so the message that can realize constant time complexity reclaims.
Above by embodiment to invention has been detailed description, but these are not construed as limiting the invention.Without departing from the principles of the present invention, those skilled in the art also can make many distortion and improvement, and these also should be considered as protection scope of the present invention.
Claims (5)
1. the method for a RFID middleware intertask data communication, it is characterized in that: RFID middleware primary module and each RFID middleware electronic tag acquisition module set up separately independently message queue, described message queue comprises data queue and free space queue, described data queue comprises multiple message bag, and each message handbag draws together metadata and real data; Described metadata describes the mark of the size of real data, the size of message bag, the type of message of message bag and message bag; The timing of RFID middleware primary module sends electronic tag collection or electronic tag write instruction to the message queue of each RFID middleware electronic tag acquisition module; After RFID middleware electronic tag acquisition module receives electronic tag acquisition instructions, gather electronic tag from RFID device, and the label data collected and equipment state are sent on the message queue of RFID middleware primary module;
Described message queue adopts two-layer memory allocator to realize fast data exchange, and the direct distributing operation system interface of ground floor memory allocator and correspondence memory distribute request; Second layer memory allocator takes different strategies according to different situations, when the memory headroom size needing to distribute is more than 32K byte, directly calls described ground floor memory allocator; Otherwise, then think that it is little block space; Described second layer memory allocator any fritter interval will be adjusted to the multiple of 32 bytes automatically;
Whether described message queue carries out initialized method and comprises the steps: detect-message queue initialization; If message queue is initialization not yet, then initialization free space queue: distribute 1024 free space queues, the free space of each free space queue management fixed length; Initialization mutex amount, conducts interviews to message queue with synchronous multitask or multithreading; If message queue is initialization, then open the shared drive of specifying corresponding to message queue, obtain the information of current data queue and free space queue;
The distribution method of described message queue comprises the steps: if the space of asking is greater than 32K byte, then carry out storage allocation by the direct call operation system of ground floor memory allocator; If the space of current request is less than 32K byte, then automatically adjust to the integral multiple of 32K byte, and be directly targeted to corresponding free space queue; If the available free data of this free space queue, then directly therefrom obtain one piece of free space; If this free space queue does not have idle data, then need again to fill this free space queue;
What the recovery method of described message queue comprised the steps: that the data reclaimed are greater than 32K byte transfers to operating system to carry out Free up Memory by ground floor memory allocator; What be less than 32K byte is directly targeted to corresponding free space queue.
2. the method for claim 1, is characterized in that: described message queue is structured on the shared drive of operating system, and described operating system comprises: Windows, Win CE, Linux and Unix system.
3. the method for claim 1, is characterized in that: when different process needs to carry out data communication, transmission process delivers message data in described data queue, and receiving process takes out message data in real time from described data queue; This message data is put in described free space queue after taking out from described data queue.
4. the method for claim 1, is characterized in that: described message queue is that each message distributes the blocks of data space subscribing length.
5. one kind for intertask data communication device in RFID middleware, it is characterized in that: comprise, RFID middleware primary module and multiple RFID middleware electronic tag acquisition module, RFID middleware electronic tag acquisition module is responsible for gathering the electronic tag data in RFID reader, and RFID middleware primary module receives the electronic tag data of each RFID middleware electronic tag acquisition module;
RFID middleware primary module and each RFID middleware electronic tag acquisition module set up respective message queue, and the timing of RFID middleware primary module sends various instruction to the message queue of each RFID middleware electronic tag acquisition module; After RFID middleware electronic tag acquisition module receives electronic tag acquisition instructions, gather electronic tag from RFID device, and the label data collected and equipment state are sent on the message queue of RFID middleware primary module;
Described message queue comprises data queue and free space queue, and described data queue comprises multiple message bag, and each message handbag draws together metadata and real data; Described metadata describes the mark of the size of real data, the size of message bag, the type of message of message bag and message bag;
Described message queue adopts two-layer memory allocator to realize fast data exchange, and the direct distributing operation system interface of ground floor memory allocator and correspondence memory distribute request; Second layer memory allocator takes different strategies according to different situations, when the memory headroom size needing to distribute is more than 32K byte, directly calls described ground floor memory allocator; Otherwise, then think that it is little block space; Described second layer memory allocator any fritter interval will be adjusted to the multiple of 32 bytes automatically;
Described message queue carries out initialized mode: whether detect-message queue initialization; If message queue is initialization not yet, then initialization free space queue: distribute 1024 free space queues, the free space of each free space queue management fixed length; Initialization mutex amount, conducts interviews to message queue with synchronous multitask or multithreading; If message queue is initialization, then open the shared drive of specifying corresponding to message queue, obtain the information of current data queue and free space queue;
The allocation scheme of described message queue is: if the space of request is greater than 32K byte, then carry out storage allocation by the direct call operation system of ground floor memory allocator; If the space of current request is less than 32K byte, then automatically adjust to the integral multiple of 32K byte, and be directly targeted to corresponding free space queue; If the available free data of this free space queue, then directly therefrom obtain one piece of free space; If this free space queue does not have idle data, then need again to fill this free space queue;
The way of recycling of described message queue is: what the data of recovery were greater than 32K byte transfers to operating system to carry out Free up Memory by ground floor memory allocator; What be less than 32K byte is directly targeted to corresponding free space queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910057871.6A CN102004891B (en) | 2009-09-03 | 2009-09-03 | Interprocess data communication method and device for RFID (Radio Frequency Identification Device) middleware |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910057871.6A CN102004891B (en) | 2009-09-03 | 2009-09-03 | Interprocess data communication method and device for RFID (Radio Frequency Identification Device) middleware |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102004891A CN102004891A (en) | 2011-04-06 |
| CN102004891B true CN102004891B (en) | 2015-03-04 |
Family
ID=43812246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910057871.6A Active CN102004891B (en) | 2009-09-03 | 2009-09-03 | Interprocess data communication method and device for RFID (Radio Frequency Identification Device) middleware |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102004891B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102495755B (en) * | 2011-11-03 | 2013-04-17 | 深圳市开立科技有限公司 | Ultrasonic measurement system and module interaction method of ultrasonic measurement system |
| CN102629205B (en) * | 2012-03-16 | 2015-03-11 | 广州中大微电子有限公司 | Interface system for being communicated with RFID reader |
| CN102981809B (en) * | 2012-12-28 | 2016-05-11 | 上海创图网络科技发展有限公司 | Message based without synchronous 3D rendering intent under a kind of multi-thread environment |
| CN103116736A (en) * | 2013-01-22 | 2013-05-22 | 北京屏芯科技有限公司 | Wireless inventory device and method |
| CN109491804A (en) * | 2018-10-11 | 2019-03-19 | 视联动力信息技术股份有限公司 | Method for message transmission and device |
| CN114339044B (en) * | 2021-12-29 | 2024-06-18 | 天津天地伟业智能安全防范科技有限公司 | High-throughput snapshot method and device based on message queue |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477635A (en) * | 2008-12-12 | 2009-07-08 | 华南理工大学 | Embedded RFID middleware based on light-weight ALE |
| CN101504603A (en) * | 2009-02-24 | 2009-08-12 | 诚迈科技（南京）有限公司 | Filtering method model of RFID hardware intermediate part |
-
2009
- 2009-09-03 CN CN200910057871.6A patent/CN102004891B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477635A (en) * | 2008-12-12 | 2009-07-08 | 华南理工大学 | Embedded RFID middleware based on light-weight ALE |
| CN101504603A (en) * | 2009-02-24 | 2009-08-12 | 诚迈科技（南京）有限公司 | Filtering method model of RFID hardware intermediate part |
Non-Patent Citations (4)
| Title |
|---|
| Load Balancing Method Using Connection Pool in RFID Middleware;Sung-Mee Park et al;《5th ACIS International Conference on Software Engineering Research, Management and Applications,2007(SERA 2007)》;20070822;第132-137页 * |
| RFID Data Management in Manufactory;Hongying Liu et al;《2nd International Conference on Anti-Counterfeiting,Security and Indentification》;20080823;第420-423页 * |
| RFID中间件研究与设计;邓海生等;《计算机技术与发展》;20081130;第18卷(第11期);第55-57页 * |
| 路康等.基于JMS的RFID中间件设计与实现.《河南大学学报(自然科学版)》.2008,第38卷(第5期),第537-540页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102004891A (en) | 2011-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102004891B (en) | Interprocess data communication method and device for RFID (Radio Frequency Identification Device) middleware | |
| CN105049268B (en) | Distributed computing resource distribution system and task processing method | |
| CN104915151B (en) | A kind of memory excess distribution method that active is shared in multi-dummy machine system | |
| CN103036946B (en) | A kind of method and system processing file backup task for cloud platform | |
| CN106547612A (en) | A kind of multi-task processing method and device | |
| CN102946413B (en) | Method and system for resource preprocessing in dispatching and deployment performing process of virtual machine | |
| US11537862B2 (en) | Neural network processor and control method of neural network processor | |
| CN102609467A (en) | Method and device for database connection management | |
| CN105653398A (en) | Intelligent distribution operation system mirror image method | |
| CN109376011A (en) | The method and apparatus of resource are managed in virtualization system | |
| CN102929769A (en) | Virtual machine internal-data acquisition method based on agency service | |
| CN108064377A (en) | A kind of management method and device of multisystem shared drive | |
| CN107864211A (en) | Cluster resource dispatching method and system | |
| CN102455976A (en) | Middleware memory management scheme | |
| CN103778066A (en) | Data processing method and device | |
| CN112612523A (en) | Embedded equipment driving system and method | |
| CN104915302B (en) | Data transmission processing method and data link | |
| CN103116475A (en) | Method of automatic simplifying allocation expansion | |
| CN105677481B (en) | A kind of data processing method, system and electronic equipment | |
| CN109783429A (en) | A kind of FPGA accelerator card expands disk cabinet and server | |
| CN1307558C (en) | Virtual internal storage allocating and managing method of subsystem in communication system | |
| CN103294978A (en) | Method of POS machine for identifying RFID electronic tag | |
| CN102541654A (en) | Efficient memory management method and device | |
| CN115168012A (en) | Thread pool concurrent thread number determining method and related product | |
| CN102710772B (en) | A kind of mass data communication system based on cloud platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230202 Address after: Floor 5, Xuangang Building, No. 93, Xuanfu Street, Xuanhua District, Zhangjiakou City, Hebei Province, 075199 Patentee after: Hebei Baoxuan Data Technology Co.,Ltd. Address before: Shanghai city Pudong New Area 201203 GuoShouJing Road No. 515 Patentee before: SHANGHAI BAOSIGHT SOFTWARE Co.,Ltd. |
|
| TR01 | Transfer of patent right |