CLOSELY TOGETHER

BACKGROUND

[0001] Storage systems are being designed and built for a wide range of amounts of data and sizes of files. Large files tend to create system bottlenecks especially for distributed storage systems. When a large file ties up the resources of a particular processor, for example in a storage node of a storage cluster, attempts to access other files under control of that same processor or node may experience delays. This can be especially problematic during transfer or backup of large files, when frequent appending to a file is occurring.

[0002] It is within this context that the embodiments arise.

SUMMARY

[0003] In some embodiments, a processor-based method for locating data and metadata closely together in a storage system is provided. The method includes writing a first range of a file and a first metadata relating to attributes of the file into at least one segment controlled by a first authority of the file. The method includes delegating, by the first authority, a second authority for a second range of the file, and writing the second range of the file and second metadata relating to the attributes of the file into at least one segment controlled by the second authority.

[0004] In some embodiments, a storage system is provided. The storage system includes storage memory having a plurality of segments and at least one processor. The at least one processor is configured to write data of a file and metadata pertaining to the file into the plurality of segments under a plurality of authorities, wherein a first range of the data of the file and a first metadata relating to attributes of the file are in at least one segment controlled by a first authority of the file. A second range of the data of the file and a second metadata are in at least one segment controlled by a second authority, and wherein the first authority of the file is configured to delegate ownership of a range of data of the file.

[0005] In some embodiments, a non-transitory computer readable medium having instructions when executed by a processor, cause the processor to perform actions. The actions include writing a first range of a file and a first metadata relating to attributes of the file into at least one segment controlled by a first authority of the file. The action include delegating, by the first authority, a second authority for a second range of the file, and writing the second range of the file and second metadata relating to the attributes of the file into at least one segment controlled by the second authority.

[0006] Other aspects and advantages of the embodiments will become apparent from the following detailed description taken in conjunction with the accompanying drawings which illustrate, by way of example, the principles of the described embodiments.

BRIEF DESCRIPTION OF THE DRAWINGS

[0007] The described embodiments and the advantages thereof may best be understood by reference to the following description taken in conjunction with the accompanying drawings. These drawings in no way limit any changes in form and detail that may be made to the described embodiments by one skilled in the art without departing from the spirit and scope of the described embodiments.

[0008] Fig. 1 is a block diagram of a storage cluster with multiple storage nodes, which acts as a system where data and metadata are located closely together in accordance with some embodiments.

[0009] Fig. 2 is a diagram of how a relatively large file may be segmented or broken up into pieces of data, each sent to a segment under an authority in accordance with some embodiments.

[0010] Fig. 3 is a diagram showing segments of the storage memory of the system of Fig. 1, with details on how metadata and data are arranged in each segment in accordance with some embodiments.

[0011] Fig. 4 is a flow diagram of a method for locating data and metadata closely together in a storage system in accordance with some embodiments.

[0012] Fig. 5 is an illustration showing an exemplary computing device which may implement the embodiments described herein.

DETAILED DESCRIPTION

[0013] A storage system is described where data for a range of a file and metadata associated with that data are located relatively closely together or proximate to each other in at least one segment of storage memory. This proximity of the data and metadata makes data access more efficient, and provides organized locations for various types of metadata such as mapping information and file attributes, among other metadata. The organization of segments of storage memory is applicable to various storage systems, including a storage cluster with distributed storage nodes as shown in some embodiments. Authorities in the storage system direct or manage metadata and data in the segments. An authority of an inode or file can delegate or assign a delegated authority each time it is determined an offset of data or the range of the file is associated with a differing segment in some embodiments. Any appending to the file is then made to the segment controlled by the delegated authority. The authority of an inode, which may be referred to as the original or initial authority, tracks which authority is the delegated authority, and persists the assignment of the delegated authority, for example with a token in some embodiments. Some attributes of the file, including the file size, modification time and/or permissions, are recorded in metadata in the segment controlled by the delegated authority, in various embodiments.

