Bilgisayar Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940

Browse

Now showing 1 - 11 of 11

Adaptive Erasure Codes
(2017) Arslan, Şuayb Şefik; Göker, Turguy
Methods, apparatus, and other embodiments associated with adaptive use of erasure codes for distributed data storage systems are described. One example method includes accessing a message, where the message has a message size, selecting an encoding strategy as a function of the message size, data storage device failure statistics, data storage device wear periods, data storage space constraints, or overhead constraints, and where the encoding strategy includes an erasure code approach, generating an encoded message using the encoding strategy, generating an encoded block, where the encoded block includes the encoded mes sage and metadata associated with the message, and storing the encoded block in the data storage system. Example methods and apparatus may employ Reed Solomon erasure codes or Fountain erasure codes. Example methods and apparatus may display to a user the storage capacity and durability of the data storage system.
Artificial Intelligence Augmented Iterative Product Decoding
(2023) Arslan , Şuayb Şefik; Göker, Turguy
A method for product decoding within a data storage system includes receiving data to be decoded within a first decoder; performing a plurality of decoding iterations to decode the data utilizing a first decoder and a second decoder; and outputting fully decoded data based on the performance of the plurality of decoding iterations. Each of the plurality of decoding iterations includes (i) decoding the data with the first decoder operating at a first decoder operational mode to generate once decoded data; (ii) sending the once decoded data from the first decoder to the second decoder; (iii) receiving error information from the first decoder with an artificial intelligence system; (iv) selecting a second decoder operational mode based at least in part on the error information that is received by the artificial intelligence system; and (v) decoding the once decoded data with the second decoder operating at the second decoder operational mode to generate twice decoded data; and outputting fully decoded data based on the performance of the plurality of decoding iterations.
Data Deduplication With Adaptive Erasure Code Redundancy (us20160013815a1)
(2016) Arslan, Şuayb Şefik; Wideman, Roderick; Lee, Jaewook; Göker, Turguy
Example apparatus and methods combine erasure coding with data deduplication to simultaneously reduce the overall redundancy in data while increasing the redundancy of unique data. In one embodiment, an efficient representation of a data set is produced by deduplication. The efficient rep resentation reduces duplicate data in the data set. Redundancy is then added back into the data set using erasure coding. The redundancy that is added back in adds protection to the unique data associated with the efficient representation. How much redundancy is added back in and what type of redundancy is added back in may be controlled based on an attribute (e.g., value, reference count, symbol size, number of symbols) of the unique data. Decisions concerning how much and what type of redundancy to add back in may be adapted over time based, for example, on observations of the efficiency of the overall system.
Efficient High/Low Energy Zone Solid State Device Data Storage
(2016) Arslan, Şuayb Şefik; Göker, Turguy
Methods and apparatus associated with storing data in high or low energy zones are described. Example apparatus include a data storage system (DSS) that protects a message using an erasure code (EC). A location in the DSS may have an energy efficiency rating or a latency. Example apparatus include circuits that produce EC encoded data that has a likelihood of use, that select a location to store the EC encoded data in the DSS based on the energy efficiency rating, the latency, or the likelihood of use, that store the EC encoded data in the loca tion, and that compute an order of retrieval for EC encoded data stored in the location. The order of retrieval may be based on the energy efficiency rating or the latency. The EC encoded data may also have a priority based on the number of erasures for which the EC corrects.
Erasure Coding Magnetic Tapes for Minimum Latency and Adaptive Parity Protection Feedback
(Patent Ofisi : US, 2019) Goker, Turguy; Arslan, Şuayb Şefik; Le, Hoa; Peng, James; Prigge, Carsten
A magnetic tape device or system can store erasure encoded data that generates a multi-dimensional erasure code corresponding to an erasure encoded object comprising a code-word (CW). The multi-dimensional erasure code enables using a single magnetic tape in response to a random object/file request, and correct for an error within the single magnetic tape without using other tapes. Encoding logic can further utilize other magnetic tapes to generate additional parity tapes that recover data from an error of the single magnetic tape in response to the error satisfying a threshold severity for a reconstruction of the erasure coded object or chunk (s) of the CW. The encoding logic can be controlled, at least in part, by one or more iterative coding processes between multiple erasure code dimensions that are orthogonal to one another.
High/Low Energy Zone Data Storage
(2016) Göker, Turguy; Arslan, Şuayb Şefik
Methods and apparatus associated with storing data in high or low energy zones are described. Example apparatus include a data storage system (DSS) that protects a message using an erasure code (EC). A location in the DSS may have an energy efficiency rating or a latency. Example apparatus include logics that produce an EC that has a likelihood of use, that select a location to store the EC in the DSS based on the energy efficiency rating, the latency, or the likelihood of use, that store the EC in the location, and that compute an order of retrieval for an EC stored in the location. The order of retrieval may be based on the energy efficiency rating or the latency. The EC may also have a priority based on the number of erasures for which the EC corrects.
Joint De-Duplication Coded Distributed Storage
(2018) Arslan, Şuayb Şefik; Turguy, Göker; Wideman, Roderick
Methods and apparatus deduplicate and erasure code a message in a data storage system. One example apparatus includes a first chunking circuit that generates a set of data chunks from a message, an outer precoding circuit that generates a set of precoded data chunks and a set of parity symbols from the set of data chunks, a second chunking circuit that generates a set of chunked parity symbols from the set of parity symbols, a deduplication circuit that gen erates a set of deduplicated data chunks by deduplicating the set of precoded chunks or the set of chunked parity symbols, an unequal error protection (UEP) circuit that generates an encoded message from the set of deduplicated data chunks, and a storage circuit that controls the data storage system to store the set of deduplicated data chunks, the set of parity symbols, or the encoded message.
Joint Multi-Nanopore Sequencing for Reliable Data Retrieval in Nucleic Acid Storage
(2023) Arslan , Şuayb Şefik; Göker, Turguy; Doerner, Don
A nucleic acid storage system (100) that uses nanopore sequencing to read data values chemically embedded in oligonucleotides includes a membrane (102), a voltage source (108), and a nucleic acid strand (110). The membrane (102) has a plurality of nanopores (104) that are stacked upon one another in a multi-nanopore arrangement. The voltage source (108) is configured to direct voltage across the plurality of nanopores (104). The nucleic acid strand (110) including the oligonucleotides is threaded through each of the plurality of nanopores (104) within the membrane (102). A separate base signal (118) is generated from the nucleic acid strand (110) being threaded through each of the plurality of nanopores (104), and Recursive Neural Networks can be used to estimate a signal shape for each oligonucleotide. Recurrent Convolutional Neural Networks and noise predictive data detection algorithms can be used based on the estimated signal shapes to sequence the oligonucleotides.
Network Attached Device for Accessing Removable Storage Media
(Patent Ofisi : US, 2018) Goker, Turguy; Lee, Jaewook; Le, Hoa; Arslan, Şuayb Şefik; Peng, James
Embodiments disclosed herein provide systems, methods, and computer readable media to access data on removable storage media via a network attached access device. In a particular embodiment, a method provides receiving one or more user provided, in the removable storage media access device, receiving data over a packet communication network for storage on a removable storage medium. After receiving the data, the method provides preparing the data for storage on the removable storage medium. After preparing the data, the method provides writing the data to the removable storage medium.
Power Savings in Cold Storage
(2016) Arslan, Şuayb Şefik; Göker, Turguy
Methods and apparatus associated with data cold storage are described. Example apparatus include an array of data storage devices arranged in rows and columns. Columns of the array are orthogonal to rows. A row has an associated row-centric power supply, and a column has an associated column-centric local electronics module (LEM) that controls a data storage device in the column independently of other data storage devices in the array. Example apparatus include logics that control a power mode of a data storage device independently of other data storage devices in the array, that control a power mode of an LEM, that adaptively regulate the level of data stored in a buffer, and that determine whether a data object will be stored in the buffer or stored on a data storage device in the array, based on the probability the data object will be accessed within a threshold period of time.
Removable Media Based Object Store
(2017) Wideman, Roderick; Arslan, Şuayb Şefik; Göker, Turguy
Embodiments disclosed herein provide systems, methods, and computer-readable media to implement an object store with removable storage media. In a particular embodiment, a method provides identifying first data for storage on a first removable storage medium and designating at least a portion of the first data to a first data object. The method further provides determining a first location where to store the first data object in a first value store partition of the first remov able storage medium and writing the first data object to the first location. Also, the method provides writing a first key that identifies the first data object and indicates the first location to a first key store partition of the first removable storage medium.

Browse

Browsing Bilgisayar Mühendisliği Bölümü Koleksiyonu by Publication Category "Other"