This invention relates generally to computer systems and, more particularly, relates to improving performance of computer systems.
Computing devices such as personal computers, game consoles, smart phones, and the like often utilize a time-consuming process in order to load and cache pages used by applications into memory. The pages are typically stored on a rotating non-volatile media such as a magnetic hard disk (e.g., a hard drive). However, the device's processor executes instructions only from addressable memory such as DRAM or some other type of volatile electronic memory. The operating systems used in the computing devices cache the pages used by applications in memory so that the applications do not need to load pages from the rotating media as frequently.
The transfer of the pages from the hard drive is slow, particularly when the application is loading a large file. This is also prevalent in restoring the computer system from hibernate mode. A significant factor in the transfer time is due to the disk drive spin up speed. A relatively small disk spinning at a relatively slow RPM requires 5 to 6 seconds to spin up and be usable. Larger disks such as multi-platter devices and those spinning at faster RPMs require 10 to 12 seconds or more to spin up.
This problem gets worse as applications grow in size to incorporate security fixes and become more reliable. These applications often require more memory to operate without having continually transfer data to and from the rotating storage media. However, upgrading the memory of machines is often too costly to undertake for corporations and end users or is beyond the skill level of individual users. Although the cost of memory itself is low, the labor and downtime involved in physically opening each machine and adding RAM may cost several hundred dollars.
Another problem where upgrading the memory of machines is often too costly to undertake is when a system is required to occasionally execute larger and more complex applications than normal. For example, an accounting staff of a company might need to run consolidation applications a few times a month. The larger and more complex applications require more memory to operate efficiently. Although the cost of memory itself is low, the labor and downtime involved in physically opening each machine and adding RAM may cost several hundred dollars. This cost may not justify the additional memory for the few times the application is run.
The invention is directed towards an improved memory management architecture that provides a system, method, and mechanism that utilizes external memory (volatile or non-volatile) devices to cache sectors from the hard disk (i.e., disk sectors) and/or slower memory components to improve system performance. When an external memory device (EMD) is plugged into the computing device or onto a network in which the computing device is connected, the system recognizes the EMD and populates the EMD with disk sectors and/or memory sectors. The system routes I/O read requests directed to the sector to the EMD cache instead of the actual sector. If the EMD is connected to the USB2 local bus, the access time can be twenty times faster that reading from the hard disk. The use of EMDS increases performance and productivity on the computing device systems for a fraction of the cost of adding memory to the computing device. Additionally, consumer devices such as Xbox® can run richer software with the memory of EMDs.
The system detects when an EMD is first used with respect to the computing device. The type of EMD is detected and a driver is installed that is used to cache disk sectors on the EMD. The driver uses the EMD as an asynchronous cache, caching sectors from any disk and/or slower memory device on the system. If no prior knowledge of which sectors are valuable in terms of frequent access, the system may use data on the computing machine to determine which sectors are used to populate the EMD cache. Alternatively, the system populates the EMD cache with a particular sector when that particular sector is accessed during operation. The next time that particular sector is to be accessed for a read operation, the system directs the read operation to access the copy from the EMD.
The system may track usage patterns and determine which disk sectors are most frequently accessed. On subsequent uses of the EMD, the system caches those sectors that are most frequently accessed onto the EMD. If the EMD is present when the computing device is powered up, the EMD can be pre-populated with data during start-up of the operating system.
Additional features and advantages of the invention will be made apparent from the following detailed description of illustrative embodiments which proceeds with reference to the accompanying figures.
While the appended claims set forth the features of the present invention with particularity, the invention, together with its objects and advantages, may be best understood from the following detailed description taken in conjunction with the accompanying drawings of which:
The invention is directed towards an improved memory management architecture that provides a system, method, and mechanism that utilizes external memory (volatile or non-volatile) devices to cache sectors from the hard disk (i.e., disk sectors) or from slower memory devices to improve system performance. For example, many classes of portable computing devices have no hard drives or rotating media storage devices, but still implement hierarchical memory architectures. These portable computing devices would benefit greatly from this invention in that it would allow them to execute larger and more complex enterprise applications within the office place. With the advent of 802.11n, 200-500 Mb wireless connectivity will be available to any wireless device and the use of external memory devices and/or network based memory servers will improve system performance.
The external memory is used to cache data from devices that are generally slower in terms of accessing data such that access times for data used by applications/operating systems can be accessed quicker, thereby improving performance. For older computing devices in which adding actual RAM is too costly, the use of external memory devices will increase performance and productivity on the older devices for a fraction of the cost and enable users to reap the reliability, security, and productivity improvements of newer software applications on existing hardware. For example, consumer devices such as Xbox® benefit by running richer software in terms of improved graphics and performance. Additionally, the amount of memory required for this purpose is likely much less than the amount of memory required to update a system up to a given level.
Turning to the drawings, wherein like reference numerals refer to like elements, the invention is illustrated as being implemented in a suitable computing environment. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a personal computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multi-processor systems, microprocessor based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to: personal computers, server computers, hand-held or laptop devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, game consoles, smart phones, personal data assistants, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in local and/or remote computer storage media including memory storage devices.
With reference to
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, and removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. The term “computer storage media” as used herein refers to an article of manufacture that is not a signal or carrier wave per se. Combinations of the any of the above should also be included within the scope of computer readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation,
The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media, discussed above and illustrated in
The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in
When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
In the description that follows, the invention will be described with reference to acts and symbolic representations of operations that are performed by one or more computers, unless indicated otherwise. As such, it will be understood that such acts and operations, which are at times referred to as being computer-executed, include the manipulation by the processing unit of the computer of electrical signals representing data in a structured form. This manipulation transforms the data or maintains it at locations in the memory system of the computer, which reconfigures or otherwise alters the operation of the computer in a manner well understood by those skilled in the art. The data structures where data is maintained are physical locations of the memory that have particular properties defined by the format of the data. However, while the invention is being described in the foregoing context, it is not meant to be limiting as those of skill in the art will appreciate that various of the acts and operation described hereinafter may also be implemented in hardware.
Turning now to
The present invention leverages the memory available for use in the EMD to maintain in memory the disk sectors that are likely to be used by applications and directs I/O requests that are directed to data that is in disk sectors copied into the EMD memory to be read from the EMD memory instead of the sector on disk.
With reference to
If other EMDs are available for use, the system prioritizes how the EMDS will be populated by caching disk sectors that are more likely to be used on EMDs that have better bandwidth and latency in comparison to other available EMDs (step 304). Some computing devices keep track of disk usage such as which disk sectors are most frequently accessed by the operating system and by applications, last access times, access patterns, access frequency, and the like. If this history is available, the EMD is populated based on the history (step 306). If the history is not available, the EMD is populated with the disk sectors being accessed by the applications (or computing device) during the time the application is reading from disk (step 308). Note that the EMD may be populated in the format required by the EMD. The usage information (i.e., history) of disk sectors is tracked to determine which sectors should be mirrored onto the EMD the next time the EMD is available for use. The algorithms used are similar to the algorithms used to proactively manage page memory as described in U.S. patent application Ser. No. 10/325,591, filed Dec. 20, 2002, entitled “Methods and Mechanisms for Proactive Memory Management,” which is hereby incorporated by reference in its entirety. The difference is that instead of determining which pages in memory are useful to cache, the present invention determines which disk sectors a useful to cache.
In one embodiment wherein the computing device is in a networked system, a network server retains information about the computing device and employs remote algorithms that assist the EMD manager 204 in the management of local memory for the computing device. This embodiment is particularly suitable for low-end clients that don't have the memory or computer power to determine which disk sectors should be cached. The remote algorithms perform a detailed analysis on data patterns, access patterns, etc. on the client and produce more optimum results than the low-end client could produce.
During operation, an application or the computing device may write to a disk sector that is copied to an EMD. The EMD is never written to by the application or computing device. Instead, the write to operation applied to the disk sector. After the write operation is completed, the disk sector is copied back onto the EMD (step 310). This approach is used so that if the EMD is removed, no data is lost such as would be the case in a remote file system when the link to the remote file system is not operable; instead, the computing device reads from disk instead of the EMD. As a result, the invention is more resistant to connectivity issues such as lost connections, removal of EMDs, etc.
Whenever an I/O read request is received, EMD manager 204 checks to see if the request is directed to a disk sector that has been copied to the memory of an EMD 212. If the read request is directed to a disk sector that has been copied to the memory of an EMD, the EMD manager 204 redirects the read request to the EMD (step 312). The result is that the read request is completed faster than if the read request was completed at the hard disk 206.
An EMD 212 can be removed by a user at any time. When an EMD is removed, the system detects the removal. If other EMDs are available, the remaining EMDs are repopulated (step 314) if the EMD that was removed was not the slowest EMD available. If other EMDs are not available (or if the EMD that was removed was the slowest EMD)), data is read from the hard disk (step 316). Steps 300 to 316 are repeated whenever an EMD is added or removed and steps 310 and 312 are repeated for as long as an EMD is available for use.
Note that if the EMD is non-volatile, the EMD memory can be pre-populated with sectors having configuration data during power down or when hibernating. During power-up or restoration, the contents of the EMD can be read while the disk is spinning up. The use of this technique can decrease the boot time and the hibernate awaken time of a computer system. Further details can be found in U.S. patent application Ser. No. 10/186,164, filed Jun. 27, 2002, entitled “Apparatus and Method to Decrease Boot Time and Hibernate Awaken Time of a Computer System,” hereby incorporated by reference in its entirety.
Now that the overall steps have been described, the performance improvements shall be discussed. The key factors that determine the performance improvements that can be expected from external memory devices are the transfer latency and throughput for the EMD and its bus USB½, PCMCIA, Ethernet 100BaseT, etc.), the size of the external memory, the policies used in managing the cache, and the scenarios and workloads of how the external memory is used.
The transfer latency and throughput for the most typical busses EMD may be plugged in varies. It is expected that the bus becomes the primary bottleneck for most operations if the EMD consists of regular RAM packaged as a device that can be plugged into the particular bus. The bus latency and throughput for USB1, USB2 and PCI/PCMCIA is estimated by issuing unbuffered disk I/Os of increasing sizes (4 KB, 8 KB, 16 KB, 32 KB and 64 KB) that should hit the track buffer (which is typically regular memory) of the disk plugged into that bus. The following values of Table 1 were derived by simply fitting a line to the times it took to transfer the I/O sizes.
In order to be meaningful as a disk cache, copying data from the EMD must be faster than going to the disk for it. A 4 KB random disk I/O that involves a seek takes anywhere from 5-15 ms on typical desktop and laptop disks. Assume that it takes 10 ms for a 4 KB disk I/O with seek, data could have been retrieved 60× faster from an EMD cache on PCMCIA, or 20× faster from an EMD on USB2. Overall, USB2 seems to be a very suitable bus for plugging in EMDs.
It should be noted that one issue with USB1 is that the 4 ms setup times would make any performance gains unlikely. This can be worked around by always keeping an isochronous transfer channel open. Obtaining 4 KBs from an EMD on USB 1 would then be typically twice as fast then obtaining it from a disk with a seek. Due to the low throughput rate over USB 1, it would still be faster to go to the disk for 16 KB, 32 KB and 64 KB I/Os that are typically seen on client systems. However, a USB 1 cache used only for the pagefile and file system metadata which is typically accessed with 4 KB random I/Os can still deliver a performance boost.
USB 2 adoption started only after service pack 1 of Windows XP® was released. Most of the 64 MB and 128 MB systems that would benefit most from EMD will not typically have USB 2. However, these systems usually do have a 100BaseT Ethernet network cards. Transfer times of 10 MB/s would be sufficient for significant performance gains from an EMD. An EMD could be attached as a pass through network device per computer, or could even be pushed into the network switches to improve the performance of a small network of computers. Going beyond the switch introduces many reliability and security issues due to shared network bandwidth, but could be done.
As with any cache, the actual policies used in managing which data to keep in the cache is a big factor in determining the resulting performance gains. If an EMD is used as a block cache for underlying disks and other devices, the EMD cache can be populated when reads from the underlying device completes, as well as when writes are issued from applications and file systems. As previously described, the data in the EMD cache will need to be updated asynchronously in order to avoid increasing the time of the original device requests. If a request comes for a range that is being asynchronously updated, it can simply be passed down to the underlying device. If the asynchronous update is outstanding, there must have been a very recent request for the same range that initiated the update, and the data for the range is likely to be cached at the device (e.g. track buffer) or controller.
Typically block caches are managed with an LRU algorithm. In the algorithm, the referenced blocks are put to the end of the LRU list whenever a read request hits or misses the cache. When a block that is not in the cache is read or written to, blocks from the front of the LRU list are repurposed to cache the contents of the new blocks. As a result, LRU algorithms are prone to erosion because valuable blocks in the cache are churned through over time. Algorithms such as those that break the list to multiple prioritized sub-lists and maintain richer use history beyond the last access time will be more resilient.
On Windows NT, caching of file and page data is done by the memory manager via a standby page list. File systems, registry and other system components use the file object/mapping mechanisms cache their data at the same level through the memory and cache manager. If another cache is put at any other level, it results in double caching of the data. This holds true for EMD caches as well. In order to avoid this, the memory manager of the present invention can be extended to push less valuable standby list pages to the slower external memory devices. Whenever those pages are accessed, the memory manager can allocate physical memory pages and copy the data back from the external memory device. The EMD memory manager and an associated cache manager can use page priority hints that U.S. patent application Ser. No. 10/325,591 provides for a proactive and resilient management of the unified cache of pages. Since this will require kernel memory manager changes, any EMD solutions built for Windows XP are likely to suffer from double caching of the data. Simulations show that in spite of the double caching, substantial performance gains are still possible.
Another important parameter for caching is the block size and the amount of clustering and read-ahead. Whenever there is a miss in the cache, even if a smaller amount of data is requested, one needs to read at least a block size of data from the underlying disk or device and possibly even cluster more blocks around the requested offset. Clustering may eliminate future seeks back to the same position on the disk. However, it may also increase the completion time of the original request and even cause more churn in the LRU list as more blocks are referenced for each request. Further, read ahead may be queued to get even more consecutive data from the disk while it is efficient to do so, without impacting the time for the original request. However, this may result in increasing the latency for a subsequent request that needs to seek to somewhere else on the device.
It should be noted that the list of device locations that are deemed valuable by the cache can be persisted across power transitions such as boot or even periods of intense use that purge the regular contents of the cache. This list can be used to repopulate the cache contents after such a transition with proper prioritization support for background I/O.
As with any performance analysis, it is crucial to look at representative scenarios and workloads to getting meaningful and useful data. In order to characterize the performance improvements that can be expected from EMD caches on existing Windows (XP & 2000), experiments with simple LRU write-through block caching at the disk level were performed. As discussed above, this will suffer from double caching of the data. However, these experiments are easier to emulate, simulate and actually build such EMD caches and measure their impact. Results show that even such a simple cache can have a big impact on disk and system performance. Integration with the computing device's memory manager and using a smarter policy would further increase the gains.
Since the experiment basically caches for the disk accesses, the success of the cache can be measured by comparing the overall time for the playback of the same set of disk accesses that are captured from a representative workload or scenario, without the cache and with various configurations of the cache. In most client scenarios, reductions in disk read times result in a proportional increase in responsiveness or benchmark scores.
In order to determine the real world impact of an EMD cache, two scenarios were looked at. One used disk traces captured from real end-user systems over hours on 128 MB and 256 MB systems. Another used disk traces from industry benchmarks such as Business Winstone 2001, Content Creation Winstone 2002, and a modified version of Business Winstone that uses Office 2003 applications. Traces were obtained at multiple memory sizes, so the gains could be compared from a simple EMD cache to actually increasing the system memory size.
EMD devices can be accurately emulated by using a regular block cache and adding a delay to cache hits based on the desired EMD bus. After copying the requested bytes from memory, one can determine the transfer time that is calculated for the desired EMD bus based on the setup time and throughput values such as the ones in Table 1.
The procedure for this evaluation is to: configure the target system to run at the target memory size with/maxmem boot.ini switch; run the typical use scenario or an industry benchmark and trace the generated disk I/Os; configure the block cache with the desired parameters for the cache size and throughput/latency for the EMD device; replay the traced disk I/Os and capture the resulting disk I/Os due to cache issues; and compare the times and disk accesses for the two runs.
Ideally the scenarios should be run with the appropriately configured block cache and the end results (response times or benchmark scores) compared. However, if the link between disk times and the end results is already established, simply playing back the captured disk I/Os consume less time for the numerous EMD configurations that need to be evaluated. A simple simulator was used to roughly estimate the potential gains from an EMD cache. This allowed the processing of hours-tong disk traces from 128 MB customer systems as well as from internal development systems and measure the impact of various configurations of EMD caches. In order to simplify things further, we focused on the time it took the disk to process the reads and ignored the disk write times. Representative seek times were determined by ignoring seek times smaller than 2 ms and larger than 20 ms. The last couple positions of the disk head were tracked to simulate “track buffering.” In spite of the complications above, the disk simulation is typically within an acceptable range: 75% of the predictions are within 15% of the actual times. Any misprediction is typically due to the conservative simulation and prediction of higher disk read times. Even though the disk simulator may not always accurately capture the performance characteristics of a disk in a specific trace, its own performance characteristics are representative and typical of an actual desktop/laptop disk.
Table 2 shows the reduction in disk read times in EMD cache simulation of disk traces that were acquired during actual use of various computing systems over hours of operation.
As an example of how to interpret data from Table 2, consider system 1: a 128 MB USB2 EMD device will result in 37% of the disk read time that the current user is experiencing (i.e., a 63% reduction).
Systems 1 and 2 are from a corporation that wanted to upgrade to Windows XP, Office 2003 and latest SMS on their 128 MB systems, but hit significant slowdowns when running their line of business software. The system 3 trace is from a laptop. It can be seen that the largest improvements in these systems are systems with slower disks and only 128 MB of memory.
The bottom three systems (systems 4, 5, and 6) are developer systems on which heavy weight development tasks including building, syncing & processing of large files were performed. These systems have faster disks and the most disk I/Os generated by these tasks are sequential and do not benefit from a LRU block cache as much because they do not re-access the same sectors on the disk many times (e.g. syncing). Thus the overall disk time is not as representative of the end user responsiveness. The cache may have reduced the time for UI blocking disk reads significantly.
Table 3 shows the reduction in disk read times in EMD cache simulation of disk traces that were acquired during Content Creation Winstone 2002.
Table 4 shows the reduction in disk read times in EMD cache simulation of disk traces that were acquired during Business Winstone 2001.
As in previous cases, the improvements seen on systems with 128 MB and slower disks are the largest. Business Winstone 2001 starts to mostly fit in memory in 256 MBs, so the overall disk times and the gains from EMD are smaller in this system memory size.
Table 5 compares the gains from adding EMD cache to a system to actually adding more physical memory when running Content Creation Winstone 2002. As previously noted, the EMD cache simulation suffers from double caching of the data and is managed with a simple LRU policy. Typically adding more physical memory to the system will deliver better performance in a bigger number of scenarios. On the other hand, if the EMD cache can be integrated with the memory manager and managed with the same advanced algorithms that U.S. patent application Ser. No. 10/325,591 can provide, it can deliver performance gains comparable to adding actual memory to the system.
From the foregoing, it can be seen that a system and method to improve performance of a computing device using external memory has been described. The invention allows legacy computing devices and other devices with low amounts of memory to effectively upgrade the memory without having to physically open the device. Productivity gains terms of faster and more reliable performance can be achieved using the external memory. Sectors from rotating storage media and slower memory devices are asynchronously cached in the external memory. Unlike remote file systems, data is not lost if the external memory is removed as the data is still on the rotating storage media or slower memory devices.
All of the references cited herein, including patents, patent applications, and publications, are hereby incorporated in their entireties by reference. The use of the terms “a” and “an” and “the” and similar referents in the context of describing the invention especially in the context of the following claims to be construed to cover both the singular and the plural, unless otherwise indicated herein or clearly contradicted by context. The terms “comprising,” “having,” “including,” and “containing” are to be construed as open-ended terms (i.e., meaning “including, but not limited to,”) unless otherwise noted. All methods described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The use of any and all examples, or exemplary language (e.g., “such as”) provided herein, is intended merely to better illuminate the invention and does not pose a limitation on the scope of the invention unless otherwise claimed. For example, the Windows® operating system was referenced to describe the invention. Those skilled in the art will recognize that the invention may be implemented on other operating systems such as Linux, SunOs, and the like. No language in the specification should be construed as indicating any non-claimed element as essential to the practice of the invention.
In view of the many possible embodiments to which the principles of this invention may be applied, it should be recognized that the embodiment described herein with respect to the drawing figures is meant to be illustrative only and should not be taken as limiting the scope of invention. For example, those of skill in the art will recognize that the elements of the illustrated embodiment shown in software may be implemented in hardware and vice versa or that the illustrated embodiment can be modified in arrangement and detail without departing from the spirit of the invention. Therefore, the invention as described herein contemplates all such embodiments as may come within the scope of the following claims and equivalents thereof.
This Application is a Continuation of and claims benefit from U.S. patent application Ser. No. 14/530,661 that was filed on Oct. 31, 2014, and that is a Continuation of U.S. patent application Ser. No. 13/187,757 (U.S. Pat. No. 8,909,861), that was filed on Jul. 21, 2011, (issued Dec. 9, 2014), and that is a Continuation of U.S. patent application Ser. No. 12/775,168 (U.S. Pat. No. 8,006,037) that was filed on May 6, 2010, (issued on Aug. 23, 2011), and that is a Continuation of U.S. patent application Ser. No. 12/366,112 (U.S. Pat. No. 7,805,571) that was filed on Feb. 5, 2009, (issued on Sep. 9, 2010), and that is a Continuation of U.S. patent application Ser. No. 10/970,772 (U.S. Pat. No. 7,490,197) that was filed on Oct. 21, 2004, (issued on Feb. 10, 2009), each of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4476526 | Dodd | Oct 1984 | A |
4612612 | Woffinden | Sep 1986 | A |
4671111 | Lemelson | Jun 1987 | A |
4945474 | Elliot et al. | Jul 1990 | A |
4972316 | Dixon et al. | Nov 1990 | A |
4979108 | Crabbe, Jr. | Dec 1990 | A |
5088026 | Bozman | Feb 1992 | A |
5175634 | Matsuzaki | Dec 1992 | A |
5175834 | Sawai | Dec 1992 | A |
5263136 | DeAguiar | Nov 1993 | A |
5297258 | Hale | Mar 1994 | A |
5307497 | Feigenbaum et al. | Apr 1994 | A |
5394531 | Smith | Feb 1995 | A |
5398325 | Chang | Mar 1995 | A |
5420998 | Horning | May 1995 | A |
5454098 | Pisello | Sep 1995 | A |
5463739 | Albaugh et al. | Oct 1995 | A |
5524230 | Sakaue et al. | Jun 1996 | A |
5551002 | Rosich | Aug 1996 | A |
5557770 | Bhide | Sep 1996 | A |
5561783 | Vanka | Oct 1996 | A |
5572660 | Jones | Nov 1996 | A |
5574877 | Dixit | Nov 1996 | A |
5586290 | Hirai et al. | Dec 1996 | A |
5603001 | Sukegawa | Feb 1997 | A |
5611067 | Okamoto | Mar 1997 | A |
5636355 | Ramakrishnan | Jun 1997 | A |
5652857 | Shimoi et al. | Jul 1997 | A |
5666532 | Saks | Sep 1997 | A |
5668968 | Wu | Sep 1997 | A |
5717954 | Grieff | Feb 1998 | A |
5720029 | Kern et al. | Feb 1998 | A |
5740434 | Eastep | Apr 1998 | A |
5751932 | Horst et al. | May 1998 | A |
5751990 | Krolak | May 1998 | A |
5754782 | Masada | May 1998 | A |
5754888 | Yang | May 1998 | A |
5758056 | Barr | May 1998 | A |
5758174 | Crump | May 1998 | A |
5764877 | Lomet et al. | Jun 1998 | A |
5806074 | Souder et al. | Sep 1998 | A |
5809280 | Chard | Sep 1998 | A |
5809543 | Byers | Sep 1998 | A |
5832515 | Ledain | Nov 1998 | A |
5845293 | Veghte | Dec 1998 | A |
5860083 | Sukegawa | Jan 1999 | A |
5875466 | Wakerly | Feb 1999 | A |
5897638 | Lasser et al. | Apr 1999 | A |
5897660 | Reinders | Apr 1999 | A |
5900022 | Kranich | May 1999 | A |
5900870 | Malone et al. | May 1999 | A |
5923838 | Hongo | Jul 1999 | A |
5937433 | Lee | Aug 1999 | A |
5943687 | Liedberg | Aug 1999 | A |
5943692 | Marberg et al. | Aug 1999 | A |
5991847 | Ballard | Nov 1999 | A |
5996054 | Ledain | Nov 1999 | A |
6000006 | Bruce | Dec 1999 | A |
6018433 | Thayne et al. | Jan 2000 | A |
6018746 | Hill et al. | Jan 2000 | A |
6021408 | Ledain | Feb 2000 | A |
6026027 | Terrell | Feb 2000 | A |
6047291 | Anderson et al. | Apr 2000 | A |
6073232 | Kroeker et al. | Jun 2000 | A |
6092160 | Marsters | Jul 2000 | A |
6098075 | Becraft, Jr. et al. | Aug 2000 | A |
6101601 | Matthews et al. | Aug 2000 | A |
6108004 | Medl | Aug 2000 | A |
6112024 | Almond et al. | Aug 2000 | A |
6122685 | Bachmat | Sep 2000 | A |
6128627 | Mattis | Oct 2000 | A |
6138125 | DeMoss | Oct 2000 | A |
6148368 | DeKoning | Nov 2000 | A |
6185629 | Simpson | Feb 2001 | B1 |
6189071 | Bachmat | Feb 2001 | B1 |
6199195 | Goodwin et al. | Mar 2001 | B1 |
6209088 | Reneris | Mar 2001 | B1 |
6230233 | Lofgren | May 2001 | B1 |
6237065 | Banerjia | May 2001 | B1 |
6240414 | Beizer et al. | May 2001 | B1 |
6247026 | Waldo et al. | Jun 2001 | B1 |
6249841 | Sikes | Jun 2001 | B1 |
6272534 | Guha | Aug 2001 | B1 |
6275436 | Tobita | Aug 2001 | B1 |
6298428 | Munroe | Oct 2001 | B1 |
6301635 | Bothwell | Oct 2001 | B2 |
6311232 | Cagle et al. | Oct 2001 | B1 |
6314433 | Mills et al. | Nov 2001 | B1 |
6317806 | Audityan | Nov 2001 | B1 |
6321234 | Debrunner | Nov 2001 | B1 |
6338056 | Dessloch et al. | Jan 2002 | B1 |
6338126 | Ohran et al. | Jan 2002 | B1 |
6345000 | Wong | Feb 2002 | B1 |
6360330 | Mutalik et al. | Mar 2002 | B1 |
6366996 | Hobson | Apr 2002 | B1 |
6370534 | Odom et al. | Apr 2002 | B1 |
6370541 | Chou et al. | Apr 2002 | B1 |
6378043 | Girkar | Apr 2002 | B1 |
6401093 | Anand et al. | Jun 2002 | B1 |
6408058 | Lanet | Jun 2002 | B1 |
6418510 | Lamberts | Jul 2002 | B1 |
6425057 | Cherkasova | Jul 2002 | B1 |
6434682 | Ashton et al. | Aug 2002 | B1 |
6438750 | Anderson | Aug 2002 | B1 |
6454159 | Takushima | Sep 2002 | B1 |
6477564 | Freyssinet et al. | Nov 2002 | B1 |
6505205 | Kothuri et al. | Jan 2003 | B1 |
6513051 | Bolosky | Jan 2003 | B1 |
6516380 | Kenchammana-Hoskote | Feb 2003 | B2 |
6519597 | Cheng et al. | Feb 2003 | B1 |
6535949 | Parker | Mar 2003 | B1 |
6539456 | Stewart | Mar 2003 | B2 |
6542904 | Crus et al. | Apr 2003 | B2 |
6546472 | Atkinson | Apr 2003 | B2 |
6556983 | Altschuler et al. | Apr 2003 | B1 |
6557077 | Ghosh | Apr 2003 | B1 |
6560702 | Gharda et al. | May 2003 | B1 |
6567889 | Dekoning et al. | May 2003 | B1 |
6578046 | Chang et al. | Jun 2003 | B2 |
6609182 | Pedrizetti | Aug 2003 | B1 |
6611919 | Matsuya | Aug 2003 | B1 |
6615313 | Kato et al. | Sep 2003 | B2 |
6625742 | Owhadi | Sep 2003 | B1 |
6629201 | Dempsey | Sep 2003 | B2 |
6636942 | Greco | Oct 2003 | B2 |
6640278 | Nolan et al. | Oct 2003 | B1 |
6647472 | Atkinson et al. | Nov 2003 | B2 |
6651141 | Adrangi | Nov 2003 | B2 |
6671699 | Black et al. | Dec 2003 | B1 |
6671757 | Multer et al. | Dec 2003 | B1 |
6684229 | Luong et al. | Jan 2004 | B1 |
6687158 | Yano | Feb 2004 | B2 |
6694336 | Multer et al. | Feb 2004 | B1 |
6714935 | Delo | Mar 2004 | B1 |
6718361 | Basani et al. | Apr 2004 | B1 |
6721863 | Endo | Apr 2004 | B1 |
6738789 | Multer et al. | May 2004 | B2 |
6742097 | Woo | May 2004 | B2 |
6751658 | Haun et al. | Jun 2004 | B1 |
6757696 | Multer et al. | Jun 2004 | B2 |
6760736 | Waldo et al. | Jul 2004 | B2 |
6769050 | Ware | Jul 2004 | B1 |
6771536 | Li | Aug 2004 | B2 |
6772178 | Mandal et al. | Aug 2004 | B2 |
6782453 | Keltcher | Aug 2004 | B2 |
6788612 | Hsu | Sep 2004 | B2 |
6871271 | Ohran et al. | Mar 2005 | B2 |
6877081 | Herger | Apr 2005 | B2 |
6879266 | Dye | Apr 2005 | B1 |
6901499 | Aasheim | May 2005 | B2 |
6910106 | Sechrest | Jun 2005 | B2 |
6918022 | Li | Jul 2005 | B2 |
6920533 | Coulson | Jul 2005 | B2 |
6928521 | Burton | Aug 2005 | B1 |
6930919 | Lee | Aug 2005 | B2 |
6938116 | Kim | Aug 2005 | B2 |
6941423 | Coulson | Sep 2005 | B2 |
6959318 | Tso | Oct 2005 | B1 |
6968450 | Rothberg | Nov 2005 | B1 |
6996660 | Moore | Feb 2006 | B1 |
7007072 | Guha | Feb 2006 | B1 |
7010645 | Hetzler | Mar 2006 | B2 |
7017037 | Fortin et al. | Mar 2006 | B2 |
7036040 | Nicholson et al. | Apr 2006 | B2 |
7039765 | Wilkes | May 2006 | B1 |
7043610 | Horn | May 2006 | B2 |
7057942 | Suda | Jun 2006 | B2 |
7062675 | Kemeny | Jun 2006 | B1 |
7065627 | Dayan et al. | Jun 2006 | B2 |
7068575 | Gabryjelski | Jun 2006 | B2 |
7082495 | DeWhitt | Jul 2006 | B2 |
7082499 | Kamitani | Jul 2006 | B2 |
7143120 | Oks et al. | Nov 2006 | B2 |
7171532 | Kodama | Jan 2007 | B2 |
7185155 | Sechrest | Feb 2007 | B2 |
7231497 | Trika | Jun 2007 | B2 |
7284149 | Fisher | Oct 2007 | B1 |
7366740 | Sleeman et al. | Apr 2008 | B2 |
7366866 | Cochran | Apr 2008 | B2 |
7380090 | Koseki | May 2008 | B2 |
7409537 | Tsang | Aug 2008 | B2 |
7412369 | Gupta | Aug 2008 | B1 |
7412562 | Gamey | Aug 2008 | B2 |
7451353 | Grimsrud | Nov 2008 | B2 |
7472230 | Prabhu | Dec 2008 | B2 |
7490197 | Kirshenbaum | Feb 2009 | B2 |
7590795 | Sinclair | Sep 2009 | B2 |
7620983 | Satish | Nov 2009 | B1 |
7631140 | Saito | Dec 2009 | B2 |
7644239 | Ergan et al. | Jan 2010 | B2 |
7698506 | Fair | Apr 2010 | B1 |
7698513 | Sechrest | Apr 2010 | B2 |
7774508 | Nakamura | Aug 2010 | B2 |
7805571 | Kirshenbaum | Sep 2010 | B2 |
7814261 | Lee | Oct 2010 | B2 |
7818701 | Kolokowsky | Oct 2010 | B1 |
7849502 | Bloch | Dec 2010 | B1 |
7873782 | Terry | Jan 2011 | B2 |
7945734 | Lahcanski | May 2011 | B2 |
7953774 | Cong | May 2011 | B2 |
8006037 | Kirshenbaum | Aug 2011 | B2 |
RE42727 | Kang | Sep 2011 | E |
8032707 | Iyigun | Oct 2011 | B2 |
8032723 | Sechrest | Oct 2011 | B2 |
8041904 | Ergan | Oct 2011 | B2 |
8074014 | Narayanan | Dec 2011 | B2 |
8108450 | Cong | Jan 2012 | B2 |
8135914 | Iyigun | Mar 2012 | B2 |
8255645 | Ergan et al. | Aug 2012 | B2 |
8352464 | Fotev | Jan 2013 | B2 |
8539186 | Sechrest | Sep 2013 | B2 |
8631203 | Fortin | Jan 2014 | B2 |
8756375 | Flynn | Jun 2014 | B2 |
8909861 | Kirshenbaum | Dec 2014 | B2 |
20010007123 | Seguchi | Jul 2001 | A1 |
20010007999 | Rasmussen | Jul 2001 | A1 |
20010028603 | Shimazu | Oct 2001 | A1 |
20010047462 | Dimitroff et al. | Nov 2001 | A1 |
20020004876 | Timmer et al. | Jan 2002 | A1 |
20020073276 | Howard | Jun 2002 | A1 |
20020083275 | Kawamoto | Jun 2002 | A1 |
20020087797 | Adrangi | Jul 2002 | A1 |
20020087816 | Atkinson | Jul 2002 | A1 |
20020091702 | Mullins | Jul 2002 | A1 |
20020108017 | Kenchammana••Hoskote | Aug 2002 | A1 |
20020143521 | Call | Oct 2002 | A1 |
20020152422 | Sharma et al. | Oct 2002 | A1 |
20020156970 | Stewart | Oct 2002 | A1 |
20020171966 | Ottesen et al. | Nov 2002 | A1 |
20020178326 | Ohta | Nov 2002 | A1 |
20020184311 | Traversat | Dec 2002 | A1 |
20020198891 | Li et al. | Dec 2002 | A1 |
20020199075 | Jacobs | Dec 2002 | A1 |
20030009538 | Shah | Jan 2003 | A1 |
20030041213 | Tokar | Feb 2003 | A1 |
20030070065 | Fleming | Apr 2003 | A1 |
20030074524 | Coulson | Apr 2003 | A1 |
20030074550 | Wilks et al. | Apr 2003 | A1 |
20030101320 | Chauvel et al. | May 2003 | A1 |
20030110357 | Nguyen | Jun 2003 | A1 |
20030154314 | Mason et al. | Aug 2003 | A1 |
20030154337 | Ohno et al. | Aug 2003 | A1 |
20030158839 | Faybishenko et al. | Aug 2003 | A1 |
20030177305 | Hetrick | Sep 2003 | A1 |
20030191916 | McBrearty et al. | Oct 2003 | A1 |
20030202377 | Harari | Oct 2003 | A1 |
20030212660 | Kerwin | Nov 2003 | A1 |
20030212857 | Pacheco et al. | Nov 2003 | A1 |
20030217299 | Neuman | Nov 2003 | A1 |
20040003003 | McCartney et al. | Jan 2004 | A1 |
20040003223 | Fortin et al. | Jan 2004 | A1 |
20040010639 | Inoue | Jan 2004 | A1 |
20040015504 | Ahad et al. | Jan 2004 | A1 |
20040019762 | Fukuoka | Jan 2004 | A1 |
20040024795 | Hind et al. | Feb 2004 | A1 |
20040034765 | O'Connell | Feb 2004 | A1 |
20040044776 | Larkin | Mar 2004 | A1 |
20040044849 | Stence | Mar 2004 | A1 |
20040059747 | Olarig et al. | Mar 2004 | A1 |
20040068627 | Sechrest | Apr 2004 | A1 |
20040078508 | Rivard | Apr 2004 | A1 |
20040093463 | Shang | May 2004 | A1 |
20040103238 | Avraham | May 2004 | A1 |
20040107200 | Sjogren et al. | Jun 2004 | A1 |
20040136259 | Kiint | Jul 2004 | A1 |
20040148611 | Manion | Jul 2004 | A1 |
20040153694 | Nicholson | Aug 2004 | A1 |
20040162950 | Coulson | Aug 2004 | A1 |
20040168018 | Aasheim | Aug 2004 | A1 |
20040172576 | Yoshii | Sep 2004 | A1 |
20040174631 | Tanaka et al. | Sep 2004 | A1 |
20040221030 | Huras | Nov 2004 | A1 |
20040221089 | Sato | Nov 2004 | A1 |
20040230743 | Ware et al. | Nov 2004 | A1 |
20040243612 | Bailey | Dec 2004 | A1 |
20050005188 | Hsu | Jan 2005 | A1 |
20050021907 | Shimada | Jan 2005 | A1 |
20050111260 | Nazarian | May 2005 | A1 |
20050125708 | Simon | Jun 2005 | A1 |
20050138283 | Gamey | Jun 2005 | A1 |
20050141284 | Futatsuyarna | Jun 2005 | A1 |
20050145923 | Chen | Jul 2005 | A1 |
20050149750 | Lisanke et al. | Jul 2005 | A1 |
20050160223 | Chen | Jul 2005 | A1 |
20050160233 | Van Doren et al. | Jul 2005 | A1 |
20050172067 | Sinclair | Aug 2005 | A1 |
20050193160 | Bhatt | Sep 2005 | A1 |
20050204091 | Kilbuck | Sep 2005 | A1 |
20050228964 | Sechrest | Oct 2005 | A1 |
20050235119 | Sechrest | Oct 2005 | A1 |
20050239494 | Klassen et al. | Oct 2005 | A1 |
20050246487 | Ergan | Nov 2005 | A1 |
20050251617 | Sinclair | Nov 2005 | A1 |
20050262378 | Sleeman et al. | Nov 2005 | A1 |
20050268038 | Yasue | Dec 2005 | A1 |
20050278481 | Lakhani | Dec 2005 | A1 |
20050286855 | Saitou | Dec 2005 | A1 |
20060010293 | Schnapp | Jan 2006 | A1 |
20060074953 | Dettinger | Apr 2006 | A1 |
20060075185 | Azzarito | Apr 2006 | A1 |
20060080553 | Hall | Apr 2006 | A1 |
20060087893 | Nishihara | Apr 2006 | A1 |
20060090031 | Kirshenbaum | Apr 2006 | A1 |
20060106889 | Mannby | May 2006 | A1 |
20060112195 | Aoyama | May 2006 | A1 |
20060112215 | Kim | May 2006 | A1 |
20060136472 | Jujjuri | Jun 2006 | A1 |
20060136664 | Trika | Jun 2006 | A1 |
20060143241 | Bradshaw | Jun 2006 | A1 |
20060155931 | Birrell | Jul 2006 | A1 |
20060177067 | Kim | Aug 2006 | A1 |
20060236034 | Pomaranski | Oct 2006 | A1 |
20060248276 | Kilian | Nov 2006 | A1 |
20060248387 | Nicholson | Nov 2006 | A1 |
20060277359 | Faber | Dec 2006 | A1 |
20070005882 | Gallagher | Jan 2007 | A1 |
20070011405 | Adusumilli | Jan 2007 | A1 |
20070033356 | Erlikhman | Feb 2007 | A1 |
20070043787 | Cannon | Feb 2007 | A1 |
20070043929 | Safford | Feb 2007 | A1 |
20070061511 | Faber | Mar 2007 | A1 |
20070061577 | Van De Kerkhof | Mar 2007 | A1 |
20070073764 | Oks et al. | Mar 2007 | A1 |
20070150966 | Kirschner | Jun 2007 | A1 |
20070156954 | Trika | Jul 2007 | A1 |
20070162700 | Fortin | Jul 2007 | A1 |
20070207800 | Daley | Sep 2007 | A1 |
20070208910 | Koseki | Sep 2007 | A1 |
20070233939 | Kim | Oct 2007 | A1 |
20070266199 | Peled | Nov 2007 | A1 |
20070294474 | Panabaker | Dec 2007 | A1 |
20070294504 | Peled | Dec 2007 | A1 |
20080010401 | Royer, Jr. | Jan 2008 | A1 |
20080010415 | Sawdey | Jan 2008 | A1 |
20080109625 | Erlingsson | May 2008 | A1 |
20080162485 | Long | Jul 2008 | A1 |
20080172519 | Shmulevich | Jul 2008 | A1 |
20080183958 | Cheriton | Jul 2008 | A1 |
20090112949 | Ergan | Apr 2009 | A1 |
20090144495 | Kirshenbaum | Jun 2009 | A1 |
20090150335 | Latorre | Jun 2009 | A1 |
20090150599 | Bennett | Jun 2009 | A1 |
20090150611 | Fortin | Jun 2009 | A1 |
20090287890 | Bolosky | Nov 2009 | A1 |
20100037001 | Langlois | Feb 2010 | A1 |
20100070101 | Benes | Mar 2010 | A1 |
20100070701 | Iyigun | Mar 2010 | A1 |
20100070747 | Iyigun | Mar 2010 | A1 |
20100082550 | Cong | Apr 2010 | A1 |
20100199043 | Sechrest | Aug 2010 | A1 |
20100199063 | Sechrest | Aug 2010 | A1 |
20100217929 | Kirshenbaum | Aug 2010 | A1 |
20100280999 | Atluri | Nov 2010 | A1 |
20110197016 | Cong | Aug 2011 | A1 |
20110276743 | Kirshenbaum | Nov 2011 | A1 |
20110314202 | Iyigun | Dec 2011 | A1 |
20120047323 | Sareen et al. | Feb 2012 | A1 |
20120102265 | Cong | Apr 2012 | A1 |
20120173824 | Iyigun | Jul 2012 | A1 |
20120290785 | Ergan | Nov 2012 | A1 |
20140047189 | Fortin | Feb 2014 | A1 |
Number | Date | Country |
---|---|---|
1266229 | Sep 2000 | CN |
1421003 | May 2003 | CN |
1465009 | Dec 2003 | CN |
101236530 | Aug 2008 | CN |
0547992 | Jun 1993 | EP |
0712067 | May 1996 | EP |
0744697 | Nov 1996 | EP |
1960888 | Jan 2013 | EP |
57-161933 | Oct 1982 | JP |
60-140446 | Jul 1985 | JP |
60-140466 | Jul 1985 | JP |
01-303547 | Dec 1989 | JP |
02-039256 | Feb 1990 | JP |
03-147157 | Jun 1991 | JP |
03294942 | Dec 1991 | JP |
04-205634 | Jul 1992 | JP |
4246746 | Sep 1992 | JP |
05-059537 | Mar 1993 | JP |
05-064931 | Mar 1993 | JP |
57-161933 | Mar 1993 | JP |
562329 | Mar 1993 | JP |
594353 | Apr 1993 | JP |
05-158797 | Jun 1993 | JP |
05-233392 | Sep 1993 | JP |
5225066 | Sep 1993 | JP |
05-282889 | Oct 1993 | JP |
06-035802 | Feb 1994 | JP |
683708 | Mar 1994 | JP |
06231043 | Aug 1994 | JP |
6236351 | Aug 1994 | JP |
06-324817 | Nov 1994 | JP |
7253935 | Oct 1995 | JP |
10091488 | Sep 1996 | JP |
8263380 | Oct 1996 | JP |
09106366 | Apr 1997 | JP |
09-146710 | Jun 1997 | JP |
09-190382 | Jul 1997 | JP |
09-214028 | Aug 1997 | JP |
10-040170 | Feb 1998 | JP |
10-154101 | Jun 1998 | JP |
10-289155 | Oct 1998 | JP |
11-259361 | Sep 1999 | JP |
11-316699 | Nov 1999 | JP |
11-338641 | Dec 1999 | JP |
2000-148515 | May 2000 | JP |
2000-194645 | Jul 2000 | JP |
2000-235544 | Aug 2000 | JP |
2001-27967 | Mar 2001 | JP |
2001-243021 | Sep 2001 | JP |
2001-250315 | Sep 2001 | JP |
2002-007185 | Jan 2002 | JP |
2002-259186 | Sep 2002 | JP |
2002-323959 | Nov 2002 | JP |
2002-342037 | Nov 2002 | JP |
2003-076498 | Mar 2003 | JP |
2003-085041 | Mar 2003 | JP |
2003-196032 | Jul 2003 | JP |
2003280950 | Oct 2003 | JP |
2003-316647 | Nov 2003 | JP |
2004-021370 | Jan 2004 | JP |
2004-054845 | Feb 2004 | JP |
2004-192403 | Jul 2004 | JP |
2004-272324 | Sep 2004 | JP |
2004-272764 | Sep 2004 | JP |
2005-044010 | Feb 2005 | JP |
2005-222383 | Aug 2005 | JP |
2005-339256 | Dec 2005 | JP |
2007-007185 | Jan 2007 | JP |
2007-233896 | Sep 2007 | JP |
2008-052321 | Mar 2008 | JP |
1019990019377 | Mar 1999 | KR |
1020000039727 | Jul 2000 | KR |
2010317 | Mar 1994 | RU |
2 096 824 | Nov 1997 | RU |
2 189 073 | Sep 2002 | RU |
190585 | Sep 1992 | TW |
479194 | Mar 2002 | TW |
502165 | Sep 2002 | TW |
200402628 | Feb 2004 | TW |
200405170 | Apr 2004 | TW |
I347515 | Aug 2011 | TW |
9318461 | Sep 1993 | WO |
9726600 | Jul 1997 | WO |
9810611 | Mar 1998 | WO |
9953439 | Oct 1999 | WO |
0049488 | Aug 2000 | WO |
0111486 | Feb 2001 | WO |
0157675 | Aug 2001 | WO |
0175581 | Oct 2001 | WO |
0201364 | Jan 2002 | WO |
0201365 | Jan 2002 | WO |
0201364 | Jan 2002 | WO |
Entry |
---|
U.S. Appl. No. 10/970,772, filed Oct. 21, 2004, Kirshenbaum. |
U.S. Appl. No. 12/366,112, filed Feb. 5, 2009, Kirshenbaum. |
U.S. Appl. No. 12/775,168, filed May 6, 2010, Kirshenbaum. |
U.S. Appl. No. 13/187,757, filed Jul. 21, 2011 Kirshenbaum. |
U.S. Appl. No. 14/530,661, filed Oct. 31, 2014, Kirshenbaum. |
U.S. Appl. No. 60/416,115, filed Oct. 4, 2002, Sechrest. |
U.S. Appl. No. 10/325,591, filed Dec. 20, 2002, Sechrest. |
U.S. Appl. No. 11/150,686, filed Jun. 9, 2005, Sechrest. |
U.S. Appl. No. 11/150,728, filed Jun. 9, 2005, Sechrest. |
U.S. Appl. No. 12/759,526, filed Apr. 13, 2010, Sechrest. |
U.S. Appl. No. 12/759,536, filed Apr. 13, 2010, Sechrest. |
U.S. Appl. No. 10/837,986, filed May 3, 2004, Ergan. |
U.S. Appl. No. 12/627,710, filed Nov. 30, 2009, Ergan. |
U.S. Appl. No. 13/231,088, filed Sep. 13, 2011, Ergan. |
U.S. Appl. No. 13/555,803, filed Jul. 23, 2012, Ergan. |
U.S. Appl. No. 11/303,382, filed Dec. 16, 2005, Fortin. |
U.S. Appl. No. 14/058,078, filed Oct. 18, 2013, Fortin. |
U.S. Appl. No. 11/953,312, filed Dec. 10, 2007, Fortin. |
U.S. Appl. No. 14/076,576, filed Nov. 11, 2013, Fortin. |
U.S. Appl. No. 12/234,411, filed Sep. 19, 2008, Cong. |
U.S. Appl. No. 13/087,927, filed Apr. 15, 2011, Cong. |
U.S. Appl. No. 13/343,985, filed Jan. 5, 2012, Cong. |
U.S. Appl. No. 14/259,065, filed Apr. 22, 2014, Cong. |
U.S. Appl. No. 61/097,079, filed Sep. 15, 2008, Iyigun. |
U.S. Appl. No. 12/271,472, filed Nov. 14, 2008, Iyigun. |
U.S. Appl. No. 14/708,525, filed May 11, 2015, Iyigun. |
U.S. Appl. No. 12/271,400, filed Nov. 14, 2008, Iyigun. |
U.S. Appl. No. 13/221,542, filed Aug. 30, 2011, Iyigun. |
U.S. Appl. No. 13/365,093, filed Feb. 2, 2012, Iyigun. |
IN First Examination Report for Application No. 2682/DEL/2005, Oct. 20, 2014. |
EP Communication for Application No. 05103690.3-2201, Reference EP34981TE900kap, Apr. 24, 2008. |
TW Search Report for Application No. 101110178, Aug. 28, 2014. |
JP Examiner's Decision of Refusal for Application No. 2012-243915, Jan. 6, 2015. |
JP Decision of Refusal for Application No. 2012-111004, Jul. 29, 2014. |
AU Examiner's first report on patent application No. 2005219500, Reference 12671530/DBW, May 31, 2010. |
EP Communication for Application No. 05109295.5-2201, Reference EP36830RK900dfi, Jan. 28, 2008. |
Watanabe, “Knowledge Integration for Architectural Design”, Knowledge-Based Computer-Aided Architectural Design, Jul. 1994,123-146. |
Waugh, “Specifying Metadata Standards for Metadata Tool Configuration”, Computer Networks and ISDN Systems, Apr. 1998, 30(1-7), 23-32. |
Wilcox, “Object Databases-Object Methods in Distributed Computing”, Dr. Dobbs Journal, Nov. 1994,19(13), 26-34. |
Wold et al., “Content-Based Classification, Search, and Retrieval of Audio”, IEEE Multimedia, Fall 1996, 3(3), 27-36. |
Yoshikawa et al., “XRel; a Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases”, ACM Transactional on Internet technology, Aug. 2001,1(1),1-29. |
Haining, “Non-Volatile Cache Management for Improving Write Response Time with Rotating Magnetic Media”, Sep. 2000. |
JP Notice of Reason for Rejection for Application No. 2011-526951, Jul. 11, 2014. |
CN Decision on Rejection for Application No. 200980145878.1, Apr. 4, 2014. |
JP Final Notification of Reason(s) for Refusal for Application No. 2012-243915, Mar. 25, 2014. |
CA Office Action for Application No. 2,523,761, Feb. 26, 2014. |
JP Notification of Reason(s) for Refusal for Application No. 2012-111004, Nov. 19, 2013. |
KR Final Notice of Preliminary Rejection for Application No. 10-2008-7014092, Nov. 28, 2013. |
JP Notice of Reasons for Rejection for Application No. 2011-526951, Dec. 16, 2013. |
EP Communication for Application No. 09813565.0-1229 / 2329360 PCT/US2009056419, Reference FB24240, Apr. 3, 2012. |
EP Communication for Application No. 09826570.5-1229 / 2353081 PCT/US2009063127, Reference FB24586 , May 29, 2012. |
Budiu, “A Dual-Disk File System: ext4”, Apr. 16, 1997. |
CN Notice on the First Office Action for Application No. 200980137190.9, Oct. 24, 2012. |
Dove, “Windows XP for embedded applications”, Jul. 10, 2008. |
EP Communication for Application No. 09814983.4-2224 / 2329361 PCT/US2009055198, Reference FB24231, Oct. 10, 2012. |
iSCSI, “Performance evaluations of iSCSI implementation”, printed Jan. 10, 2008. |
JP Notice of Rejection for Application No. 2011-527865, Oct. 16, 2012. |
Matthews, “Improving File System Performance With Adaptive Methods”, Fall 1999. |
Mitchell, “Managing Cache Coherence in Multiprocessor Computer Systems”, printed Jul. 10, 2008. |
Nieplocha, “ARMCI: A Portable Aggregate Remote Memory Copy Interface”, Oct. 30, 2000. |
Novell NetWare® 6, “Novell Storage Services Administration Guide”, Feb. 2002. |
PCT Internatonal Search Repor and Writen Opinion for Applicaton No. PCT/US2009/055198, reference 324268-02WO, Feb. 26, 2010. |
CN Notice on the First Office Action for Application No. 200980136912.9, Jan. 14, 2013. |
Ohn, “Path conscious caching of B+ tree indexes in a shared disks cluster”, ScienceDirect, Available online Dec. 15, 2006. |
PCT Intenatonal Search Report and Written Opinion for Application No. PCT/US2009/056419, reference 325076-03WO, Mar. 12, 2010. |
PCT International Search Report and Written Opinion for Application No. PCT/US2009/063127, reference 325668-02WO, May 31, 2010. |
Zhu, “Power Aware Storage Cache Management”, IEEE Transactions on Computers, May 2005. |
Bisson, “A Hybrid Disk-Aware Spin-Down Algorithm with 1/0 Subsystem Support”, IEEE International Performance, Computing, and Communications Conference, Apr. 11-13, 2007. |
Huffman, “Non-Volatile Memory Host Controller Interface (NVMHCI) 1.0”, Apr. 14, 2008. |
Greenan, “CompulsiveFS: Making NVRAM Suitable for Extremely Reliable Storage”, Proceedings of the 5th USENIX Conference on File and Storage Technologies, Feb. 13-16, 2007. |
Darden, “Data Integrity: The Dell/EMC Distinction”, May 2002. |
Archer, “ReadyBoost—Using Your USB Key to Speed Up Windows Vista”, Apr. 14, 2006. |
Archer, “ReadyBoost Q&A”, Jun. 2, 2006. |
Allchin, “Microsoft Explains Vista ReadyBoost”, CDRinfo, Nov. 21, 2006. |
Vitter, “External Memory Algorithms”, Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Jun. 1-3, 1998. |
Ekman, “TLB and Snoop Energy-Reduction using Virtual Caches in Low-Power Chip-Multiprocessors”, Proceedings of the 2002 International Symposium on Low Power Electronics and Design, Aug. 12-14, 2002. |
CN Notice on the Second Office Action for Application No. 200980145878.1, Sep. 16, 2013. |
JP Decision to Decline the Amendment for Application No. 2005-135274, Jul. 3, 2012. |
JP Final Rejection for Application No. 2005-135274, Jul. 3, 2012. |
JP Notice of Rejection for Application No. 2003-347507, Mar. 26, 2010. |
JP Notice of Rejection for Application No. 2003-347507, Nov. 30, 2010. |
CA Office Action for Application No. 2,442,188, Mar. 10, 2010. |
AU Examiner's first report on patent application No. 2003243990, Jan. 23, 2009. |
KR Notice of Preliminary Rejection for Application No. 1 0-2003-69015, Nov. 30, 2009. |
RU Official Action for Application No. 2003129662, Sep. 14, 2007. |
MX Office Action for Application No. PA/a/2003/008766, Jul. 28, 2007. |
EP Communication for Application No. 03022573.4-1229, Reference EP28554-/df, Jul. 14, 2010. |
AU Examiner's first report on patent application No. 2010201717, Jun. 28, 2011. |
CA Examiner's Report for Application No. 2,523,761, Feb. 26, 2013. |
EP Communication for Application No. 05109295.5-2201, Reference EP36830RK900dfi, Oct. 28, 2008. |
EP Result of consultation for Application No. 05109295.5-2201, Reference EP36830RK900dfi, Jun. 12, 2012. |
JP Final Rejection for Application No. 2005-306948, Jan. 13, 2012. |
KR Notice of Preliminary Rejection for Application No. 1 0-2005-0099666, Apr. 30, 2012. |
EP Communication for Application No. 06839426.1-1229, Reference FB20211, Sep. 2, 2011. |
EP Communication for Application No. 06839426.1-1229, Reference FB20211, Oct. 28, 2011. |
Fox, “Invention: The phantom car”, NewScientist.com, Aug. 17, 2005. |
MY Adverse Report for Application No. PI 20081667, Aug. 30, 2013. |
JP Notice of Rejection for Application No. 2012-111004, May 14, 2013. |
IN First Examination Report for Application No. 1 086/DEL/2005, Sep. 10, 2013. |
JP Notice of Rejection for Application No. 2012-243915, Jul. 9, 2013. |
CA Office Action for Application No. 2,723,077, Jan. 9, 2013. |
CN Notice on the Third Office Action for Application No. 200980137190.9, Aug. 1, 2013. |
CN Decision on Rejection for Application No. 200980136912.9, Aug. 1, 2013. |
KR Reasons for Rejection for Application No. 1 0-2008-7014092, Reference 314396.08, May 30, 2013. |
IL Notification of Defects in Patent Application No. 191502, Feb. 17, 2013. |
CN Notice on the Second Office Action for Application No. 200980137190.9, Mar. 20, 2013. |
CN Notice on the First Office Action for Application No. 200980145878.1, Jan. 29, 2013. |
CN First Office Action for Application No. 200510083792.4, Feb. 1, 2008. |
CN Second Office Action for Application No. 200510083792.4, Jun. 27, 2008. |
CN Decision on Rejection for Application No. 200680047384.6, Nov. 11, 2010. |
EP Communication for Application No. 05103697.8-2201, Reference EP34979TE900dfi, May 21, 2007. |
EP Communication for Application No. 05 103697.8-2201, Reference EP34979TE900dfi, Oct. 26, 2007. |
EP Communication for Application No. 05 103 697.8-2201, Reference EP34979TE900dfi, Jun. 17, 2008. |
EP Communication for Application No. 05 103 697.8-2201, Reference EP34979TE900dfi, Nov. 7, 2008. |
JP Notice of Rejection for Application No. 2005-135274, Sep. 24, 2010. |
JP Notice of Rejection for Application No. 2005-135274, Sep. 9, 2011. |
RU Official Action for Application No. 2003129662, Nov. 9, 2007. |
EP Communication for Application No. 03022573.4-1229, Reference EP28554-/df, Aug. 2, 2007. |
EP Communication for Application No. 03 022 573.4-1229, Reference EP28554-/df, Nov. 8, 2007. |
EP Communication for Application No. 03 022 573.4-1229, Reference EP28554-/df, Oct. 6, 2008. |
Search Report for Taiwan Patent Application No. 094114140, Nov. 22, 2011, 2 pages. |
Notice of Rejection in Japanese Patent Application No. 2005-134492 dated Jan. 25, 2011. |
“Computervision Launches Design Automation Development Platform for Windows, UNIX Desktop Applications”, PR Newswire, Financial News, Jan. 10, 1995, 3 pages. |
“Developers Guide to Apple Data Detectors-For Version 1.0.2”, Apple Computer, Inc., Nov. 1997, 1-34. |
“Mechanical Design Software (Buyers Guide)”, Computer-Aided Engineering, Dec. 1993,12(12), 32-36. |
“Oracle 9i SQL Reference”, Release 2 (9.2), Oct. 2002, 29 pages. |
Anderson et al., “Referential Integrity Implementation Details and Advantages”, IBM Technical Disclosure Bulletin, Mar. 1, 1995, 38(3), 477-487. |
Andrews et al., “Combining Language and Database Advances in an Object-Oriented Development Environment”, Conference on Object Oriented Programming Systems Languages and Applications, Orlando, Florida, United States, Oct. 4-8, 1987, 430-440. |
Ballard et al., “Improved Recovery From Partial Page Writes of Data Pages”, IBM technical Disclosure Bulletin, May 1, 1993, 36(5), 141-143. |
Beard et al., “Multilevel and Graphical Views of Metadata”, Fifth International Forum on Research and Technology Advances in Digital Libraries, Santa Barbara, California, Apr. 22-24, 1998, 256-265. |
Beitner et ai, “Multimedia Support and Authoring in Microcosm, and extended model”, Department of Electronics and Computer Science, University of Southampton, 1994, 12 pages. |
Berg. “How Do I Create Persistent Java Objects?”, Dr. Dobb's Journal, Apr. 1, 1997,22(4), 98-101. |
EP Summons to attend oral proceedings, Reference EP36830RK900dfi, for Application No. 05109295.5-2201/1650666, Mar. 8, 2012. |
Motoazabu, “IEEE1394: A Dream Interface at the Turning Point”, PC User, Japan. Oct. 24, 1999. |
EP Decision to refuse a European Patent application No. 05 109295.5-2201, Reference EP36830RK900dfi, Aug. 7, 2012. |
CN First Office Action for Application No. 200510116208.0, Jun. 6, 2008. |
CN First Office Action for Application No. 200680047384.6, Jan. 22, 2010. |
EP Provision of the minutes of the oral proceedings for Application No. 05 109 295.5-2201, Reference EP36830RK900dfi, Aug. 7, 2012. |
JP Notice of Reasons for Rejection for Application No. 2008-545888, Aug. 29, 2012. |
EP Result of consultation for Application No. 05109295.5-2201, Reference EP36830RK900dfi, Jun. 15, 2012. |
EP Provision of the minutes of the oral proceedings for Application No. 05 109 295.5-2201, Reference EP36830RK900dfi, Aug. 1, 2012. |
JP Notice of Reasons for Rejection for Application No. 2008-545888, Apr. 19, 2012. |
EP Supplementary Search Report for Application No. 06839426, search completed on May 4, 2009. |
PCT International Search Report and Written Opinion for Application No. PCT/US2006/048402, May 8, 2007. |
“Optimization of CF Host Operation,” SanDisk® Corporation, Feb. 28, 2005. |
“Optimizing Program/Erase Times,” Spansion TM, Sep. 2, 2004. |
Notice of Rejection, Translation from Japanese Patent Application No. 2005-306948, Mar. 11, 2011. |
“Memory Accelerator,” NewScientist.com, printed Aug. 26, 2005, http://ww.newscientist.com/articie.ns?id=dn7857&feedld=online-news—rss20. |
Anderson et al., “A Case for Buffer Servers,” Hot Topics in operating Systems, Proceedings of the Seventh Workshop on Rio Rico, AZ, Mar. 29-30, 1999, XP010355835. |
European Search Report for 05109295.5 mailed Jun. 8, 2007. |
Office Action issued in U.S. Appl. No. 12/366,112 dated Sep. 29, 2009. |
Office Action issued in U.S. Appl. No. 10/970,772 dated May 18, 2007. |
Final Office Action issued in U.S. Appl. No. 10/970,772 dated Nov. 28, 2007. |
Office Action issued in U.S. Appl. No. 10/970,772 dated May 28, 2008. |
Bhattacharya et al., “Coordinating Backup/Recovery and Data Consistency Between Database and File Systems”, International Conference on Management of Data, Madison, Wisconsin, USA, Jun. 4-6, 2002, 12 pages. |
Biliris, “The Performance of Three Database Storage Structures for Managing Large Objects”, ACM SIGMOD, Jun. 2-5, 1992, 21 (2), 276-285. |
Booch, “Object-Oriented Analysis and Design with Applications”, Cummings Publishing Co., 1994,155-156 and 179-183. |
Bracchi et al., “Binary Logical Associations in Data Modeling”, Modelling in Data Base Management Systems G.M. Nijssen, (ed), Proceeding of the IFIP Working Conference on Modelling in Data Base Management Systems, Freudenstadt, Germany, Jan. 5-8, 1976, 125-147. |
Buneman et al., “Inheritance and Persistence in Database Programming Languages”, International Conference on Management of Data, Washington, D.C., United States, Jun. 1986, 4-15. |
Bullock et al., “Recovery of Data Pages after Partial Page Writes”, IBM Technical Disclosure Bulletin, Aug. 1991, 34(3), 69-83. |
Cammarata et al., “Extending a relational database with deferred referential integrity checking and intelligent joins”, SIGMOD Record USA, Jun. 1989, 18(2), 88-97. |
Chien, “Concurrent Aggregates (CA)—Design and Experience with a Concurrent Object—Oriented Language Based on Aggregates”, Journal of Parallel and Distributed Computing, Mar. 1995, 25(2), 174-196. |
Chryssostomidis et al., “Geometric Modeling Issues in Computer Aided Design of Marine Structures”, Marine Technology Society Journal, Dec. 1988, 22(2), 15-33. |
Ciccozzi, “Microsoft Press Computer Dictionary”, Third Edition 1997, 3, 39-40. |
D'Andrea et al., “UniSQL's next-generation object-relational database management system”, ACM SIGMOD Record, Sep. 1996, 25(3), 70-76. |
Darby, “Object Serialization in Java 1.1 Making Objects Persistent”, Web Techniques, Sep. 1997, 2(9),55 and 58-59. |
Dietrich, Jr., et al., “TGMS: An Object-Oriented System for Programming Geometry”, Software-Practice and Experience, Oct. 1989, 19(10), 979-1013. |
Dobashi et al., “Skylight for Interior Lighting Design”, Computer Graphics Forum, Aug. 1994, 13(3), 85-96. |
Dorsch, “Accel Signs with IBM to Buy Altium PCB Unit”, EDA Licensing, Electronic New, Jan. 16, 1995, 3 pages. |
EP Application No. 05103690: Partial European Search Report, Apr. 28, 2008, 7 pages. |
Fegaras et al., “Optimizing Object Queries Using an Effective Calculus”, ACM Transactions on Database Systems (TODS), Dec. 2000, 25(4),457-516. |
Findler et al., “Contract Soundness for Object-Oriented Languages”, ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Nov. 2001, 36(11), 15 pages. |
Foley et al., “Computer Graphics: Principles and Practices”, Second Edition, Addison-Wesley Publishing Company, Jun. 15, 1990, Chapter 5 and 9, 201-283. |
Friis-Christensen et al., “Requirements and Research issues in Geographic Data Modeling”, Proceedings of the 9th ACM international symposium on Advances in geographic information systems, Atlanta, Georgia, USA, Nov. 9-10, 2001, 7 pages. |
Fuh et al., “Implementation of SQL3 Structured Types with Inheritance and Value Substitutability”, Digital Symposium Collection 2000 (Abstract only), Proceedings of 25th International Conference on Very Large Data Bases, Sep. 7-10, 1999, 2 pages. |
Garret, Jr., et al., “An Object Oriented Environment for Representing Building Design and Construction Data”, Advanced Construction Technology Center, Document No. 89-37-04, Jun. 1989, 1-34. |
Goscinski, “Distributed Operating Systems, The Logical Design”, Addison-Wesley Longman Publishing Co., Inc., Aug. 1991, 306-313. |
Harrison et al., “Structure Editors: User-Defined Type Values and Type Inference”, International Conference on Software Methods and Tools, 2000, Wollongong, NSW, Australia, Nov. 6-9, 2000, 241-247. |
Haverlock, “Object Serialization, Java, and C++”, Dr. Dobb's Journal, Aug. 1, 1998, 23(8), 5 pages. |
Hay, “Data Model Patterns: Convention of Thought”, Dorset House Publishing, New York, NY, 1996,47-67 and 235-259. |
Hernandez et al., “The Merge/Purge Problem for Large Databases”, International Conference on Management of Data and Symposium on Principles of Database Systems, Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, May 1995, 24(2), 12 pages. |
Hsiao et al., “DLFM: A Transactional Resource Manager”, International Conference on Management of Data, May 16-18, 2000, 518-528. |
Kaneko et al., “Design of 3D CG Data Model of Move Animation Database System”, Advanced Database Research and Development Series, Proceedings of the Second Far-East Workshop on Future Database Systems, Apr. 1992, 2, 364-372. |
Katz, “Toward a Unified Framework for Version Modeling in Engineering Databases”, ACM Computing Surveys (CSUR), Dec. 1990, 22(4), 375-408. |
Kawabe et al., “A Framework for 3D Modeling Constraint-Based Description and Non-Manifold Geometric Modeling”, A Collection of Contributions based on Lectures Presented at the 2nd Toyota Conference, Organization of Engineering Knowledge for Product Modeling in Computer Integrated Manufacturing, Japan, Oct. 2-5, 1988, 325-357. |
Kempfer, “CAD Jumps on Windows 3.1 Bandwagon”, Computer Aided Engineering, Nov. 1993, 24-25. |
Khan et al., “A Performance Evaluation of Storing XML Data in Relational Database Management Systems”, Proceedings of the 3rd international workshop on Web information and data management, WIDM, Nov. 5-10, 2001, 31-38. |
Khoshafian et al., “Object Indentify”, OOPSLA'86, Proceedings, Sep. 1986, 21, 406-416. |
Kiesling, “ODBC in UNIX Environments”, Dr. Dobb's Journal, Dec. 2002, 27(12), 16-22. |
King et al., “TriStarp—An Investigation into the Implementation and Exploitation of Binary Relational Storage Structures”, Proceedings of 8.sup.th (BNCOD) British National Conference on Data Bases, Jul. 9-11, 1990,64-84. |
Krouse, “Geometric Models for CAD/CAM”, Machine Design, Jul. 24, 1980,99-105. |
LeBlanc et al., “Design Data Storage and Extraction Using Objects”, Concurrent Engineering: Research and Applications, Mar. 7, 1992, 1, 31-38. |
Leontiev et al., “On Type Systems for Object-Oriented Database Programming Languages”, ACM Computing Surveys, Dec. 2002, 34(4), 1-50. |
Levy et al., “Incremental Recovery in Main Memory Database Systems”, IEEE Transactions on Knowledge and Data Engineering, Dec. 1992, 4(6), 529-540. |
Lim et al., “Transaction Processing in Mobile, Heterogeneous Database Systems”, IEEE Transactions on Knowledge and Data Engineering, Nov. 2002, 14(6), 1330-1346. |
Mallet et al., “Myrtle: A Set-Oriented Meta-Interpreter Driven by a “Relational” Trace for Deductive Databases Debugging”, Lecture Notes in Computer Science, Apr. 30, 1999, 1559, 1-22. |
Mariani, “Oggelto: An Object Oriented Database Layered on a Triple Store”, The Computer Journal, Apr. 1992, 35(2), 108-118. |
McMahon, “SED—A Non-Interactive Test Editor”, Bell Laboratories, Aug. 15, 1978, 10 pages. |
Melton et al., “SQL and Management of External Data”, ACM SIGMOD Record, Mar. 2001, 30(1), 8 pages. |
Mitchell, “The Logic of Architecture”, Massachusetts Institute of Technology, Apr. 26, 1990, 139-143. |
Navathe, “Evolution of Data Modeling for Databases”, Communications of the ACM, Sep. 1992, 35(9), 112-123. |
Nelson et al., “Generic Support for Caching and Disconnected Operation”, 4th Workshop on Workstation Operatng Systems (WWOS-IV), Napa, CA, USA, Oct. 14-15, 1993, 5 pages. |
Nijssen et al., “Conceptual Schema and Relational Database Design, A Fact Oriented Approach”, Department of Computer Science, University of Queensland, Prentice Hall, Jun. 1989, 10-33,42-43,48-51, 156-171. |
Orenstein et al., “Query Processing in the Object Store Database System”, ACM SIGMOD, International Conference on Management of Data, Jun. 1992, 21 (2), 403-412. |
Ottogalli et al., “Visualisation of Distributed Application for Performance Debugging”, Lecture Notes in Computer Science, Jan. 2001, 2074,831-840. |
Pachet et al., “A Combinatorial Approach to Content-Based Music Selection”, Multimedia Computing and Systems, Florence, Jul. 1999, 1,6 pages. |
Papiani et al., “A Distributed Scientific Data Archive Using the Web, XML and SQLIMED”, SIGMOD Record, Sep. 1999, 28(3), 7 pages. |
Ponnekanti et al., “Online Index Rebuild”, Proceedings of the AMC SIGMOD International Conference on Management of Data, Dallas, Texas, United States, May 15-18, 2000, 529-538. |
Powell, “Object, References, Identifiers, and Equality White Paper”, OMG TC Document 93.7.5, Jul. 2, 1993,1-24. |
Prosise, “2-D Drafting: Why Pay More?”, PC Magazine: The Independent Guide to IBM-Standard Personal Computing, Feb. 23, 1993, 12(4), 255-289. |
Ramsey et al., “An Algebraic Approach to File Synchronization”, Software Engineering Notes, Association for Computing Machinery, Sep. 2001, 26(5), 175-185. |
Read, III, “Developing the Next Generation Cockpit Display System”, IEEE, Aerospace and Electronics Systems Magazine, Oct. 1996, 11(1 0), 25-28. |
Reiner et al., “Benefits of X-based Three-Tier Client/Server Model with ESRI Applications”, Virtual Solutions, Jun. 1995, 9 pages. |
Rosenblum et al., “The Design and Implementation of a Log-Structured File System”, Proceedings of the 13th ACM Symposium on Operating Systems Principles, Jul. 24, 1991, 1-15. |
Rouse, “CAD Pioneers are Still Trailblazing”, Machine Design, Oct. 22, 1987, 59(25), 117-122. |
Roussopoulos et al., “Using Semantic Networks for Data Base Management”, Proceedings of the 1st International Conference on Very Large Data Bases, Sep. 22-24, 1975, 144-172. |
Santos et al., “Computer Aided Mechanical Engineering Design Environment for Concurrent Design Process”, Proceedings of the 1993 ITEC Workshop on Concurrent Engineering Simulation in Concurrent Engineering, May 4-6, 1993, 71-83. |
Seshadri, “Enhanced Abstract Data Types in Object-Relational Databases”, The VLDB Journal, The International Journal on Very Large Databases, Aug. 1998, 7(3), 130-140. |
Simoes et at., “A RISC-Microcontroller Based Photovoltaic System for Illumination Applications”, Fifteenth Annual IEEE: Applied Power Electronics Conference and Exposition (APEC 2000), New Orleans, LA, USA, Feb. 6-10, 2000, 2,115-1156. |
Simon, “Strategic Database Technology: Management for the Year 2000”, Morgan Kaufmann Publishers, May 1995, 446 pages. |
Singhal et al., “DDB: An Object Design Data Manager for VLSI CAD”, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, Washington, D.C., United States, May 26-28, 1993, 467-470. |
Sreekanth et al., “A Specification Environment for Configuring a Discrete-Part Manufacturing System Simulation Infrastructure”, International Conference on Systems. Man and Cybernetics, Le Touquet, France. Oct. 17-20, 1993, 1, 349-354. |
Sreenath, “A Hybrid Computation Environment of Multibody Simulation, Mathematics and Computers in Simulation”, Aug. 1992, 34(2),121-140. |
Stevens, “Value in 3-D”, Industry Week, Jan. 8, 1995, 45-46. |
Stonebraker, “The Case for Partial Indexes”, SIGMOD Record, Dec. 1989, 18(4), 8 pages. |
Strickland, “Intersection of Relational and Object”, Proceedings of the AM/FM International Conference XVII, Mar. 14-17, 1994,69-75. |
Sutherland et al., “The Hybrid Object-Relational Architecture (HORA); an Integration of Object-Oriented and Relational Technology”. Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing; states of the art and practice, Indianapolis, Indiana, United States, Feb. 14-16, 1993, 326-333. |
Suzuki et al., “Geometric Modeling for Modeling Products”, Proceedings of the Third International Conference on Engineering Graphics and Descriptive Geometry, Vienna, Austria, Jul. 11-16, 1988, 2,237-243. |
Taylor et al., “An Integrated Robot System Architecture”, Proceedings of the IEEE. Jul. 1983, 71(7), 842-856. |
Varlamis et al., “Bridging XML-Schema and Relational Databases. A System for generating and Manipulating Relational Databases using Valid XML Documents”, DocEng' 01, Nov. 9-10, 2001, 10 pages. |
CN Notice on the Third Office Action for Application No. 200980146878.1, May 6, 2016. |
TW Search Report for Application No. 098129955, Jan. 26, 2015. |
CN Decision on Reexamination for Application No. 200980145878.1, Apr. 1, 2016. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on Grant of Patent Right for Invention for Application No. 200980145878.1, pp. 1-2, Aug. 19, 2016, China. |
Chinese Patent Office, Author unknown, CN Notice on the Third Office Action for Application No. 200980136912.9, pp. 1-3, Sep. 9, 2016, China. |
Brazil Patent Office, Author unknown, BR Office Action for Application No. PI0304297-9, Nov. 19, 2015, pp. 1-3, Brazil. |
Brazil Patent Office, Author unknown, BR Office Action for Application No. PI0304297-9, Apr. 18, 2016, p. 1, Brazil. |
Brazil Patent Office, Author unknown, BR Office Action for Application No. BR122016001493-2, May 10, 2016, pp. 1-2, Brazil. |
Brazil Patent Office, Author unknown, BR Office Action for Application No. BR122016001493-2, Sep. 5, 2016, pp. 1-2, Brazil. |
European Patent Office, Examiner Deane E, EP Summons to attend oral proceedings for Application No. 05103697.8, Dec. 17, 2015, 5 pages, Munich, Germany. |
Taiwan Patent Office, Author unknown, TW Search Report for Application No. 098138300, Sep. 22, 2014, p. 1, Taiwan. |
European Patent Office, Examiner Davide Mandato, EP Communication for Application No. 09826570.5, Aug. 17, 2015, 6 pages, Rijswijk, Netherlands. |
Malaysian Patent Office, Author unknown, MY Certificate of Grant of a Patent for Application No. PI 20081667, Jul. 31, 2014, p. 1, Malaysia. |
Singapore Intellectual Property Office, Author unknown, SG Notification of Grant for Application No. 2010092518, Jul. 22, 2014, 3 pages, Singapore. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on the Second Office Action for Application No. 200980136912.9, May 24, 2016, pp. 1-3, China. |
Russian Patent Office, Attorney Tatiana Andreeva, RU Decision on Grant for Application No. 2008140263, Nov. 22, 2012, pp. 1-7, Russia. |
Japanese Patent Office, JP Notice of Allowance for Application No. 2008-545888, Mar. 26, 2013, p. 1, Japan. |
Chinese State Intellectual Property Office, Author unknown, CN Decision on Reexamination for Application No. 200980136912.9, Feb. 15, 2016, p. 1, China. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on Grant of Patent Right for Invention for Application No. 200980137190.9, Oct. 23, 2013, pp. 1-2, China. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on the Third Office Action for Application No. 200980145878.1, May 6, 2016, pp. 1-3, China. |
Australian Patent Office, Author unknown, AU Notice of Acceptance for Application No. 2010201717, Oct. 18, 2011, 3 pages, Australia. |
Japanese Patent Office, JP Notice of Allowance for Application No. 2011-526951, Feb. 12, 2015, p. 1, Japan. |
Japanese Patent Office, JP Notice of Allowance for Application No. 2011-527865, May 21, 2013, p. 1, Japan. |
Taiwan Intellectual Property Office, TW Notice of Allowance for Application No. 98129955, May 26, 2015, pp. 1-2, Taiwan. |
European Patent Office, EP Communication under Rule 71(3) EPC: Intention to grant for Application No. 03022573.4, May 2, 2011, 6 pages, Netherlands. |
European Patent Office, EP Invitation pursuant to Article 94(3) and Rule 71(1) EPC for Application No. 05109295.5, Dec. 16, 2009, 3 pages, Germany. |
European Patent Office, EP Communication under Rule 71(3) EPC: Intention to grant for Application No. 06839426.1, Jul. 16, 2012, 6 pages, Netherlands. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on Grant of Patent Right for Invention for Application No. 200680047384.6, Sep. 23, 2011, pp. 1-2, China. |
Canadian Intellectual Property Office, Author unknown, CA Notice of Allowance for Application No. 2,442,188, Feb. 22, 2011, 1 page, Canada. |
Canadian Intellectual Property Office, Author unknown, CA Notice of Allowance for Application No. 2,523,761, Jan. 6, 2015, 1 page, Canada. |
Canadian Intellectual Property Office, Author unknown, CA Notice of Allowance for Application No. 2,723,077, Feb. 17, 2014, 1 page, Canada. |
Russian Patent Office, Attorney Tatiana M. Andreeva, RU Decision on Grant for Application No. 2003129662, Jul. 30 2008, pp. 1-7, Russia. |
Australian Patent Office, Author unknown, AU Notice of Acceptance for Application No. 2003243990, Feb. 1, 2010, 3 pages, Australia. |
Japanese Patent Office, JP Notice of Allowance for Application No. 2003-347507, Apr. 1, 2011, pp. 1-3, Japan. |
Russian Patent Office, Attorney Yury D. Kuznetsov, RU Decision on Grant for Application No. 2005132448, Jan. 20, 2010, pp. 1-6, Russia. |
Australian Patent Office, Author unknown, AU Examiner's report No. 2 for Application No. 2006331830, Feb. 1, 2011, 2 pages, Australia. |
Australian Patent Office, Author unknown, AU Notice of Acceptance for Application No. 2005219500, Oct. 14, 2010, 3 pages, Australia. |
Japanese Patent Office, JP Notice of Allowance for Application No. 2005-306948, Aug. 7, 2012, pp. 1-3, Japan. |
Australian Patent Office, Author unknown, AU Notice of Acceptance for Application No. 2006331830, May 19, 2011, 3 pages, Australia. |
Australian Patent Office, Author unknown, AU Examiner's first report for Application No. 2006331830, Nov. 29, 2010, 2 pages, Australia. |
European Patent Office, EP Communication for Application No. 09814983.4, Dec. 15, 2016, 7 pages, Germany. |
European Patent Office, EP Communication for Application No. 09826570.5, Oct. 11, 2016, 6 pages, Rijswijk, Netherlands. |
European Patent Office, EP Summons to attend oral proceedings for Application No. 05103697.8, Nov. 11, 2016, 8 pages, Munich, Germany. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on Grant of Patent Right for Invention for Application No. 200510083792.4, Nov. 21, 2008, pp. 1-2, China. |
Taiwan Intellectual Property Office, TW Notice of Allowance for Application No. 94114140, Apr. 23, 2012, pp. 1-2, Taiwan. |
Taiwan Intellectual Property Office, TW Notice of Allowance for Application No. 101110178, Dec. 10, 2014, pp. 1-2, Taiwan. |
U.S. Appl. No. 10/186,164, filed Jun. 27, 2002, Fortin. |
U.S. Appl. No. 10/304,367, filed Nov. 26, 2002, Nicholson. |
U.S. Appl. No. 10/372,734, filed Feb. 21, 2003, DeWhitt. |
U.S. Appl. No. 15/216,059, filed Jul. 21, 2016, Ergan. |
U.S. Appl. No. 15/340,826, filed Nov. 1, 2016, Fortin. |
U.S. Appl. No. 15/229,025, filed Aug. 4, 2016, Cong. |
Number | Date | Country | |
---|---|---|---|
20160210058 A1 | Jul 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14530661 | Oct 2014 | US |
Child | 15080357 | US | |
Parent | 13187757 | Jul 2011 | US |
Child | 14530661 | US | |
Parent | 12775168 | May 2010 | US |
Child | 13187757 | US | |
Parent | 12366112 | Feb 2009 | US |
Child | 12775168 | US | |
Parent | 10970772 | Oct 2004 | US |
Child | 12366112 | US |