A cache in a central processing unit is a data storage structure that is used by the central processing unit of a computer to reduce the average time that it takes to access memory. It is a memory which stores copies of data that is located in the most frequently used main memory locations. Cache memory is memory that is smaller in storage capacity than main memory but is memory that can be accessed much more quickly.
A cache is considered to be full when it does not have space available to accommodate incoming data. When a cache is full, writes to the cache can be prevented from proceeding. Accordingly, write stalls can occur until a successful write-back or flushing of data that is maintained in the cache is executed and space is created to accommodate the incoming data.
Cache flushing removes an entry or entries from the cache such that space is freed for incoming data. The removal can be from the cache to a next level cache. This can be done either manually or automatically.
Some conventional caches are organized such that the contents of a lower level cache are contained in a next higher level cache. Such organization can provide performance advantages and disadvantages. However, some higher level caches may not include the contents of the lower level cache. In particular, the cache line entries of a lower level cache with modified data may not be included in the next level cache. A problem can arise when cache line entries of a cache with modified data that are not included in a next level cache needs to be flushed from the cache with modified data to the next level cache. If a lower level cache is included in a higher level cache, it is enough to flush the higher level cache to the next higher level cache (relative to itself) or main memory. When a lower level cache is not included in a higher level cache, the flush operation of this higher level cache cannot simultaneously effect the flushing of the lower level cache as well.
A conventional approach to flushing cache line entries from a cache with modified data to a next level cache in such circumstances is to stop the traffic on one of the ports of the cache with modified data and to inject flush requests from that port to write-back cache line entries from the cache with modified data one index and way at a time. However, this approach can have adverse timing impacts and has the potential to degrade performance. In addition, this approach can require a complex implementation.
Conventional approaches to flushing data from a cache with modified data to a next level cache can have adverse timing impacts that can degrade performance. In addition, such approaches can require a complex implementation. A method for flushing data from a lower level cache (a cache with modified data in one embodiment) to a higher level (e.g., a next level cache) is disclosed that addresses these shortcomings. However, the claimed embodiments are not limited to implementations that address any or all of the aforementioned shortcomings. As a part of the method, responsive to a request to flush data from a cache with modified data to a next level cache that does not include the cache with modified data, the cache with modified data is accessed using an index and a way to secure the address associated with that index and the way. Using this address, the cache with modified data is accessed a second time and an entry that is associated with the address is retrieved from the cache with modified data. The entry is placed into a location of the next level cache. The aforementioned methodology does not negatively impact timing or degrade performance. In addition, the methodology is amenable to a straightforward implementation.
The invention, together with further advantages thereof, may best be understood by reference to the following description taken in conjunction with the accompanying drawings in which:
It should be noted that like reference numbers refer to like elements in the figures.
Although the present invention has been described in connection with one embodiment, the invention is not intended to be limited to the specific forms set forth herein. On the contrary, it is intended to cover such alternatives, modifications, and equivalents as can be reasonably included within the scope of the invention as defined by the appended claims.
In the following detailed description, numerous specific details such as specific method orders, structures, elements, and connections have been set forth. It is to be understood however that these and other specific details need not be utilized to practice embodiments of the present invention. In other circumstances, well-known structures, elements, or connections have been omitted, or have not been described in particular detail in order to avoid unnecessarily obscuring this description.
References within the specification to “one embodiment” or “an embodiment” are intended to indicate that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. The appearance of the phrase “in one embodiment” in various places within the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others. Similarly, various requirements are described which may be requirements for some embodiments but not other embodiments.
Some portions of the detailed descriptions, which follow, are presented in terms of procedures, steps, logic blocks, processing, and other symbolic representations of operations on data bits within a computer memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. A procedure, computer executed step, logic block, process, etc., is here, and generally, conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals of a computer readable storage medium and are capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as “accessing” or “identifying” or “placing” or the like, refer to the action and processes of a computer system, or similar electronic computing device that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories and other computer readable media into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Referring
In one embodiment, because store coalescing cache 103a is not included in L2 cache 107, requests to flush store coalescing cache 103a to L2 cache 107 can cause stalls in the absence of a mechanism for facilitating the acquisition by L2 cache 107 of information that is needed to flush data from store coalescing cache 103a to L2 cache 107. In one embodiment, this mechanism is provided by system 101, which as a part of its operation directs a securing of information from store coalescing cache 103a that is needed to access store coalescing cache 103a at the pipeline speed of L2 cache 107. In one embodiment, L2 cache 107 controls the probe that is used to access and read data from store coalescing cache 103a.
Referring to
Referring again to
Referring to
At B, a probe of the cache with modified data (e.g., store coalescing cache 103a in
At C, the address in the cache with modified data (e.g., store coalescing cache 103a in
At D, the address is used to probe the cache with modified data a second time to obtain the data associated with the address.
At E, the data associated with the address in the cache with modified data is obtained and provided to the next level cache.
At F, the data is placed into a location of the next level cache. In one embodiment, the flushing of a cache with modified data can be done periodically while the cache is idling and no stores are incoming.
Flush request accessor 201 accesses a request to flush data from a cache with modified data to a next level cache. In one embodiment, the request can be one of an on-going series of periodic requests to flush data from the cache with modified data. In one embodiment, the flushing of data from the cache with modified data can be done to free up space for newer data based on the expectation that newer data will be received. In one embodiment, the request is directed to the next level cache (e.g., an L2 cache).
Cache probe 203, responsive to the request to flush data from a cache with modified data, accesses (e.g., probes) the cache with modified data using an index and a way and identifies an address associated with the index and way. Subsequently, using the address, cache probe 203 accesses (e.g., probes) the cache with modified data a second time and retrieves data that is located at the location that is indicated by the index and way.
Writing component 205 places the data that is retrieved into a location of the next level cache. In one embodiment, the contents of the cache with modified data are not included in the next level cache and thus before an entry (e.g., cache line entry with data) from the cache with modified data can be flushed to the next level cache, the address associated with the entry is obtained such that the entry can be identified and flushed to the next level cache and placed into a location there as a new entry.
It should be appreciated that the aforementioned components of system 101 can be implemented in hardware or software or in a combination of both. In one embodiment, components and operations of system 101 can be encompassed by components and operations of one or more computer components or programs (e.g., cache controller 107a in
Referring to
At 303, responsive to the request, a cache with modified data is accessed using an index and a way. In one embodiment, the index and way is used because the address associated with the desired entry is not available.
At 305, an address associated with said index and said way is secured (e.g., identified) from the cache with modified data. The securing of the address enables a subsequent retrieval of the entry associated with the address.
At 307, using the address, the cache with modified data is accessed a second time. In one embodiment, the access of the cache with modified data (in both 305 and 307) is executed using a probe that is controlled by the next level cache.
At 309, data is retrieved that is associated with the address. And, at 311, the data is written into a location of the next level cache.
With regard to exemplary embodiments thereof, systems and methods for flushing a cache with modified data are disclosed. Responsive to a request to flush data from a cache with modified data to a next level cache that does not include the cache with modified data, the cache with modified data is accessed using an index and a way and an address associated with the index and the way is secured. Using the address, the cache with modified data is accessed a second time and an entry that is associated with the address is retrieved from the cache with modified data. The entry is placed into a location of the next level cache.
Although many of the components and processes are described above in the singular for convenience, it will be appreciated by one of skill in the art that multiple components and repeated processes can also be used to practice the techniques of the present invention. Further, while the invention has been particularly shown and described with reference to specific embodiments thereof, it will be understood by those skilled in the art that changes in the form and details of the disclosed embodiments may be made without departing from the spirit or scope of the invention. For example, embodiments of the present invention may be employed with a variety of components and should not be restricted to the ones mentioned above. It is therefore intended that the invention be interpreted to include all variations and equivalents that fall within the true spirit and scope of the present invention.
The present application is a continuation of U.S. patent application Ser. No. 13/561,491, filed Jul. 30, 2012, entitled “SYSTEMS AND METHODS FOR FLUSHING A CACHE WITH MODIFIED DATA,” which is herein incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4075704 | O'Leary | Feb 1978 | A |
4245344 | Richter | Jan 1981 | A |
4356550 | Katzman et al. | Oct 1982 | A |
4414624 | Summer, Jr. et al. | Nov 1983 | A |
4524415 | Mills, Jr. et al. | Jun 1985 | A |
4527237 | Frieder et al. | Jul 1985 | A |
4577273 | Hopper et al. | Mar 1986 | A |
4597061 | Cline et al. | Jun 1986 | A |
4600986 | Scheuneman et al. | Jul 1986 | A |
4633434 | Scheuneman | Dec 1986 | A |
4682281 | Woffinden et al. | Jul 1987 | A |
4816991 | Watanabe et al. | Mar 1989 | A |
4920477 | Colwell et al. | Apr 1990 | A |
5294897 | Notani et al. | Mar 1994 | A |
5317705 | Gannon et al. | May 1994 | A |
5317754 | Blandy et al. | May 1994 | A |
5548742 | Wang et al. | Aug 1996 | A |
5559986 | Alpert et al. | Sep 1996 | A |
5574878 | Onodera et al. | Nov 1996 | A |
5581725 | Nakayama | Dec 1996 | A |
5634068 | Nishtala et al. | May 1997 | A |
5752260 | Liu | May 1998 | A |
5754818 | Mohamed | May 1998 | A |
5787494 | Delano et al. | Jul 1998 | A |
5793941 | Pencis et al. | Aug 1998 | A |
5802602 | Rahman et al. | Sep 1998 | A |
5806085 | Berliner | Sep 1998 | A |
5813031 | Chou et al. | Sep 1998 | A |
5835951 | McMahan | Nov 1998 | A |
5852738 | Bealkowski et al. | Dec 1998 | A |
5860146 | Vishin et al. | Jan 1999 | A |
5864657 | Stiffler | Jan 1999 | A |
5872985 | Kimura | Feb 1999 | A |
5881277 | Bondi et al. | Mar 1999 | A |
5903750 | Yeh et al. | May 1999 | A |
5905509 | Jones et al. | May 1999 | A |
5918251 | Yamada et al. | Jun 1999 | A |
5956753 | Glew et al. | Sep 1999 | A |
5974506 | Sicola et al. | Oct 1999 | A |
6016533 | Tran | Jan 2000 | A |
6073230 | Pickett et al. | Jun 2000 | A |
6075938 | Bugnion et al. | Jun 2000 | A |
6088780 | Yamada et al. | Jul 2000 | A |
6092172 | Nishimoto et al. | Jul 2000 | A |
6101577 | Tran | Aug 2000 | A |
6115809 | Mattson, Jr. et al. | Sep 2000 | A |
6134634 | Marshall, Jr. et al. | Oct 2000 | A |
6138226 | Yoshioka et al. | Oct 2000 | A |
6157998 | Rupley, II et al. | Dec 2000 | A |
6167490 | Levy et al. | Dec 2000 | A |
6205545 | Shah et al. | Mar 2001 | B1 |
6212613 | Belair | Apr 2001 | B1 |
6226732 | Pei et al. | May 2001 | B1 |
6247097 | Sinharoy | Jun 2001 | B1 |
6253316 | Tran et al. | Jun 2001 | B1 |
6256727 | McDonald | Jul 2001 | B1 |
6256728 | Witt et al. | Jul 2001 | B1 |
6260131 | Kikuta et al. | Jul 2001 | B1 |
6260138 | Harris | Jul 2001 | B1 |
6272662 | Jadav et al. | Aug 2001 | B1 |
6275917 | Okada | Aug 2001 | B1 |
6321298 | Hubis | Nov 2001 | B1 |
6332189 | Baweja et al. | Dec 2001 | B1 |
6341324 | Caulk, Jr. et al. | Jan 2002 | B1 |
6437789 | Tidwell et al. | Aug 2002 | B1 |
6449671 | Patkar et al. | Sep 2002 | B1 |
6457120 | Sinharoy | Sep 2002 | B1 |
6557083 | Sperber et al. | Apr 2003 | B1 |
6594755 | Nuechterlein et al. | Jul 2003 | B1 |
6604187 | McGrath et al. | Aug 2003 | B1 |
6609189 | Kuszmaul et al. | Aug 2003 | B1 |
6658549 | Wilson et al. | Dec 2003 | B2 |
6681395 | Nishi | Jan 2004 | B1 |
6907600 | Neiger et al. | Jun 2005 | B2 |
6912644 | O'Connor et al. | Jun 2005 | B1 |
7007108 | Emerson et al. | Feb 2006 | B2 |
7111145 | Chen et al. | Sep 2006 | B1 |
7143273 | Miller et al. | Nov 2006 | B2 |
7149872 | Rozas et al. | Dec 2006 | B2 |
7213106 | Koster et al. | May 2007 | B1 |
7278030 | Chen et al. | Oct 2007 | B1 |
7380096 | Rozas et al. | May 2008 | B1 |
7406581 | Southwell et al. | Jul 2008 | B2 |
7546420 | Shar et al. | Jun 2009 | B1 |
7680988 | Nickolls et al. | Mar 2010 | B1 |
7783868 | Ukai | Aug 2010 | B2 |
7856530 | Mu | Dec 2010 | B1 |
7913058 | Rozas et al. | Mar 2011 | B2 |
8145844 | Bruce | Mar 2012 | B2 |
8239656 | Rozas et al. | Aug 2012 | B2 |
8301847 | Dantzig et al. | Oct 2012 | B2 |
8522253 | Rozas et al. | Aug 2013 | B1 |
8868838 | Glasco et al. | Oct 2014 | B1 |
8930674 | Avudaiyappan et al. | Jan 2015 | B2 |
9047178 | Talagala et al. | Jun 2015 | B2 |
20010049782 | Hsu et al. | Dec 2001 | A1 |
20020069326 | Richardson et al. | Jun 2002 | A1 |
20020082824 | Neiger et al. | Jun 2002 | A1 |
20020099913 | Steely et al. | Jul 2002 | A1 |
20030065887 | Maiyuran et al. | Apr 2003 | A1 |
20030088752 | Harman | May 2003 | A1 |
20040034762 | Kacevas | Feb 2004 | A1 |
20040044850 | George et al. | Mar 2004 | A1 |
20040064668 | Kjos et al. | Apr 2004 | A1 |
20040093483 | Nguyen et al. | May 2004 | A1 |
20040103251 | Alsup | May 2004 | A1 |
20040117593 | Uhlig et al. | Jun 2004 | A1 |
20040117594 | Vanderspek | Jun 2004 | A1 |
20040143727 | McDonald | Jul 2004 | A1 |
20040193857 | Miller et al. | Sep 2004 | A1 |
20040205296 | Bearden | Oct 2004 | A1 |
20040215886 | Cargnoni et al. | Oct 2004 | A1 |
20040225872 | Bonanno et al. | Nov 2004 | A1 |
20050005085 | Miyanaga | Jan 2005 | A1 |
20050027961 | Zhang | Feb 2005 | A1 |
20050060457 | Olukotun | Mar 2005 | A1 |
20050108480 | Correale, Jr. et al. | May 2005 | A1 |
20050154867 | Dewitt et al. | Jul 2005 | A1 |
20060004964 | Conti et al. | Jan 2006 | A1 |
20060026381 | Doi et al. | Feb 2006 | A1 |
20060190707 | McIlvaine et al. | Aug 2006 | A1 |
20060236074 | Williamson et al. | Oct 2006 | A1 |
20060277365 | Pong | Dec 2006 | A1 |
20080077813 | Keller et al. | Mar 2008 | A1 |
20080091880 | Vishin | Apr 2008 | A1 |
20080126771 | Chen et al. | May 2008 | A1 |
20080195844 | Shen et al. | Aug 2008 | A1 |
20080215865 | Hino et al. | Sep 2008 | A1 |
20080235500 | Davis et al. | Sep 2008 | A1 |
20080270758 | Ozer et al. | Oct 2008 | A1 |
20080270774 | Singh et al. | Oct 2008 | A1 |
20080282037 | Kusachi et al. | Nov 2008 | A1 |
20090138659 | Lauterbach | May 2009 | A1 |
20090157980 | Bruce | Jun 2009 | A1 |
20090158017 | Mutlu et al. | Jun 2009 | A1 |
20090164733 | Kim et al. | Jun 2009 | A1 |
20090172344 | Grochowski et al. | Jul 2009 | A1 |
20090287912 | Sendag | Nov 2009 | A1 |
20100138607 | Hughes et al. | Jun 2010 | A1 |
20100169578 | Nychka et al. | Jul 2010 | A1 |
20100169611 | Chou et al. | Jul 2010 | A1 |
20100211746 | Tsukishiro | Aug 2010 | A1 |
20110010521 | Wang et al. | Jan 2011 | A1 |
20110082980 | Gschwind et al. | Apr 2011 | A1 |
20110082983 | Koktan | Apr 2011 | A1 |
20110153955 | Herrenschmidt et al. | Jun 2011 | A1 |
20120005462 | Hall et al. | Jan 2012 | A1 |
20120042126 | Krick et al. | Feb 2012 | A1 |
20130019047 | Podvalny et al. | Jan 2013 | A1 |
20130046934 | Nychka et al. | Feb 2013 | A1 |
20130086417 | Sivaramakrishnan et al. | Apr 2013 | A1 |
20130097369 | Talagala et al. | Apr 2013 | A1 |
20130238874 | Avudaiyappan et al. | Sep 2013 | A1 |
20130304991 | Boettcher et al. | Nov 2013 | A1 |
20130311759 | Abdallah | Nov 2013 | A1 |
20130346699 | Walker | Dec 2013 | A1 |
20140032844 | Avudaiyappan et al. | Jan 2014 | A1 |
20140032845 | Avudaiyappan et al. | Jan 2014 | A1 |
20140032856 | Avudaiyappan | Jan 2014 | A1 |
20140075168 | Abdallah | Mar 2014 | A1 |
20140108730 | Avudaiyappan et al. | Apr 2014 | A1 |
20140156947 | Avudaiyappan | Jun 2014 | A1 |
20140281242 | Abdallah et al. | Sep 2014 | A1 |
20160041908 | Avudaiyappan | Feb 2016 | A1 |
20160041913 | Avudaiyappan | Feb 2016 | A1 |
20160041930 | Avudaiyappan | Feb 2016 | A1 |
Number | Date | Country |
---|---|---|
1305150 | Jul 2001 | CN |
0596636 | May 1994 | EP |
0706133 | Apr 1996 | EP |
2343270 | May 2000 | GB |
200707284 | Mar 1995 | TW |
539996 | Jul 2003 | TW |
200401187 | Jan 2004 | TW |
591530 | Jun 2004 | TW |
I233545 | Jun 2005 | TW |
I281121 | May 2007 | TW |
0125921 | Apr 2001 | WO |
Entry |
---|
Notice of Allowance from U.S. Appl. No. 13/561,570, dated Aug. 27, 2015, 9 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,570, dated Dec. 7, 2015, 7 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,570, dated Jan. 29, 2015, 9 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,570, dated Jun. 20, 2014, 8 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,570, dated May 20, 2015, 9 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,570, dated Oct. 22, 2014, 16 pages. |
Notice of Allowance from U.S. Appl. No. 14/922,035 dated Apr. 10, 2017, 21 pages. |
Notice of Allowance from U.S. Appl. No. 14/922,035, dated Jan. 27, 2017, 5 pages. |
Notice of Allowance from U.S. Appl. No. 14/922,042 dated Mar. 30, 2017, 8 pages. |
Rotenberg E., et al.,“Trace Cache: a Low Latency Approach to High Bandwidth Instruction Fetching,” Apr. 11, 1996, 48 pages. |
Techopedia, Cache Memory Definition, www.techopedia.com/definition/6307/cache-memory. |
Wallace S., et al.,“Multiple Branch and Block Prediction,” Third International symposium on High-Performance Computer Architecture, IEEE, Feb. 1997, pp. 94-103. |
Ye J., et al.,“A New Recovery Mechanism in Superscalar Microprocessors by Recovering Critical Misprediction,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011, vol. E94-A (12), pp. 2639-2648. |
Yeh T., et al.,“Increasing the Instruction Fetch Rate Via Multiple Branch Prediction and a Branch Address Cache,” 7th International Conference on Supercomputing, ACM, 1993, pp. 67-76. |
Barham P., et al., “Xen and the Art of Virtualization,” Proceedings of the ACM Symposium on Operating Systems Principles, XP002298786, Oct. 2003, pp. 164-177. |
Cooperman G.,“Cache Basics,” 2003, pp. 1-3, URL: http://www.ccs.neu.edu/course/com3200/parent/NOTES/cache-basics.html. |
Final Office Action from U.S. Appl. No. 13/561,441, dated Oct. 14, 2016, 14 pages. |
Final Office Action from U.S. Appl. No. 13/561,441, dated Sep. 26, 2014, 16 pages. |
Final Office Action from U.S. Appl. No. 13/561,491, dated Jan. 14, 2015, 14 pages. |
Final Office Action from U.S. Appl. No. 13/561,491, dated Nov. 12, 2014, 14 pages. |
Final Office Action from U.S. Appl. No. 13/561,491, dated Oct. 13, 2015, 16 pages. |
Final Office Action from U.S. Appl. No. 13/561,528, dated Nov. 10, 2014, 19 pages. |
Final Office Action from U.S. Appl. No. 14/173,602 dated Apr. 13, 2017, 26 pages. |
Final Office Action from U.S. Appl. No. 14/173,602, dated Jan. 8, 2016, 32 pages. |
Final Office Action from U.S. Appl. No. 14/173,602, dated Jan. 9, 2017, 18 pages. |
Final Office Action from U.S. Appl. No. 14/922,035, dated Oct. 14, 2016, 29 pages. |
Final Office Action from U.S. Appl. No. 14/922,042, dated Oct. 14, 2016, 15 pages. |
Final Office Action from U.S. Appl. No. 14/922,053, dated Oct. 14, 2016, 16 pages. |
Garmany J., “The Power of Indexing,” archieved on Mar. 9, 2009, 7 pages. |
International Preliminary Report on Patentability for Application No. PCT/US2013/051128, dated Feb. 12, 2015, 8 pages. |
International Search Report and Written Opinion for Application No. PCT/US2013/051128, dated Oct. 30, 2013, 9 pages. |
Jacobson et al., “Path-based Next Trace Prediction,” IEEE, 1997, pp. 14-23. |
Nanda A.K., et al., “The Misprediction Recovery Cache,” International Journal of Parallel Programming, Plenum Publishing Corporation, 1998, vol. 26 (4), pp. 383-415. |
Non-Final Office Action from U.S. Appl. No. 13/561,441, dated Dec. 22, 2014, 13 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,441, dated Jan. 9, 2017, 17 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,441, dated Jun. 4, 2014, 12 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,441, dated May 17, 2016, 17 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,491, dated Feb. 8, 2016, 16 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,491, dated Jun. 16, 2014, 13 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,491, dated May 5, 2015, 15 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,528, dated Dec. 19, 2014, 13 pages. |
Non-Final Office Action from U.S. Appl. No. 13/561,528, dated Jun. 17, 2014 , 11 pages. |
Non-Final Office Action from U.S. Appl. No. 14/173,602, dated Jul. 29, 2016, 19 pages. |
Non-Final Office Action from U.S. Appl. No. 14/173,602, dated Sep. 8, 2015, 32 pages. |
Non-Final Office Action from U.S. Appl. No. 14/922,035, dated Jun. 21, 2016, 13 pages. |
Non-Final Office Action from U.S. Appl. No. 14/922,042, dated Apr. 7, 2016, 16 pages. |
Non-Final Office Action from U.S. Appl. No. 14/922,042, dated Dec. 14, 2016, 20 pages. |
Non-Final Office Action from U.S. Appl. No. 14/922,053, dated Apr. 7, 2016, 15 pages. |
Non-Final Office Action from U.S. Appl. No. 14/922,053, dated Dec. 15, 2016, 16 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,441, dated Apr. 21, 2017, 20 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,441, dated Feb. 2, 2016, 10 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,441, dated Jun. 23, 2015, 14 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,441, dated Mar. 18, 2015, 8 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,441, dated Oct. 21, 2015, 10 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,491, dated Dec. 19, 2016, 13 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,491, dated Jun. 8, 2016, 12 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,491 dated Mar. 31, 2017, 5 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,491, dated Sep. 14, 2016, 18 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,528, dated Aug. 3, 2016, 6 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,528, dated Feb. 8, 2016, 15 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,528, dated Jul. 13, 2015, 14 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,528, dated Mar. 31, 2015, 5 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,528, dated May 2, 2016, 10 pages. |
Notice of Allowance from U.S. Appl. No. 13/561,528, dated Oct. 21, 2015, 9 pages. |
Final Office Action from U.S. Appl. No. 14/922,053, dated May 23, 2017, 43 pages. |
Notice of Allowance from U.S. Appl. No. 14/173,602, dated Nov. 9, 2017, 39 pages. |
Number | Date | Country | |
---|---|---|---|
20170228323 A1 | Aug 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13561491 | Jul 2012 | US |
Child | 15353053 | US |