[0014] Fig. 1 is a block diagram of a storage cluster 102 with multiple storage nodes 112, which acts as a system where data and metadata are located closely together. Embodiments with segments 114 of storage memory 110 and proximity of data and metadata are not limited to storage clusters 102, and may also include various types of storage systems such as storage arrays and storage devices, with various types of storage memory. The storage cluster 102 has one or more processors 104. Some embodiments have one or more processors in each storage node 112. A file system 106 operates in the storage cluster 102, for example as executed by the processors 104. Authorities 108 can be implemented as software constructs, using software executing on the processors 104. Each authority 108 is an owner of a range of a file or data. In some embodiments, each storage node 112, or many but not all of the storage nodes 112, has one or more authorities 108, and these authorities 108 direct or manage data and metadata. For each range of a file that is written into or read out of the storage cluster 102, there is one authority 108 of the inode for the file. Storage memory 110 may be organized as segmentsi _-n 114. The segmentsi _-n 114 could be logical segments of memory, or physical segments of memory, or both. In one embodiment, the segmentsi _-n 114 are logical segments, each of which is distributed across multiple storage nodes 112 with redundancy and/or erasure coding, and one or more levels of mapping from the logical segments to the physical segments.

[0015] In some systems, for example in UNIX-style file systems, data is handled with an index node or inode, which specifies a data structure that represents an object in a file system. The object could be a file or a directory, for example. Metadata may accompany the object, as attributes such as permission data and a creation timestamp, among other attributes. A segment number could be assigned to all or a portion of such an object in a file system. In other systems, data segments are handled with a segment number assigned elsewhere. For purposes of discussion, the unit of distribution is an entity, and an entity can be a file, a directory or a segment. That is, entities are units of data or metadata stored by a storage system. Entities are grouped into sets called authorities. Each authority has an authority owner, which is a storage node that has the exclusive right to update the entities in the authority. In other words, a storage node contains the authority, and that the authority, in turn, contains entities.

[0016] A segment is a logical container of data in accordance with some embodiments. A segment is an address space between medium address space and physical flash locations, i.e., the data segment number, are in this address space. Segments may also contain metadata, which enable data redundancy to be restored (rewritten to different flash locations or devices) without the involvement of higher level software. In one embodiment, an internal format of a segment contains client data and medium mappings to determine the position of that data. Each data segment is protected, e.g., from memory and other failures, by breaking the segment into a number of data and parity shards, where applicable. The data and parity shards are distributed, i.e., striped, across non-volatile solid state storage coupled to the host CPUs in accordance with an erasure coding scheme. Usage of the term segments refers to the container and its place in the address space of segments in some embodiments. Usage of the term stripe refers to the same set of shards as a segment and includes how the shards are distributed along with redundancy or parity information in accordance with some

embodiments.

[0017] A series of address-space transformations takes place across an entire storage system. At the top are the directory entries (file names) which link to an inode. Inodes point into medium address space, where data is logically stored. Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Segment addresses are then translated into physical flash locations. Physical flash locations have an address range bounded by the amount of flash in the system in accordance with some embodiments. Medium addresses and segment addresses are logical containers, and in some embodiments use a 128 bit or larger identifier so as to be practically infinite, with a likelihood of reuse calculated as longer than the expected life of the system. Addresses from logical containers are allocated in a hierarchical fashion in some embodiments. Initially, each non-volatile solid state storage unit within storage memory 110 may be assigned a range of address space in some embodiments. Within this assigned range, the non-volatile solid state storage unit is able to allocate addresses without synchronization with other non-volatile solid state storage.

[0018] Data and metadata is stored by a set of underlying storage layouts that are optimized for varying workload patterns and storage devices. These layouts incorporate multiple redundancy schemes, compression formats and index algorithms. Some of these layouts store information about authorities and authority masters, while others store file metadata and file data. The redundancy schemes include error correction codes that tolerate corrupted bits within a single storage device (such as a NA D flash chip), erasure codes that tolerate the failure of multiple storage nodes, and replication schemes that tolerate data center or regional failures. In some embodiments, low density parity check (LDPC) code is used within a single storage unit. Reed-Solomon encoding is used within a storage cluster, and mirroring is used within a storage grid in some embodiments. Metadata may be stored using an ordered log structured index (such as a Log Structured Merge Tree), and large data may not be stored in a log structured layout. It should be appreciated that the embodiments described herein may be integrated into the system of the assignee in one example.

