US20200244600A1 - Logging infrastructure with time sustain requirements - Google Patents
Logging infrastructure with time sustain requirements Download PDFInfo
- Publication number
- US20200244600A1 US20200244600A1 US16/260,391 US201916260391A US2020244600A1 US 20200244600 A1 US20200244600 A1 US 20200244600A1 US 201916260391 A US201916260391 A US 201916260391A US 2020244600 A1 US2020244600 A1 US 2020244600A1
- Authority
- US
- United States
- Prior art keywords
- buffer
- type
- log data
- buffers
- current type
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9005—Buffering arrangements using dynamic buffer space allocation
-
- 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 OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3006—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3034—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a storage system, e.g. DASD based or network based
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3466—Performance evaluation by tracing or monitoring
- G06F11/3476—Data logging
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/35—Switches specially adapted for specific applications
- H04L49/356—Switches specially adapted for specific applications for storage area networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
Definitions
- a distributed storage system may include a plurality of storage devices (e.g., storage arrays) to provide data storage to a plurality of nodes.
- the plurality of storage devices and the plurality of nodes may be situated in the same physical location, or in one or more physically remote locations.
- the plurality of nodes may be coupled to the storage devices by a high-speed interconnect, such as a switch fabric.
- a method for storing log data in a logging system comprising: instantiating a plurality of buffers in the logging system, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers, each of the type-1 buffers being configured to store log data items from a first type, and each of the type-2 buffers being configured to store log data items from a second type; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from the first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly-designated current type-1 buffer, wherein the current type-1 buffer includes a buffer where log data items from the first type are being streamed by the
- a system for logging data comprising: a memory; and one or more processors operatively coupled to the memory, the one or more processors being configured to perform the operations of: instantiating a plurality of buffers, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers, each of the type-1 buffers being configured to store log data items from a first type, and each of the type-2 buffers being configured to store log data items from a second type; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from the first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly-designated current type-1 buffer, wherein the current type-1
- a non-transitory computer-readable medium configured to store one or more processor-executable instructions, which when executed by at least one processor of a logging system cause the at least one processor to perform the operations of: instantiating a plurality of buffers in the logging system, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers, each of the type-1 buffers being configured to store log data items from a first type, and each of the type-2 buffers being configured to store log data items from a second type; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from the first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly
- FIG. 1 is a block diagram of an example of a distributed storage system, according to aspects of the disclosure
- FIG. 2 is a diagram of an example of a storage array that is part of the distributed storage system of FIG. 1 , according to aspects of the disclosure;
- FIG. 3 is a diagram of an example of a storage server that is part of the storage array of FIG. 2 , according to aspects of the disclosures;
- FIG. 4 is a diagram of an example of a logging system that is part of the distributed storage system of FIG. 1 , according to aspects of the disclosure;
- FIG. 5A is a diagram illustrating the operation of the logging system of FIG. 4 , according to aspects of the disclosure
- FIG. 5B is a diagram of an example of a data structure, according to aspects of the disclosure.
- FIG. 6 is a flowchart of an example of a process, according to aspects of the disclosure.
- FIG. 7 is a flowchart of an example of a process that is associated with the process of FIG. 6 , according to aspects of the disclosure.
- FIG. 8 is a flowchart of an example of a process that is associated with the process of FIG. 6 , according to aspects of the disclosure.
- FIG. 1 is a diagram of an example of a storage system 100 , according to aspects of the disclosure.
- the storage system 100 may include any suitable type of storage system, such as a content-based storage system.
- the storage system 100 may include one or more storage arrays 108 and a logging system 190 coupled to one another via a network switch 110 .
- the logging system 190 may be configured to collect and store log data that is generated by different nodes in the storage arrays 108 . Aspects of the operation of the logging system 190 are discussed further below with respect to FIGS. 2-8 .
- FIG. 2 is a diagram of the storage array 108 of the storage system 100 , according to aspects of the disclosure.
- the storage array 108 may include a plurality of storage servers 210 that are coupled to one another in a network (e.g., a mesh network).
- the network may include an InfiniBand network, a TCP/IP network, and/or any other suitable type of network.
- the storage servers 210 may be configured to service I/O requests (e.g., I/O writes, I/O reads, etc.) that are incoming to the storage system 100 .
- I/O requests e.g., I/O writes, I/O reads, etc.
- FIG. 3 is a diagram of an example of a storage server 210 , which as the numbering suggests is representative of any of the storage servers 210 A-D in the storage array 108 .
- the storage server 210 may include a processor 310 , a memory 320 , a communications interface(s) 330 , and a plurality of storage devices that are operatively coupled to one another.
- the processor 310 may include any of one or more general-purpose processors (e.g., x86 processors, RISC processors, ARM-based processors, etc.), one or more Field Programmable Gate Arrays (FPGAs), one or more application specific circuits (ASICs), and/or any other suitable type of processing circuitry.
- general-purpose processors e.g., x86 processors, RISC processors, ARM-based processors, etc.
- FPGAs Field Programmable Gate Arrays
- ASICs application specific circuits
- the memory 320 may include any suitable type of volatile and/or non-volatile memory.
- the memory 320 may include one or more of a random-access memory (RAM), a dynamic random memory (DRAM), a flash memory, a hard drive (HD), a solid-state drive (SSD), a network accessible storage (NAS), and or any other suitable type of memory device.
- the communications interface(s) 330 may include any suitable type of communications interface, such as one or more Ethernet adapters, one or more Wi-Fi adapters (e.g., 802.1414 adapters), and one or more Long-Term Evolution (LTE) adapters, for example.
- the storage devices 340 are solid state drives (SSD).
- At least one of the storage devices is a spinning hard disk (HD), a flash driver, a Read-Only Memory (ROM), a Random-Access Memory (RAM), and/or any other suitable type of volatile and non-volatile memory.
- HD spinning hard disk
- ROM Read-Only Memory
- RAM Random-Access Memory
- the processor 310 may be configured to execute one or more log sources 316 .
- Each log source 316 may include one or more processor executable instructions that are configured to generate log data items (e.g., execution traces) associated with a particular resource.
- the messages may be generated for various purposes, such as resource monitoring or debugging, for example.
- some of the log sources 316 may be implemented as separate processes or threads, while others may be integrated into processes or threads that perform other functions.
- the log sources 316 are implemented in software, further implementations are possible in which any of the log sources 316 is implemented in hardware or as a combination of software and hardware.
- any given one of the log sources 316 may generate log data items associated with a specific hardware resource of the storage server 210 , such as the processor 310 , the memory 320 , the communications interface(s) 330 , or the storage devices 340 .
- any log data item that is generated by the given log source 316 may include an indication of a metric associated with the operation of the hardware resource (e.g., utilization rate, latency, throughput, etc.) and a timestamp indicating When the log data item is generated.
- any given one of the log sources 316 may be associated with any software resource of the storage server 210 , such as a synchronization object.
- the log source may collect various type of statistical information associated with the synchronization object, such as access rate, amount of time spent waiting for the synchronization object to become available, etc. It will be understood that the present disclosure is not limited to any specific type of data that is collected by any of the log sources 316 .
- FIG. 4 is a diagram of an example of the logging system 190 , according to aspects of the disclosure.
- the logging system 190 may include one or more processors 410 , a volatile memory 420 , a non-volatile memory 430 , I/O device(s) 440 , and communications interface(s) 440 that are operatively coupled to one another.
- the processor 410 may include any of one or more general-purpose processors (e.g., x86 processors, RISC processors, ARM-based processors, etc.), one or more Field Programmable Gate Arrays (FPGAs), one or more application specific circuits (ASICs), and/or any other suitable type of processing circuitry.
- general-purpose processors e.g., x86 processors, RISC processors, ARM-based processors, etc.
- FPGAs Field Programmable Gate Arrays
- ASICs application specific circuits
- the volatile memory 420 may include any suitable type of volatile memory, such as random-access memory (RAM), a dynamic random memory (DRAM).
- the non-volatile memory 430 may include any suitable type of non-volatile memory, such as a flash memory, a hard drive (HD), a solid-state drive (SSD), a network accessible storage (NAS), and or any other suitable type of memory device.
- the I/O device(s) 440 may include any suitable type of input and/or output device, such as one or more mice, one or more keyboards, one or more microphones, or one more display screens, for example.
- the communications interface(s) 450 may include any suitable type of communications interface, such as one or more Ethernet adapters, one or more Wi-Fi adapters (e.g., 802.1414 adapters), and one or more Long-Term Evolution (LTE) adapters, for example.
- Ethernet adapters e.g., 802.1414 adapters
- Wi-Fi adapters e.g., 802.1414 adapters
- LTE Long-Term Evolution
- the non-volatile memory is integrated into the logging system 190 , the present disclosure is not limited thereto. It will be understood that alternative implementations are possible in which the non-volatile memory includes one or more storage devices (e.g., spin drives, SSDs) that are part of another computing unit in the storage system 100 .
- SSDs storage devices
- the non-volatile memory 430 may be configured to store a plurality of buffers 434 in accordance with a storage quota.
- each of the buffers 434 is implemented as a separate log file.
- any of the buffers 434 can be implemented as another type of data structure (or portion thereof). Stated succinctly, the present disclosure is not limited to any specific implementation of the buffers 434 .
- the storage quota may define a cap on the maximum amount of log data that can be stored in the non-volatile memory 430 , effectively limiting the maximum number of buffers 434 that can be present in the non-volatile memory 430 at any given time instant.
- the storage quota may be less than or equal to the total capacity of the non-volatile memory 430 .
- the storage quota may effectively limit the maximum number of buffers that can be instantiated in the non-volatile memory 430 to two-hundred.
- the storage quota may be considered to be reached when the difference between the combined size of all buffers 434 and the storage quota is less than the size of a buffer 434 . Put differently, in some implementations, the storage quota may be reached when allocating an additional buffer 434 in the non-volatile memory 430 may cause the storage quota to be exceeded.
- the buffers 434 may have at least two different designations. Specifically, one or more of the buffers 434 may be designated as type-1 buffers, and one or more of the buffers 434 may be designated as type-2 buffers. Throughout the present disclosure, type-1 buffers are referred to as high-priority buffers 434 A, and type-2 buffers are referred to as low-priority buffers 434 B. Although throughout the disclosure buffers are classified as “high-priority” and low-priority”, it will be understood that the present disclosure is not limited to any specific taxonomy for buffer classification. In this regard, it will be understood that alternative implementations are possible in which type-1 and type-2 buffers are distinguished from an another based on a characteristic other than priority.
- the high-priority buffers 434 A may be configured to store high-priority log data
- the low-priority buffers 434 B may be configured to store low-priority log data.
- Which log data is designated as high-priority and low-priority is implementation-specific, and the present disclosure is not limited to any specific type of data being designated as high-priority or low-priority.
- the present disclosure is not limited to any specific taxonomy for log data classification. In this regard, it will be understood that alternative implementations are possible in which different types of log data are distinguished from one another based on a characteristic other than priority.
- the high-priority buffers 434 A may have a storage life that is guaranteed, whereas the low-priority buffers 434 B may not.
- the term “storage life of a buffer” shall refer to a period for which the contents of the buffer (e.g., one or more log data items) remains stored in the non-volatile memory 430 .
- the storage life of this buffer may be said to have expired.
- the storage lite of the buffer may be said not to have expired yet.
- the designation of any of the low-priority buffers 434 B may be changed to high-priority.
- any low-priority log data items that are stored in the given low-priority buffer may be deleted and replaced with high-priority log data items.
- the high-priority buffers 434 A and the low-priority buffers 434 B may be implemented using the same type of data structure. Using the same type of data structure is advantageous because it allows the designation of low-priority buffers to be changed on an as-needed basis.
- the buffers 434 have a fixed size, it will be understood that the present disclosure is not limited thereto. In this regard, it will be understood that alternative implementations are possible in which any of the high-priority buffers 434 A and the low-priority buffers 434 B has a variable size.
- the volatile memory 420 may include a temporary storage 421 , a high-priority pointer 422 , and a low-priority pointer 423 .
- the temporary storage 421 may include any suitable portion of the volatile memory 420 where log data items are temporarily stored before being routed to one of the buffers 434 .
- the high-priority pointer 422 may include any suitable number or alphanumerical string that identifies a current high-priority buffer of the logging system 190 .
- the low-priority pointer 423 may include any suitable number or alphanumerical string that identifies a current low-priority buffer of the logging system 190 .
- the current high-priority buffer of the logging system 190 may include one of the high-priority buffers 430 A where incoming high-priority log data items are being streamed.
- the current low-priority buffer of the logging system 190 may include one of the low-priority buffers 430 B where incoming low-priority log data items are being streamed.
- the current high-priority buffer and the current low-priority buffer can be used as follows:
- the storage system may receive log data items, and classify the log data items as either high-priority log data items or low-priority log data items.
- Log data items that are classified as high-priority data items may be routed to the high-priority buffer 434 A that is currently being pointed to by the high-priority pointer 422 (i.e., the current high-priority buffer of the logging system 190 ).
- Log data items that are classified as low-priority data items may be routed to the low-priority buffer 434 B that is currently being pointed to by the low-priority pointer 423 (i.e., the current low-priority buffer of the logging system 190 ).
- the low-priority buffer of the logging system 190 becomes full, the value of the low-priority pointer 423 may be changed to point to another buffer 434 , effectively designating the other buffer as a current low-priority buffer.
- the value of the high-priority pointer 422 may be changed to point to another buffer 434 , effectively designating the other buffer as a current high-priority buffer.
- the processor 410 may be configured to execute a log data receiver 412 and a log data filter 414 .
- the log data receiver 412 may be configured to receive log data items that are generated by various log sources 316 in the storage system 100 and store the received log data items in the temporary storage 421 .
- the log data filter 414 may be configured to retrieve log data items from the temporary storage 421 , classify each of the data items as either a low-priority data item or a high-priority data item in accordance with one or more filtering rules 416 , and store the log data item in one of the current low-priority buffer or the current high-priority buffer, depending on the outcome of the classification.
- any of the filtering rules 416 may, at least in part, specify a criterion for classifying a particular log data item as either high-priority or low-priority.
- any of the filtering rules may specify a portion of a log data item (e.g., a field) that contains an indication of whether a log data item is a high-priority data item or a low-priority data item.
- any of the filtering rules may identify one or more types of log data that are considered high-priority.
- any of the filtering rules may identify one or more types of log data that are considered low-priority.
- the present disclosure is not limited to any specific implementation of the log data filter 414 and filtering rules 416 .
- the log data receiver 412 and the log data filter 414 are implemented in software, it will be understood that alternative implementations are possible in which any of the log data receiver 412 and the log data filter 414 is implemented in hardware or as a combination of hardware and software.
- FIG. 5A is a schematic diagram illustrating aspects of the operation of the logging system 190 , according to aspects of the disclosure.
- the log data receiver 412 may receive both low-priority and high-priority log data items and store the log data items into the temporary storage 421 .
- the log data items may be generated by any log source 316 in the storage system 100 .
- the log data filter 414 may retrieve each of the log data items that are stored in the temporary storage 421 . Next, the log data filter 414 may classify each retrieved log data item as either high-priority or low-priority.
- Log data items that are classified as high-priority may be written, by the log data filter 414 , to a first data stream 502 and log data items that are classified as low-priority may be written, by the log data filter 414 , to a second data stream 504 .
- the first data stream 502 may be associated with the current high-priority buffer of the logging system (e.g., the high-priority buffer 434 A that is pointed to by the high-priority pointer 422 ), such that writing log data items to the first data stream 502 results in the log data items being stored into the current high-priority log buffer.
- the second data stream 504 may be associated with the current low-priority buffer (e.g., the low-priority buffer 434 B that is pointed to by the low-priority pointer 423 ), such that writing log data items to the second data stream 504 results in the log data items being stored into the current low-priority log buffer.
- the current low-priority buffer e.g., the low-priority buffer 434 B that is pointed to by the low-priority pointer 423
- FIG. 5B illustrates an example of a data structure 510 that can be used to implement any of the high-priority buffers 434 A and low-priority buffers 434 B.
- the data structure 510 may include a priority designation 512 , a timestamp 514 , and a body 518 .
- the priority designation 512 may include an indication of whether the data structure 510 is configured to operate as a high-priority buffer or a low-priority buffer.
- the timestarnp 514 may include any suitable identifier of time, and it can be used for calculating whether the storage life of the data structure 510 has expired.
- the timestamp 514 may include an indication of a time when data structure 510 was last updated.
- the timestamp 514 may indicate a time when the data structure 510 was designated as a current high/low-priority buffer.
- the body 518 of the data structure 510 may include one or more log data items that have been stored in the data structure 510 .
- the priority designation 512 is stored internally within the data structure 510 , it will be understood that alternative implementations are possible in which the priority designation 512 is stored externally to the data structure 510 . In such implementations, a separate mapping structure may be stored in the memory of the logging system 190 , which maps a respective identifier of each of the buffers 434 to the priority designation of this buffer. Stated succinctly, the present disclosure is not limited to any specific method for maintaining metadata associated with the buffers 434 . Furthermore, although in the present example the metadata associated with data structure 510 includes a priority designation and a timestamp, it will be understood that the present disclosure is not limited to maintaining any specific type of metadata for the data structure 510 .
- FIG. 6 is a flowchart of an example of a process 600 for recording log data, according to aspects of the disclosure.
- a log data item is received by the log data receiver 412 of the logging system 190 and placed in the temporary storage 421 .
- the log data item is retrieved from the temporary storage 421 by the log data filter 414 .
- the log data item is classified, by the log data filter 414 , as either a high-priority log data item or a low-priority log data item. If the log data item is classified as a low-priority data item, the process 600 proceeds to step 608 .
- step 610 a determination is made if the current low-priority buffer of the logging system 190 is full. If the current low-priority buffer is full, the process 600 proceeds to step 612 . Otherwise, if the current low-priority buffer is not full, step 612 is skipped and the process 600 proceeds to step 614 .
- step 612 another buffer 434 is designated as a current low-priority buffer. Step 612 is discussed in further detail with respect to FIG. 7 .
- step 614 the log data item is stored in the current low-priority buffer of the logging system 190 .
- step 614 the process 600 returns to step 602 , and steps 602 - 618 are executed for another log data item that is received at the logging system 190 .
- step 610 a determination is made if the current high-priority buffer of the logging system is full. If the current high-priority buffer is full, the process 600 proceeds to step 616 . Otherwise, if the current high-priority buffer is not full, step 616 is skipped and the process 600 proceeds to step 618 .
- another buffer 434 is designated as a current high-priority buffer. Step 616 is discussed in further detail with respect to FIG. 8 .
- the log data item is stored in the current high-priority buffer of the logging system 190 .
- FIG. 7 is a diagram of an example of a process 700 for designating a buffer as a current low-priority buffer, as specified by step 612 of the process 600 , according to aspects of the disclosure.
- the storage quota may prescribe the maximum amount of log data that can be stored in the non-volatile memory 430 at any given time. If the storage quota is not reached, the process 700 proceeds to step 704 . Otherwise, if the storage quota is reached, the process 700 proceeds to step 708 .
- a new buffer is instantiated.
- instantiating a new buffer may include instantiating a new data structure 510 .
- the logging system 190 is configured to use the newly-instantiated buffer as a current low-priority buffer.
- configuring the logging system 190 to use the newly-instantiated buffer as a current low-priority buffer may include changing the value of the low-priority pointer 423 to point to the newly-instantiated buffer.
- configuring the logging system 190 to use the newly-instantiated low-priority buffer as a current low-priority buffer may include generating new metadata for the newly-instantiated buffer.
- generating new metadata may include setting the priority designation of the newly-instantiated buffer to indicate that the newly-instantiated buffer is being used as a low-priority buffer.
- the oldest one of all low-priority buffers 434 B that are stored in the non-volatile memory 430 is identified.
- the oldest low-priority buffer may be identified based on the respective timestamps of the low-priority buffers 434 B that are stored in the non-volatile memory 430 .
- the logging system 190 is configured to use the oldest low-priority buffer as a current low-priority buffer.
- configuring the logging system 190 to use the oldest low-priority buffer as a current low-priority buffer may include changing the value of the low-priority pointer 423 to point to the oldest low-priority buffer.
- configuring the logging system 190 to use the oldest low-priority buffer as a current low-priority buffer may include generating new metadata for the oldest low-priority buffer.
- FIG. 8 is a diagram of an example of a process 800 for designating a buffer as a current high-priority buffer, as specified by step 614 of the process 600 , according to aspects of the disclosure.
- the storage quota may prescribe the maximum amount of log data that can be stored in the non-volatile memory 430 at any given time. If the storage quota is not reached, the process 800 proceeds to step 804 . Otherwise, if the storage quota is reached, the process 800 proceeds to step 808 .
- a new buffer is instantiated.
- instantiating the new buffer may include instantiating a new data structure 510 .
- the logging system 190 is configured to use the newly-instantiated buffer as a current high-priority buffer.
- configuring the logging system 190 to use the newly-instantiated buffer as a current high-priority buffer may include changing the value of the high-priority pointer 422 to point to the newly-instantiated buffer.
- configuring the logging system 190 to use the newly-instantiated buffer as a current high-priority buffer may include generating new metadata for the newly-instantiated buffer.
- generating new metadata may include setting the priority designation of the newly-instantiated buffer to indicate that the newly-instantiated buffer is being used as a high-priority buffer.
- the oldest one of all high-priority buffers 434 A that are stored in the non-volatile memory 430 is identified.
- the oldest high-priority buffer may be identified based on the respective timestamps of the high-priority buffers 434 A that are stored in the non-volatile memory 430 .
- the determination may be made by retrieving from the memory of the logging system 190 an indication of a storage life associated with the oldest high priority buffer and using a timestamp (e.g., timestamp 614 ) of the oldest high-priority buffer to determine, based on the retrieved indication, if the oldest high-priority buffer has expired. If the storage life of the oldest high-priority buffer 434 A has expired, the process proceeds to step 812 . Otherwise, if the storage life of the oldest high-priority buffer 434 A has not expired, the process 800 proceeds to step 816 .
- the logging system 190 is configured to use the oldest high-priority buffer as a current high-priority buffer.
- configuring the logging system 190 to use the oldest high-priority buffer as a current high-priority buffer may include changing the value of the high-priority pointer 422 to point to the oldest high-priority buffer. Additionally or alternatively, in some implementations, configuring the logging system 190 to use the oldest high-priority buffer as a current high-priority buffer may include generating new metadata for the oldest high-priority buffer.
- the oldest one of all low-priority buffers 434 B that are stored in the non-volatile memory 430 is identified.
- the oldest low-priority buffer may be identified based on the respective timestamps of the low-priority buffers 434 B that are stored in the non-volatile memory 430 .
- the logging system 190 is configured to use the oldest low-priority buffer as a current high-priority buffer.
- configuring the logging system 190 to use the oldest low-priority buffer as a current high-priority buffer may include changing the value of the high-priority pointer 422 to point to the oldest low-priority buffer. Additionally or alternatively, in some implementations, configuring the logging system 190 to use the oldest low-priority buffer as a current high-priority buffer may include generating new metadata for the oldest low-priority buffer.
- generating new metadata for the oldest low-priority buffer may include changing the priority designation of the oldest low-priority buffer from a first value to a second value (e.g., from a “low-priority” value to a “high-priority” value).
- Changing the priority designation of the oldest low-priority buffer results in promoting the oldest low-priority buffer to high-priority status. Doing so may increase the amount of available space to store high-priority log data at the expense of space available to store low-priority log data, is advantageous because it may permit the logging system to store new high-priority log data items while maintaining existing high-priority log data items for their guaranteed storage life.
- FIGS. 1-8 provide an example of a storage system that is configured to distinguish between high-priority and low-priority log data and keep the high-priority log data longer.
- the logging system 190 is configured to guarantee the storage life of high-priority log data at the expense of low-priority log data by promoting low-priority buffers to a high-priority status when the logging system 190 runs out of storage space to instantiate new buffers, and none of the present high-priority buffers has expired.
- This arrangement is advantageous in situations where there are limited resources for storing log data because it provides system administrators with full control over which data survives for a longer time period.
- FIGS. 1-8 provide an example of one specific implementation of the logging system 190 .
- the present disclosure is not limited to the implementation shown in FIGS. 1-8 .
- the logging system 190 stores the current high-priority and low-priority buffers in the volatile memory 420 .
- the current low-priority buffer becomes full, its contents may be transferred to another buffer, and subsequently overwritten with new low-priority log data. Transferring the contents of the current low-priority buffer may include detecting whether there is sufficient storage space in the non-volatile memory 430 to allocate a new buffer (e.g., detecting whether a storage quota is reached).
- a new low-priority buffer may be created in the non-volatile memory 430 , and the contents of the current low-priority buffer may be transferred into the new low-priority buffer. Otherwise, when the storage space is insufficient, the oldest low-priority buffer that is stored in the non-volatile memory 430 may be selected, and its contents may be replaced with the contents of the current low-priority buffer.
- Transferring the contents of the current high-priority buffer may include detecting whether there is sufficient storage space in the non-volatile memory 430 to allocate a new buffer (e.g., detecting whether a storage quota is reached).
- a new high-priority buffer may be created in the non-volatile memory 430 , and the contents of the current low-priority buffer may be transferred into the new high-priority buffer. Otherwise, when the storage space is insufficient, the oldest high-priority buffer stored in the non-volatile memory 430 may be identified.
- the contents of oldest high-priority buffer may be replaced with the contents of the current high-priority buffer.
- the oldest low-priority buffer that is stored in the non-volatile memory 430 may be identified. Afterwards, the oldest low-priority buffer may be promoted to a high-priority designation, and its contents may be replaced with the contents of the current high-priority buffer.
- FIGS. 6-8 are provided as an example only. It will be understood that at least some of the steps discussed with respect to FIGS. 6-8 can be performed in a different order or altogether omitted. While illustrative embodiments have been described with respect to processes of circuits, described embodiments may be implemented as a single integrated circuit, a multi-chip module, a single card, or a multi-card circuit pack. Further, as would be apparent to one skilled in the art, various functions of circuit elements may also be implemented as processing blocks in a software program. Such software may be employed in, for example, a digital signal processor, micro-controller, or general-purpose computer. Thus, described embodiments may be implemented in hardware, a combination of hardware and software, software, or software in execution by one or more processors.
- Some embodiments may be implemented in the form of methods and apparatuses for practicing those methods. Described embodiments may also be implemented in the form of program code, for example, stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium or carrier, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation.
- a non-transitory machine-readable medium may include but is not limited to tangible media, such as magnetic recording media including hard drives, floppy diskettes, and magnetic tape media, optical recording media including compact discs (CDs) and digital versatile discs (DVDs), solid-state memory such as flash memory, hybrid magnetic and solid-state memory, non-volatile memory, volatile memory, and so forth, but does not include a transitory signal per se.
- the program code When embodied in a non-transitory machine-readable medium, and the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the method.
- processing devices may include, for example, a general-purpose microprocessor, a digital signal processor (DSP), a reduced instruction set computer (RISC), a complex instruction set computer (CISC), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a programmable logic array (PLA), a microcontroller, an embedded controller, a multi-core processor, and/or others, including combinations of the above.
- DSP digital signal processor
- RISC reduced instruction set computer
- CISC complex instruction set computer
- ASIC application specific integrated circuit
- FPGA field programmable gate array
- PDA programmable logic array
- microcontroller an embedded controller
- multi-core processor and/or others, including combinations of the above.
- Described embodiments may also be implemented in the form of a bitstream or other sequence of signal values electrically or optically transmitted through a medium, stored magnetic-field variations in a magnetic recording medium, etc., generated using a method and/or an apparatus as recited in the claims.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Quality & Reliability (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Computer Hardware Design (AREA)
- Debugging And Monitoring (AREA)
Abstract
Description
- A distributed storage system may include a plurality of storage devices (e.g., storage arrays) to provide data storage to a plurality of nodes. The plurality of storage devices and the plurality of nodes may be situated in the same physical location, or in one or more physically remote locations. The plurality of nodes may be coupled to the storage devices by a high-speed interconnect, such as a switch fabric.
- This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
- According to aspects of the disclosure, a method is provided for storing log data in a logging system, comprising: instantiating a plurality of buffers in the logging system, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers, each of the type-1 buffers being configured to store log data items from a first type, and each of the type-2 buffers being configured to store log data items from a second type; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from the first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly-designated current type-1 buffer, wherein the current type-1 buffer includes a buffer where log data items from the first type are being streamed by the logging system.
- According to aspects of the disclosure, a system for logging data is provided, comprising: a memory; and one or more processors operatively coupled to the memory, the one or more processors being configured to perform the operations of: instantiating a plurality of buffers, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers, each of the type-1 buffers being configured to store log data items from a first type, and each of the type-2 buffers being configured to store log data items from a second type; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from the first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly-designated current type-1 buffer, wherein the current type-1 buffer includes a buffer where log data items from the first type are being streamed by the logging system.
- According to aspects of the disclosure, a non-transitory computer-readable medium is provided that is configured to store one or more processor-executable instructions, which when executed by at least one processor of a logging system cause the at least one processor to perform the operations of: instantiating a plurality of buffers in the logging system, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers, each of the type-1 buffers being configured to store log data items from a first type, and each of the type-2 buffers being configured to store log data items from a second type; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from the first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly-designated current type-1 buffer, wherein the current type-1 buffer includes a buffer where log data items from the first type are being streamed by the logging system.
- Objects, aspects, features, and advantages of embodiments disclosed herein will become more fully apparent from the following detailed description, the appended claims, and the accompanying drawings in which like reference numerals identify similar or identical elements. Reference numerals that are introduced in the specification in association with a drawing figure may be repeated in one or more subsequent figures without additional description in the specification in order to provide context for other features. For clarity, not every element may be labeled in every figure. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating embodiments, principles, and concepts. The drawings are not meant to limit the scope of the claims included herewith.
-
FIG. 1 is a block diagram of an example of a distributed storage system, according to aspects of the disclosure; -
FIG. 2 is a diagram of an example of a storage array that is part of the distributed storage system ofFIG. 1 , according to aspects of the disclosure; -
FIG. 3 is a diagram of an example of a storage server that is part of the storage array ofFIG. 2 , according to aspects of the disclosures; -
FIG. 4 is a diagram of an example of a logging system that is part of the distributed storage system ofFIG. 1 , according to aspects of the disclosure; -
FIG. 5A is a diagram illustrating the operation of the logging system ofFIG. 4 , according to aspects of the disclosure; -
FIG. 5B is a diagram of an example of a data structure, according to aspects of the disclosure; -
FIG. 6 is a flowchart of an example of a process, according to aspects of the disclosure; -
FIG. 7 is a flowchart of an example of a process that is associated with the process ofFIG. 6 , according to aspects of the disclosure; and -
FIG. 8 is a flowchart of an example of a process that is associated with the process ofFIG. 6 , according to aspects of the disclosure. -
FIG. 1 is a diagram of an example of astorage system 100, according to aspects of the disclosure. Thestorage system 100 may include any suitable type of storage system, such as a content-based storage system. In some implementations, thestorage system 100 may include one ormore storage arrays 108 and alogging system 190 coupled to one another via anetwork switch 110. As is further discussed below, thelogging system 190, may be configured to collect and store log data that is generated by different nodes in thestorage arrays 108. Aspects of the operation of thelogging system 190 are discussed further below with respect toFIGS. 2-8 . -
FIG. 2 is a diagram of thestorage array 108 of thestorage system 100, according to aspects of the disclosure. Thestorage array 108 may include a plurality ofstorage servers 210 that are coupled to one another in a network (e.g., a mesh network). The network may include an InfiniBand network, a TCP/IP network, and/or any other suitable type of network. Thestorage servers 210 may be configured to service I/O requests (e.g., I/O writes, I/O reads, etc.) that are incoming to thestorage system 100. -
FIG. 3 is a diagram of an example of astorage server 210, which as the numbering suggests is representative of any of thestorage servers 210A-D in thestorage array 108. As illustrated, thestorage server 210 may include aprocessor 310, amemory 320, a communications interface(s) 330, and a plurality of storage devices that are operatively coupled to one another. Theprocessor 310 may include any of one or more general-purpose processors (e.g., x86 processors, RISC processors, ARM-based processors, etc.), one or more Field Programmable Gate Arrays (FPGAs), one or more application specific circuits (ASICs), and/or any other suitable type of processing circuitry. Thememory 320 may include any suitable type of volatile and/or non-volatile memory. In some implementations, thememory 320 may include one or more of a random-access memory (RAM), a dynamic random memory (DRAM), a flash memory, a hard drive (HD), a solid-state drive (SSD), a network accessible storage (NAS), and or any other suitable type of memory device. The communications interface(s) 330 may include any suitable type of communications interface, such as one or more Ethernet adapters, one or more Wi-Fi adapters (e.g., 802.1414 adapters), and one or more Long-Term Evolution (LTE) adapters, for example. In the present example, the storage devices 340 are solid state drives (SSD). However, alternative implementations are possible, in which at least one of the storage devices is a spinning hard disk (HD), a flash driver, a Read-Only Memory (ROM), a Random-Access Memory (RAM), and/or any other suitable type of volatile and non-volatile memory. - According to the present example, the
processor 310 may be configured to execute one ormore log sources 316. Eachlog source 316 may include one or more processor executable instructions that are configured to generate log data items (e.g., execution traces) associated with a particular resource. The messages may be generated for various purposes, such as resource monitoring or debugging, for example. According to aspects of the disclosure, some of thelog sources 316 may be implemented as separate processes or threads, while others may be integrated into processes or threads that perform other functions. Although in the present example, thelog sources 316 are implemented in software, further implementations are possible in which any of thelog sources 316 is implemented in hardware or as a combination of software and hardware. - In some implementations, any given one of the
log sources 316 may generate log data items associated with a specific hardware resource of thestorage server 210, such as theprocessor 310, thememory 320, the communications interface(s) 330, or the storage devices 340. In such instances, any log data item that is generated by the givenlog source 316 may include an indication of a metric associated with the operation of the hardware resource (e.g., utilization rate, latency, throughput, etc.) and a timestamp indicating When the log data item is generated. Additionally or alternatively, in some implementations, any given one of thelog sources 316 may be associated with any software resource of thestorage server 210, such as a synchronization object. In such implementations, the log source may collect various type of statistical information associated with the synchronization object, such as access rate, amount of time spent waiting for the synchronization object to become available, etc. It will be understood that the present disclosure is not limited to any specific type of data that is collected by any of thelog sources 316. -
FIG. 4 is a diagram of an example of thelogging system 190, according to aspects of the disclosure. As illustrated, thelogging system 190 may include one ormore processors 410, avolatile memory 420, anon-volatile memory 430, I/O device(s) 440, and communications interface(s) 440 that are operatively coupled to one another. Theprocessor 410 may include any of one or more general-purpose processors (e.g., x86 processors, RISC processors, ARM-based processors, etc.), one or more Field Programmable Gate Arrays (FPGAs), one or more application specific circuits (ASICs), and/or any other suitable type of processing circuitry. Thevolatile memory 420 may include any suitable type of volatile memory, such as random-access memory (RAM), a dynamic random memory (DRAM). Thenon-volatile memory 430 may include any suitable type of non-volatile memory, such as a flash memory, a hard drive (HD), a solid-state drive (SSD), a network accessible storage (NAS), and or any other suitable type of memory device. The I/O device(s) 440 may include any suitable type of input and/or output device, such as one or more mice, one or more keyboards, one or more microphones, or one more display screens, for example. The communications interface(s) 450 may include any suitable type of communications interface, such as one or more Ethernet adapters, one or more Wi-Fi adapters (e.g., 802.1414 adapters), and one or more Long-Term Evolution (LTE) adapters, for example. Although in the present example the non-volatile memory is integrated into thelogging system 190, the present disclosure is not limited thereto. It will be understood that alternative implementations are possible in which the non-volatile memory includes one or more storage devices (e.g., spin drives, SSDs) that are part of another computing unit in thestorage system 100. - The
non-volatile memory 430 may be configured to store a plurality of buffers 434 in accordance with a storage quota. According to the present example, each of the buffers 434 is implemented as a separate log file. However, it will be understood that alternative implementations are possible in which any of the buffers 434 can be implemented as another type of data structure (or portion thereof). Stated succinctly, the present disclosure is not limited to any specific implementation of the buffers 434. - The storage quota may define a cap on the maximum amount of log data that can be stored in the
non-volatile memory 430, effectively limiting the maximum number of buffers 434 that can be present in thenon-volatile memory 430 at any given time instant. The storage quota may be less than or equal to the total capacity of thenon-volatile memory 430. For example, in some implementations, when the storage quota is 200 MB and each of the buffers 434 is 1 MB in size, the storage quota may effectively limit the maximum number of buffers that can be instantiated in thenon-volatile memory 430 to two-hundred. In some implementations, the storage quota may be considered to be reached when the difference between the combined size of all buffers 434 and the storage quota is less than the size of a buffer 434. Put differently, in some implementations, the storage quota may be reached when allocating an additional buffer 434 in thenon-volatile memory 430 may cause the storage quota to be exceeded. - The buffers 434 may have at least two different designations. Specifically, one or more of the buffers 434 may be designated as type-1 buffers, and one or more of the buffers 434 may be designated as type-2 buffers. Throughout the present disclosure, type-1 buffers are referred to as high-
priority buffers 434A, and type-2 buffers are referred to as low-priority buffers 434B. Although throughout the disclosure buffers are classified as “high-priority” and low-priority”, it will be understood that the present disclosure is not limited to any specific taxonomy for buffer classification. In this regard, it will be understood that alternative implementations are possible in which type-1 and type-2 buffers are distinguished from an another based on a characteristic other than priority. - The high-
priority buffers 434A may be configured to store high-priority log data, and the low-priority buffers 434B may be configured to store low-priority log data. Which log data is designated as high-priority and low-priority is implementation-specific, and the present disclosure is not limited to any specific type of data being designated as high-priority or low-priority. Moreover, although in the present example log data is classified as high-priority and low-priority, the present disclosure is not limited to any specific taxonomy for log data classification. In this regard, it will be understood that alternative implementations are possible in which different types of log data are distinguished from one another based on a characteristic other than priority. - The high-
priority buffers 434A may have a storage life that is guaranteed, whereas the low-priority buffers 434B may not. As used throughout the present disclosure, the term “storage life of a buffer” shall refer to a period for which the contents of the buffer (e.g., one or more log data items) remains stored in thenon-volatile memory 430. For example, when a buffer has remained in storage, since its last update, for a period that is longer than its storage life, the storage life of this buffer may be said to have expired. As another example, when a buffer has been stored, since its last update, for a period that is shorter than its storage life, the storage lite of the buffer may be said not to have expired yet. As is further discussed below, when thelogging system 190 begins to run low on space for storing high-priority data, and none of the high-priority buffers 434A has expired yet, the designation of any of the low-priority buffers 434B may be changed to high-priority. When the designation of a given buffer is changed from low-priority to high-priority, any low-priority log data items that are stored in the given low-priority buffer may be deleted and replaced with high-priority log data items. - The high-
priority buffers 434A and the low-priority buffers 434B may be implemented using the same type of data structure. Using the same type of data structure is advantageous because it allows the designation of low-priority buffers to be changed on an as-needed basis. Although in the present example the buffers 434 have a fixed size, it will be understood that the present disclosure is not limited thereto. In this regard, it will be understood that alternative implementations are possible in which any of the high-priority buffers 434A and the low-priority buffers 434B has a variable size. - The
volatile memory 420 may include atemporary storage 421, a high-priority pointer 422, and a low-priority pointer 423. Thetemporary storage 421 may include any suitable portion of thevolatile memory 420 where log data items are temporarily stored before being routed to one of the buffers 434. The high-priority pointer 422 may include any suitable number or alphanumerical string that identifies a current high-priority buffer of thelogging system 190. The low-priority pointer 423 may include any suitable number or alphanumerical string that identifies a current low-priority buffer of thelogging system 190. The current high-priority buffer of thelogging system 190 may include one of the high-priority buffers 430A where incoming high-priority log data items are being streamed. And the current low-priority buffer of thelogging system 190 may include one of the low-priority buffers 430B where incoming low-priority log data items are being streamed. - The current high-priority buffer and the current low-priority buffer can be used as follows: The storage system may receive log data items, and classify the log data items as either high-priority log data items or low-priority log data items. Log data items that are classified as high-priority data items may be routed to the high-
priority buffer 434A that is currently being pointed to by the high-priority pointer 422 (i.e., the current high-priority buffer of the logging system 190). Log data items that are classified as low-priority data items may be routed to the low-priority buffer 434B that is currently being pointed to by the low-priority pointer 423 (i.e., the current low-priority buffer of the logging system 190). When the current low-priority buffer of thelogging system 190 becomes full, the value of the low-priority pointer 423 may be changed to point to another buffer 434, effectively designating the other buffer as a current low-priority buffer. Similarly, when the current high-priority buffer of thelogging system 190 becomes full, the value of the high-priority pointer 422 may be changed to point to another buffer 434, effectively designating the other buffer as a current high-priority buffer. - The
processor 410 may be configured to execute alog data receiver 412 and alog data filter 414. Thelog data receiver 412 may be configured to receive log data items that are generated byvarious log sources 316 in thestorage system 100 and store the received log data items in thetemporary storage 421. The log data filter 414 may be configured to retrieve log data items from thetemporary storage 421, classify each of the data items as either a low-priority data item or a high-priority data item in accordance with one ormore filtering rules 416, and store the log data item in one of the current low-priority buffer or the current high-priority buffer, depending on the outcome of the classification. - Any of the filtering rules 416 may, at least in part, specify a criterion for classifying a particular log data item as either high-priority or low-priority. In some implementations, any of the filtering rules may specify a portion of a log data item (e.g., a field) that contains an indication of whether a log data item is a high-priority data item or a low-priority data item. Additionally or alternatively, in some implementations, any of the filtering rules may identify one or more types of log data that are considered high-priority. Additionally or alternatively, in some implementations, any of the filtering rules may identify one or more types of log data that are considered low-priority. It will be understood that the present disclosure is not limited to any specific implementation of the log data filter 414 and filtering rules 416. Although in the present example, the
log data receiver 412 and the log data filter 414 are implemented in software, it will be understood that alternative implementations are possible in which any of thelog data receiver 412 and the log data filter 414 is implemented in hardware or as a combination of hardware and software. -
FIG. 5A is a schematic diagram illustrating aspects of the operation of thelogging system 190, according to aspects of the disclosure. In operation, thelog data receiver 412 may receive both low-priority and high-priority log data items and store the log data items into thetemporary storage 421. The log data items may be generated by anylog source 316 in thestorage system 100. The log data filter 414 may retrieve each of the log data items that are stored in thetemporary storage 421. Next, the log data filter 414 may classify each retrieved log data item as either high-priority or low-priority. Log data items that are classified as high-priority may be written, by the log data filter 414, to afirst data stream 502 and log data items that are classified as low-priority may be written, by the log data filter 414, to asecond data stream 504. Thefirst data stream 502 may be associated with the current high-priority buffer of the logging system (e.g., the high-priority buffer 434A that is pointed to by the high-priority pointer 422), such that writing log data items to thefirst data stream 502 results in the log data items being stored into the current high-priority log buffer. Thesecond data stream 504 may be associated with the current low-priority buffer (e.g., the low-priority buffer 434B that is pointed to by the low-priority pointer 423), such that writing log data items to thesecond data stream 504 results in the log data items being stored into the current low-priority log buffer. -
FIG. 5B illustrates an example of adata structure 510 that can be used to implement any of the high-priority buffers 434A and low-priority buffers 434B. As illustrated, thedata structure 510 may include apriority designation 512, atimestamp 514, and abody 518. Thepriority designation 512 may include an indication of whether thedata structure 510 is configured to operate as a high-priority buffer or a low-priority buffer. Thetimestarnp 514 may include any suitable identifier of time, and it can be used for calculating whether the storage life of thedata structure 510 has expired. In some implementations, thetimestamp 514 may include an indication of a time whendata structure 510 was last updated. Additionally or alternatively, in some implementations, thetimestamp 514 may indicate a time when thedata structure 510 was designated as a current high/low-priority buffer. Thebody 518 of thedata structure 510 may include one or more log data items that have been stored in thedata structure 510. - Although in the present example the
priority designation 512 is stored internally within thedata structure 510, it will be understood that alternative implementations are possible in which thepriority designation 512 is stored externally to thedata structure 510. In such implementations, a separate mapping structure may be stored in the memory of thelogging system 190, which maps a respective identifier of each of the buffers 434 to the priority designation of this buffer. Stated succinctly, the present disclosure is not limited to any specific method for maintaining metadata associated with the buffers 434. Furthermore, although in the present example the metadata associated withdata structure 510 includes a priority designation and a timestamp, it will be understood that the present disclosure is not limited to maintaining any specific type of metadata for thedata structure 510. -
FIG. 6 is a flowchart of an example of aprocess 600 for recording log data, according to aspects of the disclosure. Atstep 602, a log data item is received by thelog data receiver 412 of thelogging system 190 and placed in thetemporary storage 421. Atstep 604, the log data item is retrieved from thetemporary storage 421 by the log data filter 414. Atstep 606, the log data item is classified, by the log data filter 414, as either a high-priority log data item or a low-priority log data item. If the log data item is classified as a low-priority data item, theprocess 600 proceeds to step 608. Otherwise, if the log data item is classified as a high-priority data item, theprocess 600 proceeds to step 610. Atstep 608, a determination is made if the current low-priority buffer of thelogging system 190 is full. If the current low-priority buffer is full, theprocess 600 proceeds to step 612. Otherwise, if the current low-priority buffer is not full,step 612 is skipped and theprocess 600 proceeds to step 614. Atstep 612, another buffer 434 is designated as a current low-priority buffer. Step 612 is discussed in further detail with respect toFIG. 7 . Atstep 614, the log data item is stored in the current low-priority buffer of thelogging system 190. Afterstep 614 is completed, theprocess 600 returns to step 602, and steps 602-618 are executed for another log data item that is received at thelogging system 190. Atstep 610, a determination is made if the current high-priority buffer of the logging system is full. If the current high-priority buffer is full, theprocess 600 proceeds to step 616. Otherwise, if the current high-priority buffer is not full,step 616 is skipped and theprocess 600 proceeds to step 618. Atstep 616, another buffer 434 is designated as a current high-priority buffer. Step 616 is discussed in further detail with respect toFIG. 8 . Atstep 618, the log data item is stored in the current high-priority buffer of thelogging system 190. -
FIG. 7 is a diagram of an example of aprocess 700 for designating a buffer as a current low-priority buffer, as specified bystep 612 of theprocess 600, according to aspects of the disclosure. - At
step 702, a determination is made if a storage quota of thelogging system 190 is reached. As noted above, the storage quota may prescribe the maximum amount of log data that can be stored in thenon-volatile memory 430 at any given time. If the storage quota is not reached, theprocess 700 proceeds to step 704. Otherwise, if the storage quota is reached, theprocess 700 proceeds to step 708. - At
step 704, a new buffer is instantiated. In some implementations, instantiating a new buffer may include instantiating anew data structure 510. Atstep 706, thelogging system 190 is configured to use the newly-instantiated buffer as a current low-priority buffer. In some implementations, configuring thelogging system 190 to use the newly-instantiated buffer as a current low-priority buffer may include changing the value of the low-priority pointer 423 to point to the newly-instantiated buffer. Additionally or alternatively, in some implementations, configuring thelogging system 190 to use the newly-instantiated low-priority buffer as a current low-priority buffer may include generating new metadata for the newly-instantiated buffer. In some implementations, generating new metadata may include setting the priority designation of the newly-instantiated buffer to indicate that the newly-instantiated buffer is being used as a low-priority buffer. - At
step 708, the oldest one of all low-priority buffers 434B that are stored in thenon-volatile memory 430 is identified. In some implementations, the oldest low-priority buffer may be identified based on the respective timestamps of the low-priority buffers 434B that are stored in thenon-volatile memory 430. Atstep 710, thelogging system 190 is configured to use the oldest low-priority buffer as a current low-priority buffer. In some implementations, configuring thelogging system 190 to use the oldest low-priority buffer as a current low-priority buffer may include changing the value of the low-priority pointer 423 to point to the oldest low-priority buffer. Additionally or alternatively, in some implementations, configuring thelogging system 190 to use the oldest low-priority buffer as a current low-priority buffer may include generating new metadata for the oldest low-priority buffer. -
FIG. 8 is a diagram of an example of aprocess 800 for designating a buffer as a current high-priority buffer, as specified bystep 614 of theprocess 600, according to aspects of the disclosure. - At
step 802, a determination is made if a storage quota of thelogging system 190 is reached. As noted above, the storage quota may prescribe the maximum amount of log data that can be stored in thenon-volatile memory 430 at any given time. If the storage quota is not reached, theprocess 800 proceeds to step 804. Otherwise, if the storage quota is reached, theprocess 800 proceeds to step 808. - At
step 804, a new buffer is instantiated. In some implementations, instantiating the new buffer may include instantiating anew data structure 510. Atstep 806, thelogging system 190 is configured to use the newly-instantiated buffer as a current high-priority buffer. In some implementations, configuring thelogging system 190 to use the newly-instantiated buffer as a current high-priority buffer may include changing the value of the high-priority pointer 422 to point to the newly-instantiated buffer. Additionally or alternatively, in some implementations, configuring thelogging system 190 to use the newly-instantiated buffer as a current high-priority buffer may include generating new metadata for the newly-instantiated buffer. In some implementations, generating new metadata may include setting the priority designation of the newly-instantiated buffer to indicate that the newly-instantiated buffer is being used as a high-priority buffer. - At
step 808, the oldest one of all high-priority buffers 434A that are stored in thenon-volatile memory 430 is identified. In some implementations, the oldest high-priority buffer may be identified based on the respective timestamps of the high-priority buffers 434A that are stored in thenon-volatile memory 430. - At
step 810, a determination is made if the storage life of the oldest high-priority buffer 434A has expired. In some implementations, the determination may be made by retrieving from the memory of thelogging system 190 an indication of a storage life associated with the oldest high priority buffer and using a timestamp (e.g., timestamp 614) of the oldest high-priority buffer to determine, based on the retrieved indication, if the oldest high-priority buffer has expired. If the storage life of the oldest high-priority buffer 434A has expired, the process proceeds to step 812. Otherwise, if the storage life of the oldest high-priority buffer 434A has not expired, theprocess 800 proceeds to step 816. - At
step 812, thelogging system 190 is configured to use the oldest high-priority buffer as a current high-priority buffer. In some implementations, configuring thelogging system 190 to use the oldest high-priority buffer as a current high-priority buffer may include changing the value of the high-priority pointer 422 to point to the oldest high-priority buffer. Additionally or alternatively, in some implementations, configuring thelogging system 190 to use the oldest high-priority buffer as a current high-priority buffer may include generating new metadata for the oldest high-priority buffer. - At
step 814, the oldest one of all low-priority buffers 434B that are stored in thenon-volatile memory 430 is identified. In some implementations, the oldest low-priority buffer may be identified based on the respective timestamps of the low-priority buffers 434B that are stored in thenon-volatile memory 430. - At
step 816, thelogging system 190 is configured to use the oldest low-priority buffer as a current high-priority buffer. In some implementations, configuring thelogging system 190 to use the oldest low-priority buffer as a current high-priority buffer may include changing the value of the high-priority pointer 422 to point to the oldest low-priority buffer. Additionally or alternatively, in some implementations, configuring thelogging system 190 to use the oldest low-priority buffer as a current high-priority buffer may include generating new metadata for the oldest low-priority buffer. For example, generating new metadata for the oldest low-priority buffer may include changing the priority designation of the oldest low-priority buffer from a first value to a second value (e.g., from a “low-priority” value to a “high-priority” value). Changing the priority designation of the oldest low-priority buffer results in promoting the oldest low-priority buffer to high-priority status. Doing so may increase the amount of available space to store high-priority log data at the expense of space available to store low-priority log data, is advantageous because it may permit the logging system to store new high-priority log data items while maintaining existing high-priority log data items for their guaranteed storage life. -
FIGS. 1-8 provide an example of a storage system that is configured to distinguish between high-priority and low-priority log data and keep the high-priority log data longer. Specifically, thelogging system 190 is configured to guarantee the storage life of high-priority log data at the expense of low-priority log data by promoting low-priority buffers to a high-priority status when thelogging system 190 runs out of storage space to instantiate new buffers, and none of the present high-priority buffers has expired. This arrangement is advantageous in situations where there are limited resources for storing log data because it provides system administrators with full control over which data survives for a longer time period. -
FIGS. 1-8 provide an example of one specific implementation of thelogging system 190. However, it will be understood that the present disclosure is not limited to the implementation shown inFIGS. 1-8 . For example, alternative implementations are possible in which thelogging system 190 stores the current high-priority and low-priority buffers in thevolatile memory 420. When the current low-priority buffer becomes full, its contents may be transferred to another buffer, and subsequently overwritten with new low-priority log data. Transferring the contents of the current low-priority buffer may include detecting whether there is sufficient storage space in thenon-volatile memory 430 to allocate a new buffer (e.g., detecting whether a storage quota is reached). When there is sufficient storage space, a new low-priority buffer may be created in thenon-volatile memory 430, and the contents of the current low-priority buffer may be transferred into the new low-priority buffer. Otherwise, when the storage space is insufficient, the oldest low-priority buffer that is stored in thenon-volatile memory 430 may be selected, and its contents may be replaced with the contents of the current low-priority buffer. - When the current high-priority buffer becomes full, its contents may be transferred to another buffer, and subsequently overwritten with new high-priority log data. Transferring the contents of the current high-priority buffer may include detecting whether there is sufficient storage space in the
non-volatile memory 430 to allocate a new buffer (e.g., detecting whether a storage quota is reached). When there is sufficient storage space, a new high-priority buffer may be created in thenon-volatile memory 430, and the contents of the current low-priority buffer may be transferred into the new high-priority buffer. Otherwise, when the storage space is insufficient, the oldest high-priority buffer stored in thenon-volatile memory 430 may be identified. When the storage life of the oldest high-priority buffer has expired, the contents of oldest high-priority buffer may be replaced with the contents of the current high-priority buffer. When the storage life of the oldest high-priority buffer has not expired yet, the oldest low-priority buffer that is stored in thenon-volatile memory 430 may be identified. Afterwards, the oldest low-priority buffer may be promoted to a high-priority designation, and its contents may be replaced with the contents of the current high-priority buffer. - The processes discussed with respect to
FIGS. 6-8 are provided as an example only. It will be understood that at least some of the steps discussed with respect toFIGS. 6-8 can be performed in a different order or altogether omitted. While illustrative embodiments have been described with respect to processes of circuits, described embodiments may be implemented as a single integrated circuit, a multi-chip module, a single card, or a multi-card circuit pack. Further, as would be apparent to one skilled in the art, various functions of circuit elements may also be implemented as processing blocks in a software program. Such software may be employed in, for example, a digital signal processor, micro-controller, or general-purpose computer. Thus, described embodiments may be implemented in hardware, a combination of hardware and software, software, or software in execution by one or more processors. - Some embodiments may be implemented in the form of methods and apparatuses for practicing those methods. Described embodiments may also be implemented in the form of program code, for example, stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium or carrier, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation. A non-transitory machine-readable medium may include but is not limited to tangible media, such as magnetic recording media including hard drives, floppy diskettes, and magnetic tape media, optical recording media including compact discs (CDs) and digital versatile discs (DVDs), solid-state memory such as flash memory, hybrid magnetic and solid-state memory, non-volatile memory, volatile memory, and so forth, but does not include a transitory signal per se. When embodied in a non-transitory machine-readable medium, and the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the method.
- When implemented on a processing device, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits. Such processing devices may include, for example, a general-purpose microprocessor, a digital signal processor (DSP), a reduced instruction set computer (RISC), a complex instruction set computer (CISC), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a programmable logic array (PLA), a microcontroller, an embedded controller, a multi-core processor, and/or others, including combinations of the above. Described embodiments may also be implemented in the form of a bitstream or other sequence of signal values electrically or optically transmitted through a medium, stored magnetic-field variations in a magnetic recording medium, etc., generated using a method and/or an apparatus as recited in the claims.
- Various elements, which are described in the context of a single embodiment, may also be provided separately or in any suitable subcombination. It will be further understood that various changes in the details, materials, and arrangements of the parts that have been described and illustrated herein may be made by those skilled in the art without departing from the scope of the following claims.
Claims (20)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/260,391 US10951550B2 (en) | 2019-01-29 | 2019-01-29 | Logging infrastructure with time sustain requirements |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/260,391 US10951550B2 (en) | 2019-01-29 | 2019-01-29 | Logging infrastructure with time sustain requirements |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| US20200244600A1 true US20200244600A1 (en) | 2020-07-30 |
| US10951550B2 US10951550B2 (en) | 2021-03-16 |
Family
ID=71731768
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US16/260,391 Active 2039-07-04 US10951550B2 (en) | 2019-01-29 | 2019-01-29 | Logging infrastructure with time sustain requirements |
Country Status (1)
| Country | Link |
|---|---|
| US (1) | US10951550B2 (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20210053390A (en) * | 2019-11-01 | 2021-05-12 | 삼성전자주식회사 | Memory device and memory system including the same |
| US11157373B2 (en) * | 2019-11-04 | 2021-10-26 | Lenovo Enterprise Solutions (Singapore) Pte. Ltd. | Prioritized transfer of failure event log data |
| CN114356638A (en) * | 2022-01-06 | 2022-04-15 | 广东皓行科技有限公司 | Log saving method and device, storage medium and computer equipment |
| CN116257497A (en) * | 2021-12-10 | 2023-06-13 | 青岛海尔科技有限公司 | Method and device for caching logs, server, storage medium |
| CN117033332A (en) * | 2023-08-16 | 2023-11-10 | 维沃移动通信有限公司 | Log processing methods, devices and equipment |
| US20230394157A1 (en) * | 2022-06-06 | 2023-12-07 | Microsoft Technology Licensing, Llc | Unified logging for operating systems and connected embedded systems |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112748850B (en) | 2019-10-29 | 2024-04-19 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for storage management |
Family Cites Families (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7203732B2 (en) * | 1999-11-11 | 2007-04-10 | Miralink Corporation | Flexible remote data mirroring |
| US20030120822A1 (en) | 2001-04-19 | 2003-06-26 | Langrind Nicholas A. | Isolated control plane addressing |
| US8141149B1 (en) | 2005-11-08 | 2012-03-20 | Raytheon Oakley Systems, Inc. | Keyword obfuscation |
| US7752489B2 (en) | 2007-05-10 | 2010-07-06 | International Business Machines Corporation | Data integrity validation in storage systems |
| JP5331323B2 (en) | 2007-09-26 | 2013-10-30 | 株式会社日立製作所 | Storage subsystem and control method thereof |
| US8762661B2 (en) | 2008-09-18 | 2014-06-24 | Seagate Technology Llc | System and method of managing metadata |
| US8417987B1 (en) | 2009-12-01 | 2013-04-09 | Netapp, Inc. | Mechanism for correcting errors beyond the fault tolerant level of a raid array in a storage system |
| US8407517B2 (en) | 2010-04-08 | 2013-03-26 | Hitachi, Ltd. | Methods and apparatus for managing error codes for storage systems coupled with external storage systems |
| US9225668B2 (en) * | 2012-07-31 | 2015-12-29 | Futurewei Technologies, Inc. | Priority driven channel allocation for packet transferring |
| US9928248B2 (en) | 2013-07-08 | 2018-03-27 | International Business Machines Corporation | Self-healing by hash-based deduplication |
| CN106557266B (en) | 2015-09-25 | 2019-07-05 | 伊姆西公司 | Method and apparatus for redundant array of independent disks RAID |
| US10015101B2 (en) * | 2015-12-11 | 2018-07-03 | Ciena Corporation | Per queue per service buffering capability within a shaping window |
| CN107306232B (en) * | 2016-04-22 | 2021-02-26 | 华为技术有限公司 | Network device, controller, queue management method and flow management chip |
| US10374966B2 (en) * | 2016-04-28 | 2019-08-06 | Hughes Network Systems, Llc | Scheduling prioritized traffic in a scrambled coded multiple access (SCMA) system |
| US9985910B2 (en) * | 2016-06-28 | 2018-05-29 | Mellanox Technologies Tlv Ltd. | Adaptive flow prioritization |
| US11563695B2 (en) * | 2016-08-29 | 2023-01-24 | Cisco Technology, Inc. | Queue protection using a shared global memory reserve |
| EP3379793A1 (en) * | 2017-03-22 | 2018-09-26 | Mitsubishi Electric R&D Centre Europe B.V. | Asynchronous frame scheduler with efficient support for fragmentation |
| US10944684B2 (en) * | 2017-05-23 | 2021-03-09 | Cable Television Laboratories, Inc. | Systems and methods for queue protection |
| US10691340B2 (en) | 2017-06-20 | 2020-06-23 | Samsung Electronics Co., Ltd. | Deduplication of objects by fundamental data identification |
-
2019
- 2019-01-29 US US16/260,391 patent/US10951550B2/en active Active
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20210053390A (en) * | 2019-11-01 | 2021-05-12 | 삼성전자주식회사 | Memory device and memory system including the same |
| US11157425B2 (en) * | 2019-11-01 | 2021-10-26 | Samsung Electronics Co., Ltd. | Memory device, memory system including memory device and vehicle-based system including memory system |
| KR102891496B1 (en) | 2019-11-01 | 2025-11-27 | 삼성전자주식회사 | Memory device and memory system including the same |
| US11157373B2 (en) * | 2019-11-04 | 2021-10-26 | Lenovo Enterprise Solutions (Singapore) Pte. Ltd. | Prioritized transfer of failure event log data |
| CN116257497A (en) * | 2021-12-10 | 2023-06-13 | 青岛海尔科技有限公司 | Method and device for caching logs, server, storage medium |
| CN114356638A (en) * | 2022-01-06 | 2022-04-15 | 广东皓行科技有限公司 | Log saving method and device, storage medium and computer equipment |
| US20230394157A1 (en) * | 2022-06-06 | 2023-12-07 | Microsoft Technology Licensing, Llc | Unified logging for operating systems and connected embedded systems |
| CN117033332A (en) * | 2023-08-16 | 2023-11-10 | 维沃移动通信有限公司 | Log processing methods, devices and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| US10951550B2 (en) | 2021-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10951550B2 (en) | Logging infrastructure with time sustain requirements | |
| US11340812B2 (en) | Efficient modification of storage system metadata | |
| US11558270B2 (en) | Monitoring a stale data queue for deletion events | |
| US9965196B2 (en) | Resource reservation for storage system metadata updates | |
| US11429566B2 (en) | Approach for a controllable trade-off between cost and availability of indexed data in a cloud log aggregation solution such as splunk or sumo | |
| US9286006B2 (en) | Systems and methods for scheduling deduplication of a storage system | |
| US10671285B2 (en) | Tier based data file management | |
| CN106844041B (en) | Memory management method and memory management system | |
| US10152232B1 (en) | Low-impact application-level performance monitoring with minimal and automatically upgradable instrumentation in a storage system | |
| US20200125473A1 (en) | Hybrid log viewer with thin memory usage | |
| US20150220438A1 (en) | Dynamic hot volume caching | |
| US20200341849A1 (en) | Method to recover metadata in a content aware storage system | |
| US20210226863A1 (en) | Methods and apparatus for optimizing bandwidth consumption in support of intense network-wise health assessment | |
| US10855818B2 (en) | Apparatus and methods for optimizing dirty memory pages in embedded devices | |
| US11252121B2 (en) | Message sending method and terminal device | |
| US20210208945A1 (en) | Information processing apparatus, information processing method, and computer readable medium | |
| US10990502B2 (en) | Detailed performance analysis by flow aware marker mechanism | |
| CN112965833B (en) | Log processing method and device | |
| US9342568B2 (en) | Reducing metadata controller communication volume | |
| CN110213314A (en) | Determine method, apparatus, the server of memory node | |
| CN120263802B (en) | Adaptive Data Management Method Based on Polymorphic Addressing | |
| CN117632953B (en) | Data cycle storage method, device, server and storage medium | |
| CN108279990B (en) | System checking method and device and electronic equipment | |
| CN116662603A (en) | Time shaft control method and system based on kafka, electronic equipment and storage medium | |
| Fernandez Casani et al. | Designing Alternative Transport Methods for the Distributed Data Collection of ATLAS EventIndex Project |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
| AS | Assignment |
Owner name: EMC IP HOLDING COMPANY LLC, MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHANI, NIMROD;FLIESS, LERON;REEL/FRAME:048191/0758 Effective date: 20190124 |
|
| AS | Assignment |
Owner name: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., TEXAS Free format text: SECURITY AGREEMENT;ASSIGNORS:CREDANT TECHNOLOGIES, INC.;DELL INTERNATIONAL L.L.C.;DELL MARKETING L.P.;AND OTHERS;REEL/FRAME:049452/0223 Effective date: 20190320 |
|
| AS | Assignment |
Owner name: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., TEXAS Free format text: SECURITY AGREEMENT;ASSIGNORS:CREDANT TECHNOLOGIES INC.;DELL INTERNATIONAL L.L.C.;DELL MARKETING L.P.;AND OTHERS;REEL/FRAME:053546/0001 Effective date: 20200409 |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
| STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
| AS | Assignment |
Owner name: DELL MARKETING L.P. (ON BEHALF OF ITSELF AND AS SUCCESSOR-IN-INTEREST TO CREDANT TECHNOLOGIES, INC.), TEXAS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 Owner name: DELL INTERNATIONAL L.L.C., TEXAS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 Owner name: DELL PRODUCTS L.P., TEXAS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 Owner name: DELL USA L.P., TEXAS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 Owner name: EMC CORPORATION, MASSACHUSETTS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 Owner name: DELL MARKETING CORPORATION (SUCCESSOR-IN-INTEREST TO FORCE10 NETWORKS, INC. AND WYSE TECHNOLOGY L.L.C.), TEXAS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 Owner name: EMC IP HOLDING COMPANY LLC, TEXAS Free format text: RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001);ASSIGNOR:THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT;REEL/FRAME:071642/0001 Effective date: 20220329 |
|
| MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |