CN111355777A - Management method and device of distributed file system and server - Google Patents
Management method and device of distributed file system and server Download PDFInfo
- Publication number
- CN111355777A CN111355777A CN202010093854.4A CN202010093854A CN111355777A CN 111355777 A CN111355777 A CN 111355777A CN 202010093854 A CN202010093854 A CN 202010093854A CN 111355777 A CN111355777 A CN 111355777A
- Authority
- CN
- China
- Prior art keywords
- processed
- information
- data
- queue
- target
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention provides a management method of a distributed file system, which comprises the following steps: the router receives information to be processed, which refers to an operation to be processed. And putting the information to be processed into a waiting queue. The scheduler extracts the characteristics of the information to be processed as target characteristics, and selects a method for processing the information to be processed according to the target characteristics to obtain a preset method. And processing the information to be processed by using a preset method to obtain output data. And storing the output data into a configuration distribution network, and updating the data of the configuration distribution network to obtain updated data. And configuring the distribution network to output the updating data except when the client sending the information to be processed accesses the updating data. Synchronization is performed when multiple users must access the same data at the same time, thereby ensuring that updates and deletions of data at the same location are automatically mapped to other places where the data is stored.
Description
Technical Field
The invention relates to the technical field of distributed file systems, in particular to a management method and a management device of a distributed file system and a server.
Background
In conventional file systems, there are locking primitives, such as write locks on directories, or file and record locks, to serialize competing requests for the same resource. The state implementation of the file system must provide a similar function, the mechanism to do this is per-cabinet queues, which implicitly implements resource serialization.
Conventional serialization mechanisms include the following: rotational locks, mutexes, frozen locks, distributed locks, heartbeat mechanisms, and network quorum mechanisms, there are a variety of computing models, the most common of which is threaded with resource locks. In distributed computing, this extends to distributed lock managers and heartbeat networks, the latter extending the concept of a single node across multiple computers. When analyzing a distributed data management system, various common factors become apparent, implementation is complex, locking modes limit performance, locking models limit lateral expansion, deadlock is a common system outage, and locking and heartbeat traffic can create a large amount of overhead.
The rules and the method of the state table implicitly encode a large amount of logic, so the realization scale of the state table is very small; by definition, the state method has no fan-out, so algorithm complexity is low, digital logistics and parallelism of a Configuration Distribution Network (CDN) are low, and distributed locks are not used, so that almost linear lateral expansion capability is caused; the absence of a static local structure facilitates the migration of real-time resources.
Disclosure of Invention
The embodiment of the invention aims to provide a management method of a distributed file system, which is used for supporting the rapid reading and management of video cloud on massive Internet of things data. The specific technical scheme is as follows:
a management method of a distributed file system is characterized in that: the method comprises the following steps:
the router receives information to be processed sent by a target client, wherein the information to be processed refers to operation to be processed. The target client is any one of the clients.
And putting the information to be processed into a waiting queue.
The scheduler extracts the characteristics of the information to be processed as target characteristics, selects a method for processing the information to be processed according to the target characteristics, and acquires a preset method.
And processing the information to be processed by using a preset method to obtain output data.
And storing the output data into a configuration distribution network, and updating the data of the configuration distribution network to obtain updated data.
And when the client accesses the updating data, the distribution network is configured to output the updating data.
Compared with the prior art, the invention has the beneficial effects that: the waiting queue can simultaneously and respectively update data of the internal queue and the external queue, and through thread control, sleep is avoided, and the effect of orderly updating data is realized.
The waiting queue is controlled by the thread owning process, the waiting queue comprises an internal queue and an external queue, the internal queue is used for automatically updating the information to be processed, and the external queue is used for receiving the information to be processed.
By adopting the technical scheme, the data updating processing can be carried out according to a single thread, and the accuracy of data updating is ensured.
The method is further optimized as follows: the external queue is protected by a spin lock, which refers to a single threaded transfer from one queue element of the external queue to another queue element.
By adopting the technical scheme, the data can be gradually updated, and update chaos is avoided.
The method is further optimized as follows: the method for selecting and processing the information to be processed according to the target characteristics comprises the following steps:
a set of processing methods is created.
And storing a plurality of processing methods in a method set, and performing feature labeling on each processing method.
And searching a target feature label corresponding to the target feature in the method set according to the target feature.
And taking the processing method represented by the target feature label as a preset method.
By adopting the technical scheme, the preset method can be obtained, and the effect of updating and storing data is achieved.
The method is further optimized as follows: the information to be processed is: instructions to be processed or data to be processed.
By adopting the technical scheme, the router receives the instruction for operating the information to be processed, the scheduler schedules the data to be processed received by the router, the worker is controlled to update the information to be processed, and the worker outputs the data when accessing, so that the aim of updating the external queue and the internal queue is fulfilled.
The method is further optimized as follows: after the scheduler extracts the characteristics of the information to be processed as the target characteristics, the method also comprises the step of storing the target characteristics.
By adopting the technical scheme, the function of storing the target characteristics is completed, so that the target characteristics are stored in the working device, and convenience is provided for the client to access the data information.
The method is further optimized as follows: the storing of the target features includes:
each target feature is appended with a generic prefix that includes an opcode, an operation sequence number, and a digital object stamp. When a first node in the external queue sends a message to a second node, the first node places itself in a waiting queue.
The second node sends a return message with the prefix and the associated sender accesses a match from the hash queue according to the prefix.
If the second node does not respond, a timeout will occur and the scheduler invokes the method that gets the target characteristic.
And if the second node feeds back the same prefix, feeding back confirmation information to the first node, wherein the confirmation information indicates that the target characteristic is received.
By adopting the technical scheme, the target features can be uniquely stored by adding the universal prefix to the target features and marking the target features, so that repeated storage is avoided, the information to be processed can be mapped to other stored places after being updated in one place, the purpose of synchronously updating data is realized, and the effect that the accessed data is updated latest when being accessed is achieved.
Further preferably, the method for the client to access the update data comprises:
prefixes are added to the update data.
And obtaining a target cabinet of the updated data through the prefix, wherein the updated data is to be placed in a corresponding cabinet queue.
The access update data information is input.
The worker outputs the update data.
By adopting the technical scheme, the client side can access the updated data by accessing the target cabinet.
In another aspect of the present invention, there is also provided a device for a distributed file system management method, including
The receiving module is used for acquiring information to be processed;
the processing module is used for placing the information to be processed into a waiting queue, carrying out feature marking to obtain target features, and selecting a method for processing the information to be processed according to the target features to obtain a preset method;
the output module is used for processing the information to be processed by using a preset method to obtain output data; and storing the output data into a configuration distribution network, updating the data of the configuration distribution network to obtain updated data, and outputting the updated data.
In another aspect of the present invention, the embodiment of the present invention further provides a computer program product containing instructions, that is, a server, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1 to 8 when executing a program stored in the memory.
When run on a computer, causes the computer to execute any of the servers described above.
The embodiments of the present invention provide a management method and apparatus for a distributed file system, and a server, of course, it is not necessary for any product or method to achieve all the above advantages.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
FIG. 1 is a flow chart of a first embodiment;
FIG. 2 is a flowchart illustrating a preset method according to an embodiment of the present invention;
FIG. 3 is a flow chart of storing target features according to an embodiment;
FIG. 4 is a flowchart illustrating a method for a client to access update data according to an embodiment;
FIG. 5 is a functional block diagram according to an embodiment;
FIG. 6 is a diagram of an electronic product according to an example I;
FIG. 7 is a diagram illustrating a generic message prefix according to the second embodiment;
FIG. 8 is a schematic diagram of the second embodiment;
FIG. 9 is a diagram illustrating data input/output according to a second embodiment;
fig. 10 is a schematic diagram of a transaction according to the second embodiment.
Detailed Description
The embodiment of the invention aims to provide a management method of a distributed file system so as to maintain the stable attitude of an airplane under the control condition. The specific technical scheme is as follows:
a management method of a distributed file system, as shown in fig. 1, is characterized in that: the method comprises the following steps:
the router receives information to be processed sent by a target client, wherein the information to be processed refers to operation to be processed. The target client is any one of the clients. The information to be processed is: the router receives the instruction of the operation waiting processing information, the scheduler schedules the data to be processed received by the router, the worker is controlled to update the information to be processed, and when the worker accesses the information, the worker outputs the data, so that the aim of updating the external queue and the internal queue is fulfilled.
And putting the information to be processed into a waiting queue. The waiting queue is controlled by the thread owning process, the waiting queue comprises an internal queue and an external queue, the internal queue is used for automatically updating the information to be processed, the external queue is used for receiving the information to be processed, the data updating processing can be carried out according to a single thread, and the accuracy of the data updating is ensured. The external queue is protected by a spin lock, and the spin lock protection refers to the fact that data can be gradually updated by means of single thread transmission from one queue element of the external queue to the other queue element, so that updating confusion is avoided.
The scheduler extracts the characteristics of the information to be processed as target characteristics, selects a method for processing the information to be processed according to the target characteristics, and acquires a preset method. Note that, the preset method in the present application is a conventional method, for example, a processing method for processing information such as data, pictures, and videos.
After the dispatcher extracts the characteristics of the information to be processed as the target characteristics, the dispatcher also comprises the stored target characteristics, the function of storing the target characteristics is completed, the target characteristics are stored in the working device, and convenience is provided for the client to access the data information.
And processing the information to be processed by using a preset method to obtain output data.
And storing the output data into a configuration distribution network, and updating the data of the configuration distribution network to obtain updated data.
And when the client accesses the updating data, the distribution network is configured to output the updating data.
The invention realizes that the waiting queue can simultaneously and respectively update the data of the internal queue and the external queue, avoids sleeping through the thread control and realizes the effect of orderly updating the data.
As shown in fig. 2, the method for selecting and processing information to be processed according to a target feature includes:
a set of processing methods is created.
And storing a plurality of processing methods in a method set, and performing feature labeling on each processing method.
And searching a target feature label corresponding to the target feature in the method set according to the target feature.
And taking the processing method represented by the target feature label as a preset method. A preset method can be obtained, and the effect of updating and storing data is achieved.
The storing of the target features includes:
each target feature is appended with a generic prefix that includes an opcode, an operation sequence number, and a digital object stamp. When a first node in the external queue sends a message to a second node, the first node places itself in a waiting queue.
The second node sends a return message with the prefix and the associated sender accesses a match from the hash queue according to the prefix.
If the second node does not respond, a timeout will occur and the scheduler invokes the method that gets the target characteristic.
And if the second node feeds back the same prefix, feeding back confirmation information to the first node, wherein the confirmation information indicates that the target characteristic is received.
By adding the universal prefix to the target feature and marking the target feature, the unique storage of the target feature can be realized, the repeated storage is avoided, the information to be processed can be mapped to other stored places after being updated in one place, the purpose of synchronously updating data is realized, and the effect that the accessed data are updated latest when being accessed is achieved.
As shown in fig. 3, the method for accessing the update data by the client includes:
prefixes are added to the update data.
And obtaining a target cabinet of the updated data through the prefix, wherein the updated data is to be placed in a corresponding cabinet queue.
The access update data information is input.
The worker outputs the update data.
Therefore, the aim that the client accesses the updated data by accessing the target cabinet can be fulfilled.
In another aspect of the present invention, there is also provided an apparatus for a distributed file system management method, as shown in fig. 5, including
And the receiving module is used for acquiring the information to be processed.
And the processing module is used for placing the information to be processed into the waiting queue, carrying out characteristic marking to obtain target characteristics, and selecting a method for processing the information to be processed according to the target characteristics to obtain a preset method.
And the output module is used for processing the information to be processed by using a preset method to obtain output data. And storing the output data into a configuration distribution network, updating the data of the configuration distribution network to obtain updated data, and outputting the updated data.
In another aspect of the present invention, the embodiment of the present invention further provides a computer program product containing instructions, that is, a server, including a processor, a communication interface, a memory, and a communication bus, as shown in fig. 6, where the processor, the communication interface, and the memory are in communication with each other through the communication bus.
A memory for storing a computer program.
A processor for implementing the method steps of any of claims 1-8 when executing a program stored in the memory.
When run on a computer, causes the computer to execute any of the servers described above.
The embodiments of the present invention provide a management method and apparatus for a distributed file system, and a server, of course, it is not necessary for any product or method to achieve all the above advantages.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the device can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.
In another embodiment of the present invention, a computer-readable storage medium is further provided, where instructions are stored in the computer-readable storage medium, and when the instructions are executed on a computer, the computer is caused to execute any one of the above-described new energy assisted emergency control methods based on the abnormal attitude of the aircraft.
In a further embodiment provided by the present invention, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to execute the new energy assisted emergency power control apparatus as described in any of the above embodiments.
Example two
There is a general-purpose philosophy that spans all data cloud resources and relies on a single disk database. The goal is that all resources can be detected and queried by external artificial intelligence/business intelligence tools, and storage elements from different sources can be seamlessly mixed and matched without accessing the application that generated the raw data.
There are multiple service components, such as message sinks, schedulers, work thread queues, and cleaner services. These services all provide an external queue that allows external services to add requests. External queue services are in a multi-threaded configuration, thus requiring spin lock serialization. The internal queue is private to each service and therefore cannot be accessed from the outside.
As shown in fig. 7, each message in the data cloud contains a common prefix (1.1) with an opcode, an operation sequence number, and a digital object stamp. If one serving node sends a message (1.2) to another serving node, the sending node places itself in the LRU queue (1.3). The receiving node sends a return message with the appropriate opcode and matching sequence number (1.4) and the associated sender matches from the hash queue (1.5). If the remote node does not respond, a timeout will occur (1.6) and the constructed state3 method is invoked.
The distributor id is not part of the invention, but an important aspect of being part of the 0mq router/distributor message is that it is sent with each message. The vendor id in the data cloud is the NID of the node. NIDs in the distribution network are configured while associating an IP address that is the destination of any message, rather than the sending socket. This mechanism provides intrusion protection because information transfer is secure as long as the IP address is not exposed.
As shown in fig. 8, an extension of the stamp field is included in the common message prefix. There is one CDN reader class for each opcode (6.2) to be processed. The stamp (6.6) in the common prefix defines a bin and access is serialized on a per bin basis. In a transaction, the tags of sectors (6.9) are hashed to a specific work thread queue to enforce strict transaction ordering.
The scheduler decides the CDN update class for each operation (6.2) and then queues it as a read (6.3) or write (6.4).
The client requests may compete for the media stream of the same cabinet, e.g., camera. These streams may be created, opened, or deleted. The tag in the common prefix (6.6) maps to a cabinet identity (6.8) and maintains an operation queue (6.9) for each cabinet as a replacement for traditional directory locks and file and record locks common in most file system implementations.
To maintain strict ordering of messages (6.9) for sector metadata requests and updates, such messages are associated with a single worker thread through a hash function (6.10), and a worker queue (6.11) implicitly manages serialization.
As shown in fig. 9, the operation configuration (7.1) includes a work state, a pointer to the work operation, and a return state. The operation is added to the work queue so that it can sleep and initiate the operation, which calls a disk or network function. After completion, the operation is returned to the scheduler queue for further processing.
The operation construct includes state 0 (return state), state 4 (work queue state), and authority 4 (structure pointing to input/output operations).
The construct queues into the work queue in a round robin fashion (7.2). Starting from state 4 in the configuration, an input/output helper method is run (7.3). Upon completion, the construct will be re-queried in the scheduler state 0 queue (7.4). These two queues must be spin lock protected external queues for the thread. The next time the scheduler processes the state 0 queue, the method associated with the constructed state 0 will be executed.
As shown in fig. 10, a transaction always starts from a clump of zeros, whether metadata sectors or CDN sectors. There are also clusters 1 and 2, which will be hosted on other nodes. When an operation changes file system metadata, it is queued in the sector transaction queue (8.3), which is derived (8.2) from the prefix tag (8.1).
The transaction mechanism creates a log that can span multiple operations (8.4) and sends log records to cluster 1 and cluster 2(8.5) and plays the log on these nodes (8.6) to update the disk structure. When a response from the duplicate copy is received, the log will play on plexus 0(8.7) and the associated operation will then be put to completion on state2 queue (8.8).
About 60K log records may be included in a log record, which may be larger than the queue of operations that update metadata at any time.
Note that a sector is a data structure, part of which is a process control construct, so the sector itself can act as the control process for a transaction, which is a property unique to the state engine. Transaction boundaries are indicated by a simple BUSY flag on the sector with an active and pending queue holding transactions being processed and pending operations.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (10)
1. A management method of a distributed file system is characterized in that: the method comprises the following steps:
the router receives information to be processed sent by a target client, wherein the information to be processed refers to operation to be processed; the target client is any one of the clients;
putting the information to be processed into a waiting queue;
the scheduler extracts the characteristics of the information to be processed as target characteristics, selects a method for processing the information to be processed according to the target characteristics, and acquires a preset method;
processing the information to be processed by using the preset method to obtain output data;
storing the output data into a configuration distribution network, and updating the data of the configuration distribution network to obtain updated data;
and when the client accesses the updating data, the configuration distribution network outputs the updating data.
2. The method for managing a distributed file system according to claim 1, wherein: the waiting queue is controlled by a thread owning process, the waiting queue comprises an internal queue and an external queue, the internal queue is used for automatically updating the information to be processed, and the external queue is used for receiving the information to be processed.
3. The method for managing a distributed file system according to claim 2, wherein: the external queue is protected by a spin lock, which refers to a single threaded transfer from one queue element to another queue element of the external queue.
4. The method for managing a distributed file system according to claim 1, wherein: the method for selecting and processing the information to be processed according to the target characteristics comprises the following steps:
creating a processing method set;
storing a plurality of processing methods in the method set, and performing feature labeling on each processing method;
according to the target features, target feature labels corresponding to the target features are searched in the method set;
and taking the processing method represented by the target feature label as the preset method.
5. The method for managing a distributed file system according to claim 1, wherein: the information to be processed is as follows: instructions to be processed or data to be processed.
6. The method for managing a distributed file system according to claim 1, wherein: after the scheduler extracts the features of the information to be processed as target features, the method further comprises storing the target features.
7. The method for managing a distributed file system according to claim 6, wherein: the storing the target feature comprises:
adding a universal prefix to each target feature, wherein the prefix comprises an operation code, an operation serial number and a digital object stamp; when a first node in the external queue sends a message to a second node, the first node places the first node in a waiting queue;
the second node sends a return message with the prefix, and the associated sender accesses a match from a hash queue according to the prefix;
if the second node does not respond, overtime happens, and the dispatcher calls a method for obtaining the target characteristics;
and if the second node feeds back the same prefix, feeding back confirmation information to the first node, wherein the confirmation information indicates that the target characteristic is received.
8. The method for managing a distributed file system according to claim 1, wherein: the method for accessing the update data by the client comprises the following steps:
adding the prefix to the update data;
obtaining a target cabinet of the updated data through the prefix, wherein the updated data is to be placed in a corresponding cabinet queue;
inputting and accessing the updated data information;
the worker outputs the update data.
9. A management apparatus of a distributed file system, characterized in that: the method comprises the following steps:
the receiving module is used for acquiring information to be processed;
the processing module is used for placing the information to be processed into a waiting queue, carrying out feature marking to obtain target features, and selecting a method for processing the information to be processed according to the target features to obtain a preset method;
the output module is used for processing the information to be processed by using a preset method to obtain output data; and storing the output data into a configuration distribution network, updating the data of the configuration distribution network to obtain updated data, and outputting the updated data.
10. A server is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing the communication between the processor and the memory through the communication bus;
the memory is used for storing a computer program;
the processor, when executing the program stored in the memory, is adapted to perform the method steps of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010093854.4A CN111355777A (en) | 2020-02-14 | 2020-02-14 | Management method and device of distributed file system and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010093854.4A CN111355777A (en) | 2020-02-14 | 2020-02-14 | Management method and device of distributed file system and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111355777A true CN111355777A (en) | 2020-06-30 |
Family
ID=71196990
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010093854.4A Pending CN111355777A (en) | 2020-02-14 | 2020-02-14 | Management method and device of distributed file system and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111355777A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111880955A (en) * | 2020-08-04 | 2020-11-03 | 北京立通智联科技有限公司 | Message processing method, device, terminal and medium for Internet of things equipment |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1303188A (en) * | 2001-01-12 | 2001-07-11 | 张炬 | Storage-tuype digital broadcast and receiving system |
| US20040133577A1 (en) * | 2001-01-11 | 2004-07-08 | Z-Force Communications, Inc. | Rule based aggregation of files and transactions in a switched file system |
| CN1834956A (en) * | 2005-03-18 | 2006-09-20 | 联想(北京)有限公司 | Processing of multiroute processing element data |
| CN101533342A (en) * | 2007-12-27 | 2009-09-16 | 英特尔公司 | Compressed instruction format |
| US20140280070A1 (en) * | 2013-03-13 | 2014-09-18 | Daegis Inc. | System and method for providing technology assisted data review with optimizing features |
| CN105045820A (en) * | 2015-06-25 | 2015-11-11 | 浙江立元通信技术股份有限公司 | Method for processing video image information of mass data and database system |
| CN105119978A (en) * | 2015-07-21 | 2015-12-02 | 浪潮(北京)电子信息产业有限公司 | Metadata cluster parallel distribution processing method and metadata cluster parallel distribution processing system |
| CN105468710A (en) * | 2015-11-19 | 2016-04-06 | 中国建设银行股份有限公司 | Picture processing method and system applied in high concurrency scene |
| CN105893583A (en) * | 2016-04-01 | 2016-08-24 | 北京鼎泰智源科技有限公司 | Data acquisition method and system based on artificial intelligence |
| CN107222555A (en) * | 2017-06-27 | 2017-09-29 | 聚好看科技股份有限公司 | Message treatment method and device |
| US20180011874A1 (en) * | 2008-04-29 | 2018-01-11 | Overland Storage, Inc. | Peer-to-peer redundant file server system and methods |
| CN107800819A (en) * | 2017-11-17 | 2018-03-13 | 深圳市泉眼网络科技有限公司 | A kind of generation method of file identification, device and server |
| CN108109628A (en) * | 2017-12-13 | 2018-06-01 | 四川西谷物联科技有限公司 | Information collecting method, device and electronic equipment |
| CN110727690A (en) * | 2019-10-15 | 2020-01-24 | 刘卫立 | Data updating method |
-
2020
- 2020-02-14 CN CN202010093854.4A patent/CN111355777A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040133577A1 (en) * | 2001-01-11 | 2004-07-08 | Z-Force Communications, Inc. | Rule based aggregation of files and transactions in a switched file system |
| CN1303188A (en) * | 2001-01-12 | 2001-07-11 | 张炬 | Storage-tuype digital broadcast and receiving system |
| CN1834956A (en) * | 2005-03-18 | 2006-09-20 | 联想(北京)有限公司 | Processing of multiroute processing element data |
| CN101533342A (en) * | 2007-12-27 | 2009-09-16 | 英特尔公司 | Compressed instruction format |
| US20180011874A1 (en) * | 2008-04-29 | 2018-01-11 | Overland Storage, Inc. | Peer-to-peer redundant file server system and methods |
| US20140280070A1 (en) * | 2013-03-13 | 2014-09-18 | Daegis Inc. | System and method for providing technology assisted data review with optimizing features |
| CN105045820A (en) * | 2015-06-25 | 2015-11-11 | 浙江立元通信技术股份有限公司 | Method for processing video image information of mass data and database system |
| CN105119978A (en) * | 2015-07-21 | 2015-12-02 | 浪潮(北京)电子信息产业有限公司 | Metadata cluster parallel distribution processing method and metadata cluster parallel distribution processing system |
| CN105468710A (en) * | 2015-11-19 | 2016-04-06 | 中国建设银行股份有限公司 | Picture processing method and system applied in high concurrency scene |
| CN105893583A (en) * | 2016-04-01 | 2016-08-24 | 北京鼎泰智源科技有限公司 | Data acquisition method and system based on artificial intelligence |
| CN107222555A (en) * | 2017-06-27 | 2017-09-29 | 聚好看科技股份有限公司 | Message treatment method and device |
| CN107800819A (en) * | 2017-11-17 | 2018-03-13 | 深圳市泉眼网络科技有限公司 | A kind of generation method of file identification, device and server |
| CN108109628A (en) * | 2017-12-13 | 2018-06-01 | 四川西谷物联科技有限公司 | Information collecting method, device and electronic equipment |
| CN110727690A (en) * | 2019-10-15 | 2020-01-24 | 刘卫立 | Data updating method |
Non-Patent Citations (4)
| Title |
|---|
| ART BAKER: "《Windows NT设备驱动程序设计指南》", 31 December 1997, 机械工业出版社 * |
| DONGFANG ZHAO等: ""HyCache: A User-Level Caching Middleware for Distributed File Systems"", 《 2013 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, WORKSHOPS AND PHD FORUM》 * |
| 曹婧华等: ""分布式消息队列的设计与实现"", 《河南科技大学学报》 * |
| 王芃等: ""一种新的队列结构形式-双头共享队列"", 《铁路计算机应用》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111880955A (en) * | 2020-08-04 | 2020-11-03 | 北京立通智联科技有限公司 | Message processing method, device, terminal and medium for Internet of things equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9971823B2 (en) | Dynamic replica failure detection and healing | |
| US8544059B2 (en) | System and method for determining effective policy profiles in a client-server architecture | |
| US10223506B2 (en) | Self-destructing files in an object storage system | |
| US11394794B2 (en) | Fast ingestion of records in a database using data locality and queuing | |
| US20130191523A1 (en) | Real-time analytics for large data sets | |
| US10860604B1 (en) | Scalable tracking for database udpates according to a secondary index | |
| US20110196866A1 (en) | Small table: multitenancy for lots of small tables on a cloud database | |
| US10360394B2 (en) | System and method for creating, tracking, and maintaining big data use cases | |
| US20070220062A1 (en) | Synchronization of access permissions in a database network | |
| US11775480B2 (en) | Method and system for deleting obsolete files from a file system | |
| US20060271384A1 (en) | Reference data aggregate service population | |
| US20190228132A1 (en) | Data isolation in distributed hash chains | |
| CN116701330A (en) | Logistics information sharing method, device, equipment and storage medium | |
| US20180300369A1 (en) | Secure query interface | |
| JP4189332B2 (en) | Database management system, database management method, database registration request program, and database management program | |
| CN111355777A (en) | Management method and device of distributed file system and server | |
| US10185735B2 (en) | Distributed database system and a non-transitory computer readable medium | |
| US7792274B2 (en) | Techniques for performing multi-media call center functionality in a database management system | |
| US9734185B2 (en) | Mechanism for communication in a distributed database | |
| US20170316045A1 (en) | Read-after-write consistency for derived non-relational data | |
| US20140280347A1 (en) | Managing Digital Files with Shared Locks | |
| US11537559B2 (en) | Client generated aggregated indices | |
| US11954039B2 (en) | Caching system and method | |
| JP2018530796A (en) | Apparatus and method for executing multiple threads | |
| Lasota et al. | Scalable distributed datastore for real-time cloud computing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200630 |
|
| WD01 | Invention patent application deemed withdrawn after publication |