[0019] Fig. 2 is a diagram of how a file 202 may be segmented or broken up into pieces of data or ranges of the file, and each piece sent to a segment 114 under a corresponding authority 108. The sizes of data chunks 206, and the labels for the authorities 108 are by example only, and should not be seen as limiting. Data chunks 206 may be referred to as a range of a file. In this example, each data chunk 206 starts at one logical offset 204 and ends at the next logical offset 204, and has a specified size of 16 MB (megabytes), and the authorities 108 are shown as A7, A15 and A31. The labeling or numbering of authorities 108 need not be sequential. The specified size (16MB) and logical offset 204 could be the same, or different, for each of the segmentsi _-n 114, in various embodiments. In some embodiments, the specified size and logical offset 204 are tunable, for example tunable to the system, or tunable to types of memory or sizes of segments 114, etc. The data may be compressed for writing to the segmentsi _-n 114 in some embodiments. A relatively small file of less than the specified size, and fitting within one specified amount of logical offset 204 can be written entirely to a segment 114 under the authority 108 of the inode of the file, for example the authority 108 labeled A7. Metadata for that same file is also written to that same segment 114 under that same authority 108 in some embodiments. Thus, for a small file, all of the metadata and all of the data for the file are stored in proximity in one segment 114 under control of one authority 108. It should be appreciated that the data or the range of the file and the meta data for that range of the file may be stored in differing segments in some embodiments as the examples provided are illustrative and not meant to be limiting.

[0020] File 202 may initially be stored with a first chunk 206 of data of the file written to the segmenti 114 under control of the authority 108 of the inode of the file, e.g., A7, and the metadata for the file also written to that same segment 114 under that same authority 108. Once the logical address of further appended data or a further range of the file becomes associated with a logical offset 204 for a differing segment (segment ₂ ), the authority 108 of the inode of the file assigns a delegated authority 108, for example A15. The further range of the file is written to segment 114 ₂ under the delegated authority 108 (A15), along with further metadata in some embodiments. As mentioned above, the data (range of the file) and the metadata for that range of the file may be written to differing segments, in some

embodiments. Once the amount of data stored in segment ₂ 114 reaches the predefined limit for a segment 114, i.e., the address reaches the next logical offset 204, the authority 108 (A7) of the inode of the file assigns a new delegated authority 108, for example A31. This next chunk 206 of data for the file, up to the next logical offset 204, is written to segment _n 114 under the new delegated authority 108 (A31). This process is iterative, as indicated by the "..." in Fig. 2, so that as a file grows, e.g., is appended, or a very large file is encountered, a greater number of segmentsi _-n 114 are allocated to the file, and the authorities continue to be delegated for each segment as described above. The original authority 108 (A7) is referred to as the authority of the inode of the file. This process is further described and shown, along with organization of the data segments 114, in Fig. 3.

[0021] Fig. 3 is a diagram showing segments 114 of the storage memory 110 of the system of Fig. 1, with details on how metadata 302 and data 304 are arranged in each segment 114 in accordance with some embodiments. In this example, as in Fig. 2, the authority 108 labeled A7 is the authority for the inode of the file, and the authority 108 labeled A31 is the latest or most recently delegated authority 108, as delegated by the authority for the inode (A7). In the segment 114 under control of the authority 108 for the inode (A7), the first chunk 206 of data 304 of the file 202 is written along with some of the metadata 302 for the file. The metadata 302 relates to attributes of the file. Included in that metadata 302 is a pointer or mapping information to the data 304 in that segment 114. This could be in the form of mapping the logical offset of the data 304 to a logical offset in the segment 114, a map to a physical offset, and/or information about a particular segment/page pair. In some embodiments, each segment 114 is organized into multiple pages (e.g., logical pages in a logical segment), and one of the pages includes a directory (as metadata) that indicates what the logical offset (e.g., a write offset) is, in the page, for the data. As noted above, the data and the corresponding metadata for the data may or may not be stored in the same segment.

