Aspects of the present disclosure are related to execution of a computer application on a computer system. In particular, aspects of the present disclosure are related to a system or a method that provides backward compatibility for applications/titles designed for older versions of a computer system.
Modern computer systems often use a number of different processors for different computing tasks. For example, in addition to a number of central processing units (CPUs), a modern computer may have a graphics processing unit (GPU) dedicated to certain computational tasks in a graphics pipeline, or a unit dedicated to digital signal processing for audio, all of which are potentially part of an accelerated processing unit (APU) that may contain other units as well. These processors are connected to memory of various types, using buses that may be internal to an APU or externally located on the computer's motherboard.
It is common that a set of applications are created for a computer system such as a video game console or smartphone (the “legacy device”), and when a variant or a more advanced version of the computer system is released (the “new device”) it is desirable for the applications of the legacy device to run flawlessly on the new device without recompilation or any modification that takes into account the properties of the new device. This aspect of the new device, as contained in its hardware architecture, firmware and operating system, is often referred to as “backwards compatibility.”
Backwards compatibility is often achieved through binary compatibility, where the new device is capable of executing programs created for the legacy device. However, when the real time behavior of the category of devices is important to their operation, as is in the case of video game consoles or smartphones, significant differences in the speed of operation of a new device may cause it to fail to be backwards compatible with respect to a legacy device. If the new device is of lower performance than the legacy device, issues that prevent backwards compatibility may arise; this is also true if the new device is of higher performance, or has different performance characteristics when compared to the legacy device.
It is within this context that aspects of the present disclosure arise.
The teachings of the present disclosure can be readily understood by considering the following detailed description in conjunction with the accompanying drawings, in which:
Although the following detailed description contains many specific details for the purposes of illustration, anyone of ordinary skill in the art will appreciate that many variations and alterations to the following details are within the scope of the invention. Accordingly, the exemplary embodiments of the invention described below are set forth without any loss of generality to, and without imposing limitations upon, the claimed invention.
Even if the CPUs of the new device are binary compatible with the legacy device (i.e. capable of executing programs created for the legacy device), differences in performance characteristics between the CPUs of the new device and the CPUs of the legacy device may cause errors in legacy applications, and as a result the new device will not be backwards compatible.
If the CPUs of the new device have lower performance than the CPUs of the legacy device, many errors in a legacy application may arise due to the inability to meet real time deadlines imposed by display timing, audio streamout or the like. If the CPUs of the new device have substantially higher performance than the CPUs of the legacy device, many errors in a legacy application may arise due to the untested consequences of such high speed operation. For example, in a producer-consumer model, if a consumer of data (e.g. the CPU) operates at higher speed than originally anticipated, it may attempt to access data before the data producer (e.g. some other component of the computer) makes it available. Alternatively if the producer of the data (e.g. the CPU) operates at higher speed than originally anticipated, it may overwrite data still being used by the data consumer (e.g. some other component of the computer).
Additionally, as speed of execution of code by a CPU depends on the characteristics of the specific code being executed, it is possible that the degree of increase of performance of the CPUs of the new device relative to the legacy device will depend on the specific code being executed. This may lead to problems in the producer-consumer model described above, where producer and consumer are both CPUs but are executing the code of the legacy application at relative speeds not encountered on the legacy hardware.
Aspects of the present disclosure describe computer systems and methods which may allow for a higher degree of backwards compatibility with regards to legacy computer systems.
In implementations of the present disclosure, certain resources relating to the CPUs are restricted and various aspects of the operation of the CPUs are altered when executing in a backwards compatibility mode (“BC mode”).
Due to the restriction of various resources, the performance of the CPUs in BC mode may become much closer to that of the legacy CPUs, resulting in fewer errors in legacy applications due to the unanticipated performance characteristics of the CPUs.
Additionally, certain features of the CPUs that are not present on legacy CPUs may be disabled in BC mode; the latency of instruction execution of the CPUs may be altered in BC mode to equal or become closer to the latency of legacy CPUs; and the algorithmic details of the operation of various units of the CPUs may be altered in BC mode to match or approximate the algorithmic details of the operation of those units of the legacy CPUs. As a result, when in BC mode, the performance of the new CPUs may become much closer to that of the legacy CPUs, resulting in fewer errors in legacy applications due to the unanticipated performance characteristics of the new CPUs.
The following describes the general architecture of a CPU, and various aspects of the present disclosure relating to the restriction of specific resources, disabling of features, alteration of latency, and alteration of algorithmic details of operation when in BC mode.
According to certain aspects of the present disclosure, in BC mode the size of the indirect target array 106, the size of the return address stack 104, or the size of the branch target buffer 108 of the new CPU may be reduced to match, or to more closely approximate, their respective size for the legacy CPU. To be clear, this reduction takes the form of reducing the usable portion of the resource, e.g. not allowing usage of a portion of the return address stack, and thereby reducing the number of calls and associated returns that can be tracked; the full resource is available when not in BC mode.
According to certain aspects of the present disclosure, in BC mode the algorithmic details of the operation of the branch target buffer 108 of the new CPU and its associated prediction logic may be altered to match those of the legacy CPU. By way of example and not by way of limitation, if the legacy CPU is limited in its ability to track the behavior of branch instructions that are close to each other, then in BC mode the new CPU may match this legacy CPU behavior; or if the legacy CPU used a substantially different style of branch prediction logic (e.g. a saturating counter rather than an adaptive predictor) then the new CPU may include the logic of the legacy CPU and enable it in BC mode.
According to certain aspects of the present disclosure, should the branch target buffer 108 of the new CPU and its associated prediction logic include a dedicated loop predictor, but no dedicated loop predictor is present on the legacy CPU, then in BC mode the dedicated loop predictor of the new CPU may be disabled.
The CPU core 100 typically includes an instruction fetch and decode unit 110, which includes an instruction fetch unit 112, an instruction byte buffer 114, and an instruction decode unit 116. The CPU core 100 also typically includes a number of instruction related caches and instruction translation lookaside buffers (ITLBs) 120. These may include an ITLB cache hierarchy 124 that caches virtual address to physical address translation information such as page table entries, page directory entries, and the like. This information is used to transform the virtual address of the instruction into a physical address so that the instruction fetch unit 112 can load the instructions from the cache hierarchy. By way of example, and not by way of limitation, the program instructions may be cached according to a cache hierarchy that includes a level 1 instruction cache (L1 I-Cache) 122 residing in the core, as well as other cache levels 176 external to the CPU core 100; using the physical address of the instruction, these caches are first searched for the program instructions. If the instructions are not found, then they are loaded from a system memory 101. Depending on the architecture, there may also be a micro-op cache 126 that contains the decoded instructions, as described below.
In certain aspects of the present disclosure, in BC mode the size or associativity of the L1 I-cache 124, the micro-op cache 126 or the various levels of the ITLB cache hierarchy 122 may be changed to match, or to more closely approximate, their respective size and associativity for the legacy CPU. By way of example, and not by way of limitation, changing, e.g., reducing, the size of the ITLB cache hierarchy 124 could involve (1) reducing the number of levels; or (2) changing the size of one or more levels (e.g., cache size, block size, number of blocks in a set). Altering the associativity of a cache may involve, e.g., operating a fully associative cache as a four-way or two-way cache. Although aspects of the present disclosure include implementations where a size or associativity of an instruction-related cache or ITLB is reduced, the present disclosure is not limited to such implementations. For example, it is possible for a legacy CPU has to have a larger cache that is less associative (e.g., 2-way instead of 4-way) in the legacy CPU. In such a case, the new CPU may run in BC mode with the corresponding cache size increased and associativity reduced to match or approximate the behavior of the cache on the legacy CPU.
Once the program instructions have been fetched, they are typically placed in the instruction byte buffer 114 awaiting processing by the instruction fetch and decode unit 110. Decoding can be a very complex process; it is difficult to decode multiple instructions each cycle, and there may be restrictions on instruction alignment or type of instruction that limit how many instructions may be decoded in a cycle. Decoded instructions may, depending on architecture, be placed in the micro-op cache 126 (if one is present on the new CPU) so that the decode stage can be bypassed for subsequent use of the program instructions.
In certain aspects of the present disclosure, in BC mode the algorithmic details of the operation of the instruction fetch and decode unit 110 of the new CPU may be altered to match those of the legacy CPU. By way of example, and not by way of limitation, if the legacy CPU restricted the decode to instructions with opcodes within a specific area in the instruction byte buffer 114, then the new CPU may similarly restrict the decode.
In certain aspects of the present disclosure, should a micro-op cache 126 be present on the new CPU and absent on the legacy CPU, then in BC mode the micro-op cache 126 of the new CPU may be disabled.
Decoded instructions are typically passed to other units for dispatch and scheduling 130. These units may use retirement queues 132 to track the status of the instructions throughout the remainder of the CPU pipeline. Also, due to the limited number of general purpose and SIMD registers available on many CPU architectures, register renaming may be performed, in which as logical (also known as architectural) registers are encountered in stream of instructions being executed, physical registers 140 are assigned to represent them. The physical registers 140 may include Single Instruction Multiple Data (SIMD) register banks 142 and General Purpose (GP) register banks 144, which can be much larger in size than the number of logical registers available on the particular CPU architecture, and as a result the performance can be considerably increased. After register renaming 134 is performed, instructions are typically placed in scheduling queues 136, from which a number of instructions may be selected each cycle (based on dependencies) for execution by execution units 150.
In certain aspects of the present disclosure, in BC mode the size of the retirement queues 132, the size of the scheduling queues 136, or the size of the SIMD 142 or GP register banks 144 of the CPU may be reduced to match, or to more closely approximate, their respective size for the legacy CPU. To be clear, this reduction takes the form of reducing the usable portion of the resource, e.g. restricting the number of physical registers available to the application in BC mode; the full register bank would be available for use by applications when not in BC mode.
The execution units 150 typically include SIMD pipes 152 that perform a number of parallel operations on multiple data fields contained in 128-bit or wider SIMD registers contained in the SIMD register bank 142, arithmetic and logic units (ALUs) 154 that perform a number of logical, arithmetic, and miscellaneous operations on GPRs contained in the GP register bank 144, and address generation units (AGUs) 156 that calculate the address from which memory should be stored or loaded. There may be multiple instances of each type of execution unit, and the instances may have differing capabilities, for example a specific SIMD pipe 152 may be able to perform floating point multiply operations but not floating point add operations.
In certain aspects of the present disclosure, in BC mode the usable number of ALUs, AGUs or SIMD pipes may be reduced to match, or to more closely approximate, the respective number of such units that exist on the legacy CPU.
In certain aspects of the present disclosure, in BC mode the latency of instruction execution of the new CPU may be altered in such a way as to equal or become closer to the latency of the legacy CPU; for example, in BC mode the latency of a divide operation on the new CPU could be extended (e.g. by computing the result more slowly or by delaying the transfer of the result to the subsequent stage of the pipeline) to match, or to more closely approximate, the latency of a divide operation on the legacy CPU.
Stores and loads are typically buffered in a store queue 162 and a load queue 164 so that many memory operations can be performed in parallel. To assist in memory operations, the CPU core 100 usually includes a number of data related caches and data translation lookaside buffers (DTLBs) 170. A DTLB cache hierarchy 172 caches virtual address to physical address translation such as page table entries, page directory entries, and the like; this information is used to transform the virtual address of the memory operation into a physical address so that data can be stored or loaded from system memory. The data is typically cached in a level 1 data cache (L1 D-Cache) 174 residing in the core, as well as other cache levels 176 external to the core 100.
In certain aspects of the present disclosure, in BC mode the size and associativity of the L1 D-cache 174 or the various levels of the DTLB cache hierarchy 172 may be reduced to match, or to more closely approximate, their respective size and associativity for the legacy CPU. In certain aspects of the present disclosure, in BC mode the size of the store queue 162 or load queue 164 of the CPU (e.g. the number of allowable outstanding stores or loads) may be reduced to match, or to more closely approximate, their respective size for the legacy CPU.
When it is determined that the loaded application is intended for a legacy CPU, the CPU runs in BC mode, with selected available resources restricted 242, with selected features not present on the legacy CPU disabled 244, with latency of execution of instructions altered 246, or with algorithmic details altered 248 or some combination of two or more of these to match or approximate behavior of the legacy CPU. Examples of these possibilities are discussed above.
By way of example, and not by way of limitation to operate the CPU with selected resources restricted 242, the BC mode may be implemented by suitable configuration of the hardware of the new CPU, by suitable configuration of an operating system that runs the CPU or some combination of both. For example, as discussed above, in BC mode the size of the indirect target array 106, the size of the return address stack 104, or the size of the branch target buffer 108 of the CPU may be reduced to match, or to more closely approximate, their respective size for the legacy CPU. By way of example and not by way of limitation, the relevant hardware may be configured so that in BC mode the operating system or CPU firmware could reduce the size of the indirect target array 106 to match, or to more closely approximate, their respective size for the legacy CPU. The following pseudocode illustrates an example of how this might be implemented:
The size of the return address stack 104, or the size of the branch target buffer 108, or other available resources may be reduced in similar manner.
In a like manner, to operate the CPU with selected features disabled 244 certain hardware resources present on the new CPU that are not present on the legacy CPU (e.g., the micro-op cache 126) may be configured so that they can be disabled by the operating system or CPU firmware in BC mode. Alternatively, hardware resources present on the new CPU that are not present on the legacy CPU may be configured so that they are ignored by the application in BC mode.
By way of example, and not by way of limitation, to operate the CPU with a latency of instruction execution of the new CPUs altered 246 to match or approximate a latency of the legacy CPU the hardware of the execution units 150 may be configured to add the equivalent of “no-op” instructions in BC mode to obtain the desired latency in BC mode.
By way of example, and not by way of limitation, to operate the new CPU with algorithmic details of operation of one or more units of the new CPU altered 248. By way of example, and not by way of limitation, the algorithmic details of operation of the branch prediction unit 102 may be altered in BC mode. For example, as discussed above, if the legacy CPU is limited in its ability to track the behavior of branch instructions that are close to each other, then in BC mode the branch prediction unit 102 may be configured to match this legacy CPU behavior in BC mode. Alternatively, if the legacy CPU uses a substantially different style of branch prediction logic (e.g. a saturating counter rather than an adaptive predictor) then the branch prediction unit 102 of the new CPU may include the logic of the legacy CPU that can be enabled in BC mode. In other implementations, the algorithmic details of operation of the instruction fetch and decode unit 110, dispatch and scheduling unit 130, or execution units 150 of a new CPU may be similarly configured with legacy logic that could be enabled in BC mode.
Turning now to
The system 300 generally includes a central processor unit (CPU) 320 which may include a CPU core and other features of the type depicted in
The system 300 may also include memory 340. The memory 340 may optionally include a main memory unit that is accessible to the CPU 320 and GPU 330. The CPU 320 and GPU 330 may each include one or more processor cores, e.g., a single core, two cores, four cores, eight cores, or more. The CPU 320 and GPU 330 may be configured to access one or more memory units using a data bus 390, and, in some implementations, it may be useful for the system 300 to include two or more different buses.
The memory 340 may include one or more memory units in the form of integrated circuits that provides addressable memory, e.g., RAM, DRAM, and the like. The memory contains executable instructions configured to implement the method of
The CPU 320 may be configured to execute CPU code, which may include operating system (OS) 321 or an application 322 (e.g., a video game). The OS 321 may be configured to implement certain features of operating the CPU 320 in the BC mode, as discussed above. The CPU code may include a graphics application programming interface (API) 324 for issuing draw commands or draw calls to programs implemented by the GPU 330 based on a state of the application 322. The CPU code may also implement physics simulations and other functions. Portions of the code for one or more of the OS 321, application 322, or API 324 may be stored in the memory 340, caches internal or external to the CPU or in a mass storage device accessible to the CPU 320.
The system 300 may also include well-known support functions 350, which may communicate with other components of the system, e.g., via the bus 390. Such support functions may include, but are not limited to, input/output (I/O) elements 352, one or more clocks 356, which may include separate clocks for the CPU and GPU, respectively, and one or more levels of cache 358, which may be external to the CPU 320. The system 300 may optionally include a mass storage device 360 such as a disk drive, CD-ROM drive, flash memory, tape drive, Blu-ray drive, or the like to store programs and/or data. In one example, the mass storage device 360 may receive a computer readable medium 362 containing a legacy application originally designed to run on a system having a legacy CPU.
Alternatively, the legacy application 362 (or portions thereof) may be stored in memory 340 or partly in the cache 358.
The device 300 may also include a display unit 380 to present rendered graphics 382 prepared by the GPU 330 to a user. The device 300 may also include a user interface unit 370 to facilitate interaction between the system 100 and a user. The display unit 380 may be in the form of a flat panel display, cathode ray tube (CRT) screen, touch screen, head mounted display (HMD) or other device that can display text, numerals, graphical symbols, or images. The display 380 may display rendered graphics 382 processed in accordance with various techniques described herein. The user interface 370 may contain one or more peripherals, such as a keyboard, mouse, joystick, light pen, game controller, touch screen, and/or other device that may be used in conjunction with a graphical user interface (GUI). In certain implementations, the state of the application 322 and the underlying content of the graphics may be determined at least in part by user input through the user interface 370, e.g., where the application 322 includes a video game or other graphics intensive application.
The system 300 may also include a network interface 372 to enable the device to communicate with other devices over a network. The network may be, e.g., a local area network (LAN), a wide area network such as the internet, a personal area network, such as a Bluetooth network or other type of network. Various ones of the components shown and described may be implemented in hardware, software, or firmware, or some combination of two or more of these.
According to aspects of the present disclosure, the CPU 320 may include hardware components such as the components of the CPU core 100 of
Aspects of the present disclosure overcome problems with backward compatibility that arise when programs written for a legacy system run on a more powerful new system. By running the new CPU in BC mode with selected available resources restricted, with selected features not present on the legacy CPU disabled, with latency of execution of instructions altered, or with algorithmic details altered or some combination of two or more of these the new CPU can match or approximate the behavior of the legacy CPU.
While the above is a complete description of the preferred embodiment of the present invention, it is possible to use various alternatives, modifications and equivalents. Therefore, the scope of the present invention should be determined not with reference to the above description but should, instead, be determined with reference to the appended claims, along with their full scope of equivalents. Any feature described herein, whether preferred or not, may be combined with any other feature described herein, whether preferred or not. In the claims that follow, the indefinite article “A”, or “An” refers to a quantity of one or more of the item following the article, except where expressly stated otherwise. As used herein, in a listing of elements in the alternative, the term “or” is used as the inclusive sense, e.g., “X or Y” covers X alone, Y alone, or both X and Y together, except where expressly stated otherwise. Two or more elements listed as alternatives may be combined together. The appended claims are not to be interpreted as including means-plus-function limitations, unless such a limitation is explicitly recited in a given claim using the phrase “means for.”
This application is a continuation of U.S. patent application Ser. No. 14/810,361 filed Jul. 27, 2015, the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5805792 | Swoboda et al. | Sep 1998 | A |
6006310 | Klein | Dec 1999 | A |
6526463 | Ding et al. | Feb 2003 | B1 |
6651156 | Courtright et al. | Nov 2003 | B1 |
6671791 | McGrath | Dec 2003 | B1 |
6772315 | Perego | Aug 2004 | B1 |
7036008 | Raghavachari et al. | Apr 2006 | B2 |
7046245 | Cerny et al. | May 2006 | B2 |
7081893 | Cerny | Jul 2006 | B2 |
7171543 | Ronen et al. | Jan 2007 | B1 |
7685593 | Solomon et al. | Mar 2010 | B2 |
7757214 | Palczak et al. | Jul 2010 | B1 |
7786993 | Cerny et al. | Aug 2010 | B2 |
8031192 | Cerny | Oct 2011 | B2 |
8149242 | Langyel et al. | Apr 2012 | B2 |
8174527 | Cerny et al. | May 2012 | B2 |
8274518 | Blythe | Sep 2012 | B2 |
8423976 | Zwirner et al. | Apr 2013 | B2 |
8782645 | Breternitz et al. | Jul 2014 | B2 |
8832679 | Suchy | Sep 2014 | B2 |
8881139 | Acacio | Nov 2014 | B1 |
9495790 | Cerny | Nov 2016 | B2 |
9652882 | Cerny | May 2017 | B2 |
9761113 | Gelineau et al. | Sep 2017 | B1 |
9892024 | Cerny et al. | Feb 2018 | B2 |
10120663 | Hasabnis | Nov 2018 | B2 |
10235219 | Cerny et al. | Mar 2019 | B2 |
10275239 | Simpson et al. | Apr 2019 | B2 |
20010033287 | Naegle et al. | Oct 2001 | A1 |
20030112238 | Cerny et al. | Jun 2003 | A1 |
20030112240 | Cerny | Jun 2003 | A1 |
20030217280 | Keaton et al. | Nov 2003 | A1 |
20040003211 | Damron | Jan 2004 | A1 |
20040059887 | Venkatraman | Mar 2004 | A1 |
20050015569 | So et al. | Jan 2005 | A1 |
20050033831 | Rashid | Feb 2005 | A1 |
20050123032 | Chen | Jun 2005 | A1 |
20050154915 | Peterson et al. | Jul 2005 | A1 |
20060001674 | Cerny et al. | Jan 2006 | A1 |
20060005200 | Vega et al. | Jan 2006 | A1 |
20060010450 | Culter | Jan 2006 | A1 |
20060046819 | Nguyen et al. | Mar 2006 | A1 |
20060069534 | Kinney | Mar 2006 | A1 |
20060146057 | Blythe | Jul 2006 | A1 |
20060281556 | Solomon et al. | Dec 2006 | A1 |
20070002049 | Cerny | Jan 2007 | A1 |
20070016895 | Tan | Jan 2007 | A1 |
20070050594 | Augsburg et al. | Mar 2007 | A1 |
20070061634 | Marisetty et al. | Mar 2007 | A1 |
20070156391 | Guenthner et al. | Jul 2007 | A1 |
20070198982 | Bolan et al. | Aug 2007 | A1 |
20070271560 | Wahlert et al. | Nov 2007 | A1 |
20080010408 | Shen et al. | Jan 2008 | A1 |
20080141131 | Cerny et al. | Jun 2008 | A1 |
20080141279 | Mattson et al. | Jun 2008 | A1 |
20080172524 | Singh et al. | Jul 2008 | A1 |
20090002380 | Langyel et al. | Jan 2009 | A1 |
20090063772 | Magoshi | Mar 2009 | A1 |
20090119477 | Plondke et al. | May 2009 | A1 |
20090164766 | Suggs et al. | Jun 2009 | A1 |
20100095097 | Gschwind | Apr 2010 | A1 |
20100218029 | Floyd et al. | Aug 2010 | A1 |
20100283783 | Cerny et al. | Nov 2010 | A1 |
20110103494 | Ahmadi | May 2011 | A1 |
20110292161 | Sharon et al. | Dec 2011 | A1 |
20120033673 | Goel | Feb 2012 | A1 |
20120124347 | Dundas et al. | May 2012 | A1 |
20120142425 | Scott et al. | Jun 2012 | A1 |
20130339649 | Hsu et al. | Dec 2013 | A1 |
20140007097 | Chin et al. | Jan 2014 | A1 |
20140082625 | Busaba et al. | Mar 2014 | A1 |
20140181487 | Sasanka | Jun 2014 | A1 |
20140282425 | Zhao et al. | Sep 2014 | A1 |
20140304771 | Reierson et al. | Oct 2014 | A1 |
20140362081 | Cerny et al. | Dec 2014 | A1 |
20140362100 | Cerny et al. | Dec 2014 | A1 |
20140362101 | Cerny et al. | Dec 2014 | A1 |
20140362102 | Cerny et al. | Dec 2014 | A1 |
20150280979 | Pesonen | Oct 2015 | A1 |
20150287158 | Cerny et al. | Oct 2015 | A1 |
20150287165 | Berghoff | Oct 2015 | A1 |
20150287166 | Cerny | Oct 2015 | A1 |
20150287167 | Cerny | Oct 2015 | A1 |
20150287230 | Cerny | Oct 2015 | A1 |
20150287231 | Berghoff | Oct 2015 | A1 |
20150287232 | Cerny | Oct 2015 | A1 |
20150287239 | Berghoff | Oct 2015 | A1 |
20160092677 | Patel et al. | Mar 2016 | A1 |
20160210173 | Bookman et al. | Jul 2016 | A1 |
20160246323 | Cerny et al. | Aug 2016 | A1 |
20160246652 | Herdrich et al. | Aug 2016 | A1 |
20170001732 | Lim | Jan 2017 | A1 |
20170003984 | Gatson et al. | Jan 2017 | A1 |
20170031732 | Cerny et al. | Feb 2017 | A1 |
20170031834 | Cerny et al. | Feb 2017 | A1 |
20170052780 | Clevenger et al. | Feb 2017 | A1 |
20170061671 | Cerny | Mar 2017 | A1 |
20170123961 | Cerny et al. | May 2017 | A1 |
20170124760 | Murakawa et al. | May 2017 | A1 |
20170192796 | Kunjuraman et al. | Jul 2017 | A1 |
20170228225 | Rachlin | Aug 2017 | A1 |
20170286282 | Simpson et al. | Oct 2017 | A1 |
20190265984 | Simpson et al. | Aug 2019 | A1 |
20210157610 | Simpson et al. | May 2021 | A1 |
Number | Date | Country |
---|---|---|
1716203 | Jan 2006 | CN |
1797344 | Jul 2006 | CN |
102270291 | Dec 2011 | CN |
103562870 | Feb 2014 | CN |
2924564 | Sep 2015 | EP |
649528 | Jan 1989 | JP |
2008513913 | May 2008 | JP |
2008139964 | Jun 2008 | JP |
2014182813 | Sep 2014 | JP |
101220072 | Jan 2013 | KR |
Entry |
---|
Co-Pending U.S. Appl. No. 62/315,315, to David Simpson and Mark Cerny, filed Mar. 30, 2016. |
Co-Pending U.S. Appl. No. 62/315,345, to Mark Cerny and David Simpson, filed Mar. 30, 2016. |
Extended European Search Report dated Jan. 2, 2020 for Application EP17776336.4. |
Extended European Search Report dated Oct. 31, 2019 for Patent Application No. 17776335.6. |
Final Office Action for U.S. Appl. No. 14/810,334, dated Mar. 12, 2018. |
Final Office Action for U.S. Appl. No. 14/810,361, dated Dec. 11, 2019. |
Final Office Action for U.S. Appl. No. 14/810,361, dated Dec. 28, 2018. |
Final Office Action for U.S. Appl. No. 14/810,361, dated July Jun. 2021. |
Final Office Action for U.S. Appl. No. 14/810,361, dated Nov. 6, 2020. |
Final Office Action for U.S. Appl. No. 14/810,361, dated Oct. 20, 2017. |
Final Office Action for U.S. Appl. No. 15/466,759, dated Oct. 26, 2018. |
Final Office Action for U.S. Appl. No. 14/810,334, dated Mar. 10, 2017. |
Final Office Action for U.S. Appl. No. 14/810,334, dated May 31, 2017. |
International Search Report and Written Opinion for International Application No. PCT/US2016/041762, dated Oct. 5, 2016. |
International Search Report and Written Opinion for International Application No. PCT/US2016/041767, dated Oct. 11, 2016. |
International Search Report dated Jun. 1, 2017 for International Patent Application No. PCT/US2017/023771. |
Japanese Office Action for JP Application No. 2021-018039, dated Mar. 1, 2022. |
Non-Final Office Action for U.S. Appl. No. 14/810,361, dated Dec. 9, 2021. |
Non-Final Office Action for U.S. Appl. No. 14/810,361, dated Jul. 23, 2019. |
Non-Final Office Action for U.S. Appl. No. 14/810,361, dated Jul. 8, 2020. |
Non-Final Office Action for U.S. Appl. No. 14/810,361, dated Jun. 2, 2017. |
Non-Final Office Action for U.S. Appl. No. 14/810,361, dated Mar. 28, 2018. |
Non-Final Office Action for U.S. Appl. No. 14/810,361, dated Mar. 4, 2021. |
Non-Final Office Action for U.S. Appl. No. 15/466,759, dated Aug. 9, 2018. |
Non-Final Office Action for U.S. Appl. No. 14/810,334, dated Nov. 16, 2016. |
Non-Final/Final Office Action for U.S. Appl. No. 14/810,334, dated Sep. 12, 2017. |
Non-Final/Final Office Action for U.S. Appl. No. 16/408,054, dated May 13, 2020. |
Notice of Allowance for U.S. Appl. No. 14/810,334, dated Oct. 31, 2018. |
Notice of Allowance for U.S. Appl. No. 14/810,361, dated Mar. 25, 2022. |
Notice of Allowance for U.S. Appl. No. 15/466,759, dated Dec. 12, 2018. |
Notice of Allowance for U.S. Appl. No. 15/466,769, dated Jan. 17, 2019. |
Notice of Allowance for U.S. Appl. No. 16/408,054, dated Sep. 18, 2020. |
Notice of Allowance for U.S. Appl. No. 17/170,692, dated Jun. 23, 2022. |
Office Action dated Feb. 3, 2020 for Chinese Patent Application No. 201610577282.0. |
Office Action dated Apr. 14, 2020 for Korean patent application No. 2020-7007454. |
Office Action dated Jan. 29, 2021 for Korean Patent Application 10-2020-7031882. |
Office Action dated Jun. 6, 2018 for Taiwan Patent Application No. 105120792. |
Office Action dated May 14, 2019 for Chinese Patent Application No. 201610577282.0. |
Office Action dated Oct. 12, 2020 for Chinese Patent Application No. 201610577282.0. |
Co-Pending U.S. Appl. No. 17/903,763, to David Simpson, filed Sep. 13, 2022. |
Japanese Office Action for Country Code Application No. 2021-127683, dated Aug. 17, 2022. |
Japanese Office Action for Japanese Application No. 2023-002896, dated Aug. 16, 2023. |
Number | Date | Country | |
---|---|---|---|
20220326951 A1 | Oct 2022 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14810361 | Jul 2015 | US |
Child | 17852821 | US |