High-performance distributed storage apparatus and method
Abstract
Provided are a high-performance distributed storage apparatus and method. The high-performance distributed storage method includes receiving and storing file data by a chunk unit, outputting file data chunks stored in an input buffer and transmitting the file data chunks to data servers in parallel, additionally generating a new file storage requester to connect the new file storage requester to a new data server based on a data input speed of the input buffer and a data output speed at which data is output to the data server, re-setting a file data chunk output sequence for a plurality of file storage requesters including the new file storage requester, and applying a result of the re-setting to output and transmit the file data chunks stored in the input buffer to the data servers in parallel.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A high-performance distributed storage apparatus based on a distributed file system including a metadata server and a data server, the high-performance distributed storage apparatus comprising:
an input buffer, file data being input to the input buffer by a chunk unit; two or more file storage requesters configured to output file data chunks stored in the input buffer and transmit and store the file data chunks to and in different data servers in parallel; and a high-speed distributed storage controller configured to additionally generate a new file storage requester, based on a data input speed of the input buffer and a data output speed at which data is output to the data servers and delete at least one chunk of the file data stored in the input buffer, based on a predetermined remaining storage space of the input buffer.
2 . The high-performance distributed storage apparatus of claim 1 , wherein when the data input speed is more than a predetermined threshold value faster than the data output speed, the high-speed distributed storage controller additionally generates the new file storage requester, is allocated a new data server from the metadata server, and connects the new file storage requester to the new data server.
3 . The high-performance distributed storage apparatus of claim 1 , wherein
a sequence number of each of the two or more file storage requesters is set in order for another file storage requester not to overlap a chunk which is to be output from the input buffer, and a chunk number which is to be output next is set based on a first chunk number in the input buffer, the sequence number, and number of storage processing.
4 . The high-performance distributed storage apparatus of claim 1 , wherein each of the two or more file storage requesters transmits and stores, instead of the deleted chunk, a predetermined default data chunk to and in the data server.
5 . The high-performance distributed storage apparatus of claim 3 , wherein the high-speed distributed storage controller generates the new file storage requester, updates and stores number of file stripes corresponding to the sequence number in the metadata server, and stores a last chunk number based on a result obtained by applying previous number of file stripes and a first chunk number based on a result obtained by applying the updated number of file stripes.
6 . The high-performance distributed storage apparatus of claim 1 , wherein
when the predetermined remaining storage space of the input buffer is less than a predetermined threshold value, the high-speed distributed storage controller deletes chunks in this sequence from an oldest chunk among pieces of file data stored in the input buffer, and a next chunk number which is to be deleted is non-successive to a deleted chunk number.
7 . A high-performance distributed storage method performed by a high-performance distributed storage apparatus based on a distributed file system including a metadata server and a data server, the high-performance distributed storage method comprising:
receiving and storing, by an input buffer, file data by a chunk unit; outputting, by two or more file storage requesters connected to different data servers, file data chunks stored in the input buffer and transmitting the file data chunks to the connected data servers in parallel; additionally generating, by a high-speed distributed storage controller, a new file storage requester to connect the new file storage requester to a new data server, based on a data input speed of the input buffer and a data output speed at which data is output to the data server; re-setting, by the high-speed distributed storage controller, a file data chunk output sequence for a plurality of file storage requesters including the new file storage requester; and applying, by the plurality of file storage requesters, a result of the re-setting to output and transmit the file data chunks stored in the input buffer to the connected data servers in parallel.
8 . The high-performance distributed storage method of claim 7 , wherein the additionally generating of the new file storage requester to connect the new file storage requester to the new data server comprises:
determining whether the data input speed is faster than the data output speed; when the data input speed is more than a predetermined threshold value faster than the data output speed as a result of the determination, additionally generating the new file storage requester; allocating, by the metadata server, the new data server; connecting the new file storage requester to the allocated new data server.
9 . The high-performance distributed storage method of claim 7 , further comprising: after the receiving and storing of the file data by the chunk unit, by the high-speed distributed storage controller, assigning a sequence number in order for chunks, which are to be output from the input buffer, not to overlap each other for each of the plurality of file storage requesters,
wherein a chunk number which is to be output next for each of file storage requester is set based on a first chunk number in the input buffer, the sequence number, and number of storage processing.
10 . The high-performance distributed storage method of claim 7 , further comprising:
after the additionally generating of the new file storage requester to connect the new file storage requester to the new data server, updating and storing number of file stripes corresponding to the sequence number in the metadata server; and storing a last chunk number based on a result obtained by applying previous number of file stripes and a first chunk number based on a result obtained by applying the updated number of file stripes.
11 . The high-performance distributed storage method of claim 7 , further comprising: after the receiving and storing of the file data by the chunk unit, deleting at least one chunk of the file data stored in the input buffer, based on a remaining storage space of the input buffer.
12 . The high-performance distributed storage method of claim 11 , further comprising: after the deleting of the at least one chunk, by each of the two or more file storage requesters, transmitting and storing, instead of the deleted chunk, a predetermined default data chunk to and in the data server.
13 . The high-performance distributed storage method of claim 11 , wherein
the deleting of the at least one chunk comprises: determining, by the high-speed distributed storage controller, whether the remaining storage space of the input buffer is less than a predetermined threshold value; and when the remaining storage space of the input buffer is less than the predetermined threshold value, by the high-speed distributed storage controller, deleting chunks in this sequence from an oldest chunk among pieces of file data stored in the input buffer, and a next chunk number which is to be deleted is non-successive to a deleted chunk number.Join the waitlist — get patent alerts
Track US2017329797A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.