[0022] Still referring to Figs. 2 and 3, after the first chunk 206 of data 304, up to the first logical offset 204, and metadata 302 of the file 202 are written to the segmenti 114 under control of the authority 108 of the inode for the file (A7), the next chunk 206 of data 304 up to the next logical offset 204, and more metadata 302, are written to the next segment ₂ 114. This next segment ₂ 114 is under control of an authority 108 (A15) that is delegated by the authority of the inode (A7). In the example shown in Fig. 3, this next chunk 206 of data 304 and metadata 302 are written to the segment ₂ 114 under control of the authority 108 labeled A15. During the time of writing of that data 304, that authority 108 (A15) is the delegated authority, as assigned by the authority of the inode (A7). Upon determination that a range of the file is associated with write offset of a differing segment, the authority of the inode (A7) delegates another authority 108 (A31), and data 304 and possibly metadata 302 for that data are then written to the segment _n 114 under control of that delegated authority 108 (A31). This iterative process continues for as long as there is more data, or data continues to be appended to the file. Thus, in some embodiments once the amount of data reaches a predefined limit for the amount of data that should be written to a segment under control of an authority 108, i.e., the address of the data reaches the next logical offset for a differing segment, further authorities are delegated to accommodate appending to the file or a large file.

[0023] In the example shown in Fig. 3, the latest or most recent delegated authority 108 is the authority 108 labeled A31. The authority for the inode (A7) persists the delegation of the authority 108 (A31) using a token 308 in some embodiments. It should be appreciated that a token is one example of persisting the delegation of the authority and is not meant to be limiting. In some embodiments, there are redundant copies of metadata showing the persistence of the delegation of the authority 108 or the persisting uses an interlock mechanism. The authority 108 for the inode (A7) records the delegation of the authority 108 in the metadata 302 stored in the segment 114 controlled by the authority for the inode (A7). In this embodiment, the delegation of an authority is persisted prior to the writing of any data 302 or metadata 302 to the segment 114 controlled by the newly delegated authority. Writing the data 302 and the metadata 302 to that segment 114 is controlled by the delegated authority 108, and is responsive to persisting the delegating of the second authority. This sequence, of delegating an authority 108, persisting that authority 108 and recording that delegation of the authority 108 in the metadata 302 in the segment 114 under control of the authority of the inode (A7), is performed each time the write offset is associated or detected as being with a different range of data for the file. When this happens, an authority 108 is delegated for the next chunk of data or range of file, up to the next logical offset.

[0024] Still referring to Fig. 3, any further data, for example in an append operation, is added to the segment 114 under control of the latest or most recent delegated authority 108, as indicated by the action to append data here 312. In this embodiment, various attributes 310 of the file including the file size, modification time, permissions, etc., are written in metadata 302 in the segment 114 controlled by the delegated authority 108 (e.g., A31). In this manner, with the metadata 302 and data 304 closely associated in the segment 114, or differing segment, it is straightforward to check the permissions (if needed), update the file size, and record the time at which the file is modified in the same segment 114 in which the data 304 is appended to the file. As with previously written segments 114, if or when the total amount of data 304 in that segment 114 reaches the predefined limit for the segment 114, i.e., the write offset is associated with another segment, the authority of the inode (A7) delegates another authority 108. Further data 304 can then be written or appended to the segment 114 under control of that delegated authority 108. The metadata 302 in the segment 114 controlled by the authority 108 of the inode of the file thus has information about which authority 108, namely the delegated authority 108, has metadata 302 with the attributes 310 about the file size, modification time and permissions of the file and controls the segment 114 to which any further data is to be appended (up to the limit for the particular segment).

[0025] With reference to Figs. 1-3, to read a file, the authority 108 of the inode of the file (A7) is consulted. Metadata 302 in the segment 1 14 under control of the authority of the inode (A7) has a mapping, which could be in tables for example, and which in some embodiments indicates the logical offset for the file and a map to a particular segment/page pair. The metadata 302 could include a directory with information about the write offset for the segment that the data is located within. This could include a pointer which indicates where the data for the file is found. In some embodiments, the metadata 302 in the segment 114 under control of the authority of the inode (A7) has information about all of the authorities 108 associated with the file, including the most recently delegated authority. In some embodiments, the metadata 302 in each segment 114 under control of an authority 108 has information about the next authority in the chain of authorities. In some embodiments, an authority from which data is going to be read can be calculated directly based on an inode and an offset. In each of these embodiments, data under control of an authority 108 can be determined by reading the metadata 302 in the segment 114 under control of that authority 108, so that the chunks of data or a range of a file can be read in sequence, for example to support a file read request. With each authority 108 controlling a range of data, the system avoids the bottlenecks that are associated with performing reads or writes of a large file all under control of a single entity (and associated processor or node).

