Patent Application
20180365012
The present disclosure is generally directed to instruction prefetching and, more specifically, to dynamic sequential instruction prefetching in a data processing system.
In general, a processor is much faster than main memory that stores programs and, as such, main memory may not be able source program instructions fast enough to keep the processor busy. Incorporating a cache memory (cache) within a data processing system has been used to provide faster processor access to program instructions. As is known, a cache is physically located closer to a processor than main memory and is usually faster than main memory. In computer architecture, instruction prefetching is also used by processors to speed-up program execution by reducing processor wait states. Instruction prefetching occurs when a processor requests that an instruction from lower level memory (e.g., main memory) be loaded into cache before the instruction is actually needed. With instruction prefetching, an instruction can be accessed more quickly from cache than if a processor had to request the instruction from main memory when actually needed, thus preventing a processor stall while awaiting receipt of the instruction from main memory.
Sequential prefetching refers to a cache requesting a number of sequential cache lines from lower level memory when one or more instructions at a particular location are anticipated to be executed. For example, a sequential prefetcher may statically prefetch two additional cache lines when a given cache line is prefetched. As one example, if a cache line at address ‘N’ is prefetched, cache lines at addresses ‘N+1’ and ‘N+2’ would also be prefetched by a sequential prefetcher that statically prefetches two additional cache lines. Unfortunately, sequentially prefetching additional cache lines statically may result in cache pollution due to the additional cache lines not being utilized prior to ejection from the cache. Sequentially prefetching too many instruction cache lines may also reduce processor performance by causing thrashing in an instruction cache. Moreover, sequentially prefetching too few instruction cache lines may also reduce processor performance due to latency in executing instructions.
A technique for operating a processor includes allocating an entry in a prefetch filter queue for a cache line address in response to the cache line address missing in an instruction cache. In response to the cache line address subsequently hitting in the instruction cache, an associated prefetch value for the entry in the prefetch filter queue is updated. The associated prefetch value corresponds to a number of entries in the prefetch filter queue that have cache line addresses that are sequential to the cache line address. In response to the entry being aged-out of the prefetch filter queue, an entry in a backing array for the cache line address and the associated prefetch value is allocated. In response to subsequently determining that prefetching is required for the cache line address, the backing array is accessed to determine the associated prefetch value for the cache line address. A cache line at the cache line address and a number of sequential cache lines that follow the cache line address, as specified by the associated prefetch value in the backing array, are then prefetched into the instruction cache.
The above summary contains simplifications, generalizations and omissions of detail and is not intended as a comprehensive description of the claimed subject matter but, rather, is intended to provide a brief overview of some of the functionality associated therewith. Other systems, methods, functionality, features and advantages of the claimed subject matter will be or will become apparent to one with skill in the art upon examination of the following figures and detailed written description.
The above as well as additional objectives, features, and advantages of the present invention will become apparent in the following detailed written description.
The description of the illustrative embodiments is to be read in conjunction with the accompanying drawings, wherein:
The illustrative embodiments provide a method, a data processing system, and a processor configured to implement dynamic sequential instruction prefetching.
In the following detailed description of exemplary embodiments of the invention, specific exemplary embodiments in which the invention may be practiced are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, architectural, programmatic, mechanical, electrical and other changes may be made without departing from the spirit or scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined by the appended claims and equivalents thereof.
It should be understood that the use of specific component, device, and/or parameter names are for example only and not meant to imply any limitations on the invention. The invention may thus be implemented with different nomenclature/terminology utilized to describe the components/devices/parameters herein, without limitation. Each term utilized herein is to be given its broadest interpretation given the context in which that term is utilized. As used herein, the term ‘coupled’ may encompass a direct connection between components or elements or an indirect connection between components or elements utilizing one or more intervening components or elements.
According to various embodiments of the present disclosure, two additional logic blocks are implemented within a data processing system to more accurately facilitate dynamically determining how many sequential instruction cache lines to prefetch in order to improve performance of the data processing system. A first logic block implements a relatively small prefetch filter queue (e.g., a first-in first-out (FIFO) content-addressable memory (CAM)) that tracks the last ‘n’ L1 instruction cache misses, e.g., ‘n’ may range from sixteen to thirty-two. As is known, a CAM is a special type of computer memory used in high-speed search applications that compares input search information against stored information in parallel and indicates matching information, for example, in one processor clock cycle. According to the present disclosure, each time a demand L1 instruction cache miss is issued, a new entry is created in the prefetch filter queue.
A second logic block, which is coupled to the first logic block, implements a backing array. In one or more embodiments, each time there is a demand request to an associated level (L2) cache a new prefetch filter queue is created and information associated with an older prefetch filter queue is aged-out to the backing array. When the prefetch filter queue is full, information associated with an oldest entry in the prefetch filter queue is aged-out to the backing array (e.g., the backing array may have 4096 entries). In general, the prefetch filter queue is full after the first ‘n’ L1 instruction cache misses, where ‘n’ corresponds to the number of entries in the prefetch filter queue. It should be appreciated that sizes of a prefetch filter queue and a backing array configured according to the present disclosure may vary above or below the sizes set forth herein. According to one or more embodiments, an address (or portion of an address) of each instruction that hits in the L1 cache is compared (e.g., in parallel for speed) against each entry in the prefetch filter queue. In one embodiment, when an address of an instruction that hit in the L1 cache matches an address of any of the next seven instructions after any of the entries in the prefetch filter queue then a matching bit is set for the entry.
According to an embodiment of the present disclosure, an instruction fetch address (IFA) generation unit is implemented to generate instruction fetch addresses. In one or more embodiments, the IFA generation unit translates effective addresses (EAs) used by programs to real addresses (RAs) used by hardware. The RAs are provided from the IFA generation unit to a level one (L1) instruction cache (L1 cache) that includes a directory, an array for storing instructions, and cache miss generation logic. The cache miss generation logic, among other functions, generates an instruction demand fetch when a generated RA (e.g., stored in an instruction fetch address register (IFAR), not shown) does not hit an RA in the directory of the L1 cache. The RAs are also provided from the IFA generation unit to a prefetch filter queue that is configured, according to the present disclosure and discussed in additional detail below, to store new entries for RAs that miss in the L1 cache and to (eventually) reflect a number of additional cache lines that should be prefetched for RAs that subsequently hit in the L1 cache.
The L1 cache is also coupled to an instruction demand and prefetch interface (that is coupled to an L2 cache, which is coupled to a lower level memory such as main memory), a sequential prefetch engine that is configured to check whether cache lines that are to be prefetched are currently in the L1 cache, the prefetch filter queue, and a backing array, which is coupled to the prefetch filter queue. When an entry is aged out of the prefetch filter queue information (including an address (or portion of the address) and a number of additional cache lines to prefetch) associated with the entry is stored in an entry in the backing array. The sequential prefetch engine is also coupled to the backing array and is configured to access the backing array to determine whether a cache line that requires prefetching (but is not currently in the L1 cache) has an associated entry in the backing array that specifies a number of additional cache lines that should be prefetched.
The sequential prefetch engine is also coupled to the L2 cache, which is coupled to the L1 cache. The L2 cache sources cache lines (which may be requested from a lower level cache or main memory) to the L1 cache on demand and based on a prefetch request. In one or more embodiments, the sequential prefetch engine is configured to prefetch up to seven additional sequential cache lines. As is discussed in further detail below, the number of sequential cache lines to prefetch is initially indicated by a ‘prefetch lines’ field in the prefetch filter queue, which is configured to improve instruction prefetching by reducing unnecessary prefetching. A size of the backing array determines how large an instruction footprint can be predicted. In general, implementing a relatively small (e.g., 16-32 entry) FIFO CAM for the prefetch filter queue in conjunction with a relatively large (e.g., 4096 entry) backing array results in a desirable design, as additional logic footprint required for the FIFO CAM is minimized.
In one embodiment, the backing array includes 4096 entries that are addressed by a real address (RA) or one or more portions of the RA. Assuming 64-bit addressing (bits 0-63), with bit ‘0’ corresponding to a most significant bit (MSB) and bit ‘63’ corresponding to a least significant bit (LSB), an instruction cache line size of one-hundred twenty-eight (128) bytes, and thirty-two (32) 4-byte instructions per cache line, an instruction within a cache line is specified by RA bits 57:61 and individual instruction bytes are specified by RA bits 62:63. In at least one embodiment, a backing array is addressed using twelve address bits, e.g., RA bits 45:56, that specify one of 4096 cache lines. In one or more embodiments, a four bit hash (based on RA bits 39:42) and a two bit tag (based on RA bits 40:41) may be implemented to improve addressing performance and to better avoid aliasing. As previously mentioned, the prefetch filter queue may be implemented as a 16 to 32 (e.g., 24) entry FIFO CAM.
In one or more embodiments, for each instruction cache miss a new entry is allocated in the prefetch filter queue. When the prefetch filter queue is full, each subsequent instruction cache miss causes information associated with the oldest prefetch filter queue entry to be written to an entry in the backing array. In various embodiments, addresses of all of the prefetch filter queue entries are compared against an address of each instruction that hits in the L1 cache. That is, for each instruction cache hit an RA (or a portion of the RA) of the instruction is compared against every prefetch filter queue entry in parallel. If the RA for the instruction that hit in the L1 cache matches an entry in the prefetch filter queue, the matching bit for the entry is set. When an oldest entry is aged out of the prefetch filter queue, a determination is made as to whether a match occurred for the entry and, if a match occurred, how many sequential instruction cache lines hit against the prefetch filter queue entry by examining a code that specifies an associated instruction prefetch length.
As one example, the code ‘000’ indicates that no additional cache line prefetch is required for an associated address ‘n’, as there were no instruction fetch cache hits for the address ‘n+1’. The code ‘001’ indicates that a prefetch one cache line ahead (i.e., cache line ‘n+1’) is required for an associated address ‘n’, as there was an instruction fetch cache hit for the address ‘n’ and ‘n+1’. The code ‘010’ indicates that a prefetch two cache lines ahead (i.e., ‘n+1’ and ‘n+2’) is required for an associated address ‘n’. The code ‘011’ indicates that a prefetch three cache lines ahead (i.e., ‘n+1’, ‘n+2’, and ‘n+3’) is required for an associated address ‘n’. The code ‘100’ indicates that a prefetch four cache lines ahead (i.e., ‘n+1’, . . . , and ‘n+4’) is required for an associated address ‘n’. The code ‘101’ indicates that a prefetch five cache lines ahead (‘n+1’, . . . , and ‘n+5’) is required for an associated address ‘n’. The code ‘110’ indicates that a prefetch six cache lines ahead hit (n+1, . . . , and n+6) is required for an associated address ‘n’. Finally, the code ‘111’ indicates that a prefetch seven cache lines ahead (i.e., n+1, . . . , and n+7) is required for an associated address ‘n’.
When an entry is aged out of the prefetch filter queue information associated with the entry is stored in the backing array. By access the backing array, a determination can subsequently be made as to how many additional sequential instruction cache lines should be prefetched when the RA for the instruction is subsequently encountered and the RA has an associated entry in the backing array. In one embodiment, each backing array entry includes a one bit address tag (e.g., RA bit 44) and a three bit field for specifying the number of lines to prefetch (i.e., 0 to 7). In another embodiment, each backing array entry includes a two bit address tag (e.g., RA bits 43:44), and a two bit field for specifying the number of lines to prefetch (i.e., the three bit prefetch filter queue length field is modified to two bits or four encodes (e.g., 1, 3, 5, 7 instruction cache lines ahead)).
With reference to
Data storage subsystem 104 includes one or more operating systems (OSs) 114 for data processing system 110. Data storage subsystem 104 also includes application programs, such as a browser 112 (which may optionally include customized plug-ins to support various client applications), a hypervisor (or virtual machine monitor (VMM)) 116 for managing one or more virtual machines (VMs) as instantiated by different OS images, and other applications (e.g., a word processing application, a presentation application, and an email application) 118.
Display 106 may be, for example, a cathode ray tube (CRT) or a liquid crystal display (LCD). Input device(s) 108 of data processing system 110 may include, for example, a mouse, a keyboard, haptic devices, and/or a touch screen. Network adapter 109 supports communication of data processing system 110 with one or more wired and/or wireless networks utilizing one or more communication protocols, such as 802.x, HTTP, simple mail transfer protocol (SMTP), etc. Data processing system 110 is shown coupled via one or more wired or wireless networks, such as the Internet 122, to various file servers 124 and various web page servers 126 that provide information of interest to the user of data processing system 110. Data processing environment 100 also includes one or more data processing systems 150 that are configured in a similar manner as data processing system 110. In general, data processing systems 150 represent data processing systems that are remote to data processing system 110 and that may execute OS images that may be linked to one or more OS images executing on data processing system 110.
Those of ordinary skill in the art will appreciate that the hardware components and basic configuration depicted in
With reference to
In one or more embodiments, BPU 204 includes a branch direction predictor that implements a local branch history table (LBHT) array, global branch history table (GBHT) array, and a global selection (GSEL) array. The LBHT, GBHT, and GSEL arrays (not shown) provide branch direction predictions for all instructions in a fetch group (that may include up to eight instructions). The LBHT, GBHT, and GSEL arrays are shared by all threads. The LBHT array may be directly indexed by bits (e.g., ten bits) from an instruction fetch address provided by an instruction fetch address register (IFAR). The GBHT and GSEL arrays may be indexed by the instruction fetch address hashed with a global history vector (GHV) (e.g., a 21-bit GHV reduced down to eleven bits, which provides one bit per allowed thread). The value in the GSEL array may be employed to select between the LBHT and GBHT arrays for the direction of the prediction of each individual branch. BPU 204 may also be configured to predict a target of an indirect branch whose target is correlated with a target of a previous instance of the branch utilizing a pattern cache.
IFU 206 provides fetched instructions to instruction decode unit (IDU) 208 for decoding. IDU 208 provides decoded instructions to instruction sequencing unit (ISU) 210 for dispatch. In one or more embodiments, ISU 210 is configured to dispatch instructions to various issue queues, rename registers in support of out-of-order execution, issue instructions from the various issues queues to the execution pipelines, complete executing instructions, and handle exception conditions. In various embodiments, ISU 210 is configured to dispatch instructions on a group basis. In a single thread (ST) mode, ISU 210 may dispatch a group of up to eight instructions per cycle. In simultaneous multi-thread (SMT) mode, ISU 210 may dispatch two groups per cycle from two different threads and each group can have up to four instructions. It should be appreciated that in various embodiments, all resources (e.g., renaming registers and various queue entries) must be available for the instructions in a group before the group can be dispatched. In one or more embodiments, an instruction group to be dispatched can have at most two branch and six non-branch instructions from the same thread in ST mode. In one or more embodiments, if there is a second branch the second branch is the last instruction in the group. In SMT mode, each dispatch group can have at most one branch and three non-branch instructions.
In one or more embodiments, ISU 210 employs an instruction completion table (ICT) that tracks information for each of two-hundred fifty-six (256) input/output operations (IOPs). In one or more embodiments, flush generation for the core is handled by ISU 210. For example, speculative instructions may be flushed from an instruction pipeline due to branch misprediction, load/store out-of-order execution hazard detection, execution of a context synchronizing instruction, and exception conditions. ISU 210 assigns instruction tags (ITAGs) to manage the flow of instructions. In one or more embodiments, each ITAG has an associated valid bit that is cleared when an associated instruction completes. Instructions are issued speculatively, and hazards can occur, for example, when a fixed-point operation dependent on a load operation is issued before it is known that the load operation misses a data cache. On a mis-speculation, the instruction is rejected and re-issued a few cycles later.
Following execution of dispatched instructions, ISU 210 provides the results of the executed dispatched instructions to completion unit 212. Depending on the type of instruction, a dispatched instruction is provided to branch issue queue 218, condition register (CR) issue queue 216, or unified issue queue 214 for execution in an appropriate execution unit. Branch issue queue 218 stores dispatched branch instructions for branch execution unit 220. CR issue queue 216 stores dispatched CR instructions for CR execution unit 222. Unified issued queue 214 stores instructions for floating point execution unit(s) 228, fixed point execution unit(s) 226, load/store execution unit(s) 224, among other execution units. Processor 102 also includes an SMT mode register 201 whose bits may be modified by hardware or software (e.g., an operating system (OS)). It should be appreciated that units that are not necessary for an understanding of the present disclosure have been omitted for brevity and that described functionality may be located in a different unit.
With reference to
L1 instruction cache 202 is also coupled to an L2 cache instruction demand and prefetch interface 310 (that is coupled to an L2 cache 320, which is coupled to a lower level memory such as main memory 322), a prefetch engine 308 that is configured to check whether cache lines that are to be prefetched are currently in L1 instruction cache 202, prefetch filter queue 304, and a backing array 306 (which is coupled to prefetch filter queue 304). When an entry is aged out of prefetch filter queue 304 information (including an address (or portion of the address) and a number of additional cache lines to prefetch) associated with the entry is stored in an entry in backing array 306. Prefetch engine 308 is also coupled to backing array 306 and is configured to access backing array 306 to determine whether a cache line that requires prefetching has an associated entry in backing array 306 that specifies a number of additional sequential cache lines that should be prefetched.
Prefetch engine 308 is also coupled to L2 cache 320, which is coupled to L1 instruction cache 202. L2 cache 320 sources cache lines (which may be requested from a lower level cache, or main memory 322) to L1 instruction cache 202 on demand and based on a prefetch request and stores cache lines ejected from L1 instruction cache 202. In one or more embodiments, prefetch engine 308 is configured to prefetch up to seven additional sequential cache lines that follow a cache line that is to be prefetched. As is discussed in further detail below, the number of sequential cache lines to prefetch for an entry is initially indicated by a ‘prefetch lines’ field in prefetch filter queue 304, which is configured to facilitate improved instruction prefetching by reducing unnecessary prefetching. A size of backing array 306 determines how large an instruction footprint can be predicted. In general, implementing a relatively small (e.g., 16-32 entry) FIFO CAM for prefetch filter queue 304 in conjunction with a relatively large (e.g., 4096 entry) backing array 306 results in a desirable design, as additional logic footprint required for the FIFO CAM is minimized.
In one embodiment, backing array 308 includes 4096 entries that are addressed by a real address (RA) or one or more portions of the RA. Assuming 64-bit addressing (bits 0-63), with bit ‘0’ corresponding to a most significant bit (MSB) and bit ‘63’ corresponding to a least significant bit (LSB), an instruction cache line size of one-hundred twenty-eight (128) bytes, and thirty-two (32) 4-byte instructions per cache line, an instruction within a cache line is specified by RA bits 57:61 and individual instruction bytes are specified by RA bits 62:63. In at least one embodiment, a backing array is addressed using twelve address bits that specify one of 4096 cache lines, e.g., RA bits 45:56. In one or more embodiments, a four bit hash (using RA bits 39:42) and a two bit tag (using RA bits 40:41) may be implemented to improve addressing performance and to better avoid aliasing. As previously mentioned, prefetch filter queue 304 may be implemented as a 16 to 32 (e.g., 24) entry first-in first-out (FIFO) CAM.
In one or more embodiments, for each L1 instruction cache 202 miss a new entry is allocated in prefetch filter queue 304, which causes the information associated with the oldest entry in prefetch filter queue 304 to be written to an entry in backing array 306 (assuming prefetch filter queue 304 is full). In various embodiments, addresses of all entries in prefetch filter queue 304 are compared against an address of each instruction that hits in L1 instruction cache 202. That is, for each hit in L1 instruction cache 202 an RA (or a portion of the RA) of the instruction is compared against every entry in prefetch filter queue 304 in parallel. If the RA for the instruction that hit in L1 instruction cache 202 matches an entry in prefetch filter queue 304, the matching bit for the entry is set. When an oldest entry is aged out of prefetch filter queue 304, a determination is made as to whether a match occurred for the entry and, if a match occurred, how many sequential instruction cache lines hit against the entry in prefetch filter queue 304 by examining a code that specifies an associated instruction prefetch length.
When an entry is aged out of prefetch filter queue 304 information associated with the entry is stored in backing array 306. By access backing array 306, a determination can subsequently be made as to how many additional sequential instruction cache lines should be prefetched when the RA for the instruction is subsequently encountered and the RA has an associated entry in backing array 306. In one embodiment, each entry in backing array 306 includes a one bit address tag (e.g., RA bit 44) and a three bit ‘prefetch lines’ field for specifying the number of additional lines to prefetch (i.e., 0 to 7). In another embodiment, each entry in backing array 306 includes a two bit address tag (e.g., RA bits 43:44), and a two bit ‘prefetch lines’ field for specifying the number of additional lines to prefetch (i.e., a three bit prefetch lines field of prefetch filter queue 304 length is modified to two bits or four encodes (e.g., 1, 3, 5, 7 instruction cache lines ahead)).
With reference to
As is illustrated in diagram 500 of
With reference to
With reference to
Accordingly, techniques have been disclosed herein that advantageously improve sequential instruction prefetching by increasing the number of prefetched sequential instruction cache lines that are utilized.
In the flow charts above, the methods depicted in the figures may be embodied in a computer-readable medium containing computer-readable code such that a series of steps are performed when the computer-readable code is executed on a computing device. In some implementations, certain steps of the methods may be combined, performed simultaneously or in a different order, or perhaps omitted, without deviating from the spirit and scope of the invention. Thus, while the method steps are described and illustrated in a particular sequence, use of a specific sequence of steps is not meant to imply any limitations on the invention. Changes may be made with regards to the sequence of steps without departing from the spirit or scope of the present invention. Use of a particular sequence is therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer-readable medium(s) having computer-readable program code embodied thereon.
Any combination of one or more computer-readable medium(s) may be utilized. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. A computer-readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing, but does not include a computer-readable signal medium. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be any tangible storage medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer-readable signal medium may be any computer-readable medium that is not a computer-readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer-readable signal medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be stored in a computer-readable storage medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
As will be further appreciated, the processes in embodiments of the present invention may be implemented using any combination of software, firmware or hardware. As a preparatory step to practicing the invention in software, the programming code (whether software or firmware) will typically be stored in one or more machine readable storage mediums such as fixed (hard) drives, diskettes, optical disks, magnetic tape, semiconductor memories such as ROMs, PROMs, etc., thereby making an article of manufacture in accordance with the invention. The article of manufacture containing the programming code is used by either executing the code directly from the storage device, by copying the code from the storage device into another storage device such as a hard disk, RAM, etc., or by transmitting the code for remote execution using transmission type media such as digital and analog communication links. The methods of the invention may be practiced by combining one or more machine-readable storage devices containing the code according to the present invention with appropriate processing hardware to execute the code contained therein. An apparatus for practicing the invention could be one or more processing devices and storage subsystems containing or having network access to program(s) coded in accordance with the invention.
Thus, it is important that while an illustrative embodiment of the present invention is described in the context of a fully functional computer (server) system with installed (or executed) software, those skilled in the art will appreciate that the software aspects of an illustrative embodiment of the present invention are capable of being distributed as a program product in a variety of forms, and that an illustrative embodiment of the present invention applies equally regardless of the particular type of media used to actually carry out the distribution.
While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular system, device or component thereof to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiments disclosed for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, the use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. 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” and/or “comprising,” when used in this specification, 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.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below, if any, are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiments were chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15151609 | May 2016 | US |
| Child | 16110917 | US |