[0026] Fig. 4 is a flow diagram of a method for locating data and metadata closely together in a storage system. The method can be performed by a storage system, more specifically by one or more processors of a storage system. The storage system has storage memory arranged in segments, and authorities which can be implemented in software executing on one or more processors. In an action 402, a first range of a file and metadata are written to at least one segment under control of an authority of the file. In a decision action 404, it is determined whether a second range of the file is associated with a write offset for a differing segment. If the answer is no, the second range of the file is not associated with a write offset for a differing segment, flow branches back to the action 402, and the range of the file may be written to the segment under control of the original authority. If the answer to the decision action 404 is yes, second range of the file is associated with a write offset for a differing segment, flow proceeds to the action 406. In the action 406, the authority of the inode (the original authority) assigns a delegated authority. In an action 408, the delegated authority is persisted, which can be performed with the use of a token as described above.

[0027] In a decision action 410 of Fig. 4, it is determined whether there is more data from the file to be stored. If the answer is no, there is not (at present) more data to be stored from the file, flow branches back to the decision action 410, to await more data, or alternatively branches back to the action 402, for data of a further file to be written to a further segment under control of a further authority. If the answer is yes, there is more data from the file to be stored, flow proceeds to the action 412. In the action 412, data is appended to the segment under control of the delegated authority. In the action 414, attributes, including file size, modification time, permissions, etc., are written to metadata of the segment under control of the delegated authority. As noted above with reference to Fig. 3, the authority of the inode (the original authority) tracks which authority is a most recently delegated authority as well as the chain of authorities.

[0028] It should be appreciated that the methods described herein may be performed with a digital processing system, such as a conventional, general-purpose computer system.

Special purpose computers, which are designed or programmed to perform only one function may be used in the alternative. Fig. 5 is an illustration showing an exemplary computing device which may implement the embodiments described herein. The computing device of Fig. 5 may be used to perform embodiments of the functionality for locating data and metadata closely together in a storage system in accordance with some embodiments. The computing device includes a central processing unit (CPU) 501, which is coupled through a bus 505 to a memory 503, and mass storage device 507. Mass storage device 507 represents a persistent data storage device such as a floppy disc drive or a fixed disc drive, which may be local or remote in some embodiments. The mass storage device 507 could implement a backup storage, in some embodiments. Memory 503 may include read only memory, random access memory, etc. Applications resident on the computing device may be stored on or accessed via a computer readable medium such as memory 503 or mass storage device 507 in some embodiments. Applications may also be in the form of modulated electronic signals modulated accessed via a network modem or other network interface of the computing device. It should be appreciated that CPU 501 may be embodied in a general-purpose processor, a special purpose processor, or a specially programmed logic device in some embodiments.

[0029] Display 511 is in communication with CPU 501, memory 503, and mass storage device 507, through bus 505. Display 511 is configured to display any visualization tools or reports associated with the system described herein. Input/output device 509 is coupled to bus 505 in order to communicate information in command selections to CPU 501. It should be appreciated that data to and from external devices may be communicated through the input/output device 509. CPU 501 can be defined to execute the functionality described herein to enable the functionality described with reference to Figs. 1-4. The code embodying this functionality may be stored within memory 503 or mass storage device 507 for execution by a processor such as CPU 501 in some embodiments. The operating system on the computing device may be MS-WINDOWS™, OS/2™, UNIX™, LINUX™, iOS™ or other known operating systems. It should be appreciated that the embodiments described herein may also be integrated with a virtualized computing system that is implemented with physical computing resources.

[0030] Detailed illustrative embodiments are disclosed herein. However, specific functional details disclosed herein are merely representative for purposes of describing embodiments. Embodiments may, however, be embodied in many alternate forms and should not be construed as limited to only the embodiments set forth herein.

[0031] It should be understood that although the terms first, second, etc. may be used herein to describe various steps or calculations, these steps or calculations should not be limited by these terms. These terms are only used to distinguish one step or calculation from another. For example, a first calculation could be termed a second calculation, and, similarly, a second step could be termed a first step, without departing from the scope of this disclosure. As used herein, the term "and/or" and the "/" symbol includes any and all combinations of one or more of the associated listed items.

[0032] As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises", "comprising", "includes", and/or "including", when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Therefore, the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting.

[0033] It should also be noted that in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may in fact be executed substantially concurrently or may sometimes be executed in the reverse order, depending upon the functionality/acts involved.

[0034] With the above embodiments in mind, it should be understood that the

embodiments might employ various computer-implemented operations involving data stored in computer systems. These operations are those requiring physical manipulation of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. Further, the manipulations performed are often referred to in terms, such as producing, identifying, determining, or comparing. Any of the operations described herein that form part of the embodiments are useful machine operations. The embodiments also relate to a device or an apparatus for performing these operations. The apparatus can be specially constructed for the required purpose, or the apparatus can be a general-purpose computer selectively activated or configured by a computer program stored in the computer. In particular, various general-purpose machines can be used with computer programs written in accordance with the teachings herein, or it may be more convenient to construct a more specialized apparatus to perform the required operations.

[0035] A module, an application, a layer, an agent or other method-operable entity could be implemented as hardware, firmware, or a processor executing software, or combinations thereof. It should be appreciated that, where a software-based embodiment is disclosed herein, the software can be embodied in a physical machine such as a controller. For example, a controller could include a first module and a second module. A controller could be configured to perform various actions, e.g., of a method, an application, a layer or an agent.

[0036] The embodiments can also be embodied as computer readable code on a tangible non-transitory computer readable medium. The computer readable medium is any data storage device that can store data, which can be thereafter read by a computer system.

Examples of the computer readable medium include hard drives, network attached storage (NAS), read-only memory, random-access memory, CD-ROMs, CD-Rs, CD-RWs, magnetic tapes, and other optical and non-optical data storage devices. The computer readable medium can also be distributed over a network coupled computer system so that the computer readable code is stored and executed in a distributed fashion. Embodiments described herein may be practiced with various computer system configurations including hand-held devices, tablets, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers and the like. The embodiments can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a wire-based or wireless network.

[0037] Although the method operations were described in a specific order, it should be understood that other operations may be performed in between described operations, described operations may be adjusted so that they occur at slightly different times or the described operations may be distributed in a system which allows the occurrence of the processing operations at various intervals associated with the processing.

[0038] In various embodiments, one or more portions of the methods and mechanisms described herein may form part of a cloud-computing environment. In such embodiments, resources may be provided over the Internet as services according to one or more various models. Such models may include Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). In IaaS, computer infrastructure is delivered as a service. In such a case, the computing equipment is generally owned and operated by the service provider. In the PaaS model, software tools and underlying equipment used by developers to develop software solutions may be provided as a service and hosted by the service provider. SaaS typically includes a service provider licensing software as a service on demand. The service provider may host the software, or may deploy the software to a customer for a given period of time. Numerous combinations of the above models are possible and are contemplated. [0039] Various units, circuits, or other components may be described or claimed as "configured to" perform a task or tasks. In such contexts, the phrase "configured to" is used to connote structure by indicating that the units/circuits/components include structure (e.g., circuitry) that performs the task or tasks during operation. As such, the

unit/circuit/component can be said to be configured to perform the task even when the specified unit/circuit/component is not currently operational (e.g., is not on). The

units/circuits/components used with the "configured to" language include hardware—for example, circuits, memory storing program instructions executable to implement the operation, etc. Reciting that a unit/circuit/component is "configured to" perform one or more tasks is expressly intended not to invoke 35 U.S.C. 112, sixth paragraph, for that

unit/circuit/component. Additionally, "configured to" can include generic structure (e.g., generic circuitry) that is manipulated by software and/or firmware (e.g., an FPGA or a general-purpose processor executing software) to operate in manner that is capable of performing the task(s) at issue. "Configured to" may also include adapting a manufacturing process (e.g., a semiconductor fabrication facility) to fabricate devices (e.g., integrated circuits) that are adapted to implement or perform one or more tasks.

[0040] The foregoing description, for the purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the embodiments and its practical applications, to thereby enable others skilled in the art to best utilize the

embodiments and various modifications as may be suited to the particular use contemplated. Accordingly, the present embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims.