In a collaborative environment, some computer applications allow multiple clients to simultaneously edit a document. As multiple clients are editing the document, a server may maintain a copy of the document. The server may need to continually update the copy of the document to reflect the current state of the document. This can lead to inefficiencies.
For example, even with only a single client editing the document, the client's application may need to continuously update the server to allow the transition to multi-party editing when it occurs. This can increase server load, thereby causing a degradation in performance.
Example systems and methods described herein relate to a caching infrastructure.
According to one aspect, an example method for retrieval of presence metadata includes: receiving a request from a first client to edit a document file; sending short-term check out metadata to the first client to begin an editing session; and writing the transition ID to a transition table stored in a cache, wherein the presence of another transition ID in the cache indicates that a document has switched from a single-client mode to a multi-client mode.
According to another aspect, an example system includes a cache infrastructure for retrieval of presence metadata. The system includes a memory storage unit, and a processing unit coupled to the memory storage unit, wherein the processing unit is operative to receive short-term check out metadata from a first client to begin an editing session, add a transition ID to the short-term check out metadata, write the transition ID to a transition table stored in a cache, and switch from a single-client mode to a multi-client mode. Switching from the single-client mode to the multi-client mode comprises the processing unit being operative to notice when the first client attempts to take another short-term lock on the document and seeing that that a second client has already received the document. The processing unit is operative to determine if the multi-client mode is in progress by checking a database, receive a ping from the first client to determine if the transition ID is in the cache, and when the transition ID is not in the cache, receive pings from the first client at regular intervals, and save the document to the server a plurality of times without incurring any reads/writes to the database, and, when the transition ID is in the cache, receive a ping from the first client to collect a lock table from the database to identify the second client, and receive the second client's lock information by receiving pings that do not carry lock information.
According to yet another aspect, an example client computer for retrieval of metadata relating to a multi-client editing session includes a memory unit, and a processing unit operative to receive a document from a storage device, the document comprising short-term check out metadata indicating an editing session has begun, ping a cache to determine if another transition ID is stored in the cache, and send a transition ID to a transition table stored in a cache when the another transition ID is not stored in the cache to switch from a single-client mode to a multi-client mode when the another transition ID is stored in the cache.
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter. Nor is this Summary intended to be used to limit the claimed subject matter's scope.
Non-limiting and non-exhaustive embodiments are described with reference to the following figures, wherein like reference numerals refer to like parts throughout the various views unless otherwise specified.
In the following detailed description, references are made to the accompanying drawings that form a part hereof, and in which are shown by way of illustrations specific embodiments or examples. While the disclosure will be described in the general context of program modules that execute in conjunction with an application program that runs on an operating system on a computer system, those skilled in the art will recognize that the disclosure also may be implemented in combination with other program modules. The embodiments described herein may be combined and other embodiments may be utilized without departing from the spirit or scope of the present disclosure. The following detailed description is therefore not to be taken in a limiting sense, and the scope of the disclosure is defined by the appended claims and their equivalents.
Embodiments of the present disclosure provide an environment in which multiple clients can collaboratively author a document while consuming minimal server resources. In example embodiments, when a coauthoring capable application is editing a document, the application adds coauthoring metadata to the document and keeps a server copy of the file updated with the latest metadata. The coauthoring metadata and server copy allows seamlessly transitions from a single client to a multi-client editing state and vice versa. To keep conflicts to a minimum, the coauthoring metadata is uploaded to the server. When a new client opens the document, the client is notified of the areas of the document where other clients are working.
The authoring system 100 also includes at least one client computing device 110 that is communicatively coupled to the storage device 120. Each of the client computing devices 110 can edit the document 150 by creating a client copy 155 of the document 150 and editing the client copy 155. The client copies 155 of the document 150 are synchronized when the client computing devices 110 periodically send to the storage device 120 updates to be shared with the other client computing devices and periodically obtain from the storage device 120 updates from other client computing devices.
As the term is used herein, a client computing device 110 includes any computing device that obtains a client copy of a document to be authored from a master copy of the document. The client computing device 110 can be different from the storage device 120 or can include a different client account implemented on the storage device 120. In one embodiment, a computing device that acts as a storage device 120 for one document may act as a client computing device 110 for a different document and vice versa.
In the example shown, four client computing devices 110A, 110B, 110C, and 110D are communicatively coupled to the storage device 120. In other embodiments, however, any number of computing devices 110 may be coupled to the storage device 120. In the example shown, each client computing device 110A, 110B, 110C, 110D can send to the storage device 120 updates generated by the client of the client computing device and can request from the storage device 120 updates generated by the clients of the other client computing devices. In one embodiment, the storage device 120 can be a server computing device and the client computing devices 110A, 110B, 110C, 110D can be client computing devices. Other system configurations are possible. For example, in an alternative embodiment, multiple server computing devices can be used.
As shown in
In general, the client computing devices 110 can synchronize updates to the content 152 separately from updates to the metadata 154. In general, metadata updates 154 are automatically synchronized among the storage device 120 and client computing devices 110, whereas content updates 152 from each client computing device 110 are synchronized at the request of the respective client.
Referring to
For example, in the lock table 300, data units 312 and 314 are associated with a first client 310. Other clients, therefore, are inhibited from editing data units 312 and 314. Data unit 322 is associated with client 320. Other clients, including the first client 310, therefore, are inhibited from editing data unit 322. The fourth client 340 has not locked any portion of the document and so is not associated with any unit identifiers. In other embodiments, however, lock metadata can be stored in a different format or within the document. For example, the lock table 300 can be arranged by unit identifier instead of by client identifier.
Presence metadata also can be stored in a variety of formats. For example, presence metadata can be stored in the lock table 300 of
The client computing device 410 includes an authoring application 412 configured to provide an authoring environment in which a client can create and/or manipulate a document to be authored. The client computing device 410 also includes a cache 414, a layer object (“LO”) 416, and a synchronization manager (“sync manager”) 418. The cache 414 stores a client copy of the document to be authored. The cache 414 also stores the metadata, including lock and presence metadata, associated with the document. Updates to the content and metadata of the document also can be stored in the cache 414.
The layer object 416 provides an interface between the authoring application 412 and the cache 414. The layer object 416 also provides an interface between the authoring application 412 and the sync manager 418. The sync manager 418 communicates with the storage device 420 and provides an interface between the storage device 420 and the cache 414. For example, the sync manager 418 can send updates to and obtain updates from the storage device 420 and the cache 414.
In general, an authoring environment having features that are examples of aspects in accordance with the principles of the disclosure can be implemented on a client computing device (e.g., a personal computer, a server computer, a notebook computer, a PDA, a Smartphone, or any other such computing device). A non-limiting embodiment of a client computing system 500 configured to implement an authoring environment is described herein with reference to
In
System memory 520 typically stores an operating system 522, such as the WINDOWS® operating systems from Microsoft Corporation of Redmond, Washington, suitable for controlling the operation of the computing device 510. System memory 520 also may include a document cache 526 in which a client copy 527 of a document can be stored. Metadata 529 of the document also can be stored within the client cache 526.
The system memory 520 also may store one or more software applications, such as authoring applications 524 for creating and editing documents. One non-limiting example of an authoring application 524 suitable for authoring documents in accordance with the principles of the present disclosure is Word word processing software from Microsoft Corporation. Other non-limiting examples of authoring applications include POWERPOINT® presentation software and VISIO® drawing and diagraming software, both also from Microsoft Corporation. Other software applications can also be used.
Computing device 510 also may have input device(s) 530, such as a keyboard, mouse, pen, voice input device, touch input device, etc., for entering and manipulating data. Output device(s) 535, such as a display screen, speakers, printer, etc., also may be included. These output devices 535 are well known in the art and need not be discussed at length herein.
The computing device 510 also may contain communication connections 540 that allow the device 510 to communicate with other computing devices, for example, the storage device 420 of
Turning now to
From stage 610, where computing device 510 received metadata 529, method 600 may advance to stage 620 where computing device 510 may add a transition ID to the metadata 529.
Once computing device 510 adds the transition ID to metadata 529 in stage 620, method 600 may continue to subroutine 630 where computing device 510 may write the transition ID to a transition table stored in cache 526. For example, writing the transition ID to metadata 529 may indicate more than one client is editing the document (i.e. switching from a single-client mode to a multi-client mode) as show in
In one example, the transition ID is a unique number, such as a Globally Unique Identifier (GUID—i.e., a pseudo-random 128—bit number). The transition table is a list of the transition IDs. The transition table can also include an expiration date for each transition ID. The expiration date can be used to clear a transition ID when a client forces creation of a transition ID and thereupon abandon editing of the document without notification. Other configurations are possible.
From subroutine stage 630, where computing device 510 may write the transition ID to a transition table stored in cache 526, method 600 may advance to stage 640 where computing device 510 may ping storage device 120 (e.g. a server) to determine if the transition ID is in cache 526.
When the transition ID is not in the cache, computing device 510 may ping the server at regular intervals, and save the document to the server a plurality of times without incurring any reads/writes to a database that stores presence information.
When the transition ID is in the cache, computing device 510 may ping the server to collect a lock table from a database to identify a new client, and in a separate web service request, submitting the client's lock information. Computing device 510 may then delete the transition ID from the transition table.
Computing device 510 may also submit a client's lock information. Submitting the client's lock information may include pinging the server. For example, the computing device can submit “am I alone” pings to the server, wherein the “am I alone” pings do not carry lock information. An “am I alone” ping is simply a ping to the server or other storage device wherein computing device 510 is requesting information to determine if the document is being edit by another client or if another client had begun editing the document after the client began editing the document.
Every time each client downloads presence metadata, the number of clients in an editing session and the last time each client updated their presence information (e.g., transition ID, transition table, database, etc.) may be checked (among other things), at regular intervals. If the presence information has not been updated by any client in a configurable window of time, it is considered a violent exit from the session. Any client who first observes this exit can delete the client from the presence information. Further, the delete operation should be a graceful merge so that any other client who also made the same observation can re-request the omissions which results in a no-op in the server.
If the presence information reflects only one client (which should be the examining client, i.e., computing device 510), the following actions may be done to minimize problems associated with the timing of the change of state of the document: 1) clear-up the presence table so it reflects the state as a single client mode; 2) delete the transition ID to the transition table; and 3) start the “am I alone” pings at regular intervals.
The transition ID in the transition table indicates another user has joined the coauthoring session and is in transition back to multi-user authoring. When the system transitions back to one client editing, that client starts sending the “am I alone” pings. The “am I alone” pings returned to the client indicate the client is alone until another client puts the transition ID back in the transition table.
Once computing device 510 pings storage device 120 in stage 640, method 600 may continue to stage 650 where computing device 510 may refresh cache 526.
For example, computing device 510 may refresh cache 526 by updating the transition table stored in cache 526. For instance updating the transition table may include pinging cache 526 to check for the presence of the transition ID in cache 526. When the transition ID is not present in cache 526, a determination may be made to see if cache 526 has been refreshed within a predetermined time interval. When cache 526 has been refreshed within the predetermined time interval, a response to the ping may be sent from cache 526. When cache 526 has not been refreshed within the predetermined time interval, the transition table corresponding to the document's content database may be fetched. Once computing device 510 has refresh cache 526 in stage 650, method 600 may then end at stage 660.
For example, switching from single-client mode to multi-client mode may be initiated by a second client attempting to take another short-term lock on the document and seeing that that the client has already received the document. Switching to multi-client mode may include computing device 510 receiving the document and transition ID at cache 526. In this instance computing device 510 may actually be a second client computing device. After receiving the transition ID, computing device 510 may write the transition ID to the transition table, and write to the database information indicating the second client has joined the editing session and is now working on the document.
If computing device 510 determines the document is in multi-client mode in stage 710, subroutine 630 may continue to stage 720 where computing device 510 may adds the client as the “nth” client. For example, adding the “nth” client may include computing device 510 receiving the document and transition ID, and writing to the database information indicating the “nth” client has joined the editing session.
From stage 715 where computing device 510 switches from single-client mode to multi-client mode or stage 720 where computing device 510 adds the “nth” client, subroutine 630 may advance to stage 730 where computing device 510 may return to stage 640 (
Reference may be made throughout this specification to “one embodiment,” “an embodiment,” “embodiments,” “an aspect,” or “aspects” meaning that a particular described feature, structure, or characteristic may be included in at least one embodiment of the present disclosure. Thus, usage of such phrases may refer to more than just one embodiment or aspect. In addition, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments or aspects. Furthermore, reference to a single item may mean a single item or a plurality of items, just as reference to a plurality of items may mean a single item. Moreover, use of the term “and” when incorporated into a list is intended to imply that all the elements of the list, a single item of the list, or any combination of items in the list has been contemplated.
Embodiments of the disclosure may be implemented as a computer process (method), a computing system, or as an article of manufacture, such as a computer program product or computer readable media. The processes (programs) can be implemented in any number of ways, including the structures described in this document. One such way is by machine operations, of devices of the type described in this document. Another optional way is for one or more of the individual operations of the methods to be performed on a computing device in conjunction with one or more human operators performing some of the operations. These human operators need not be collocated with each other, but each can be only with a machine that performs a portion of the program.
The computer program product may be a computer storage media readable by a computer system and encoding a computer program of instructions for executing a computer process. The computer program product may also be a propagated signal on a carrier readable by a computing system and encoding a computer program of instructions for executing a computer process. The term computer readable media as used herein includes both storage media and communication media.
Those skilled in the art will appreciate that the disclosure may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. The disclosure 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. Generally, program modules include routines, programs, components, data structures, and other types of structures that perform particular tasks or implement particular abstract data types.
Number | Name | Date | Kind |
---|---|---|---|
4855580 | Van Maanen, Jr. | Aug 1989 | A |
5107443 | Smith et al. | Apr 1992 | A |
5142619 | Webster, III | Aug 1992 | A |
5313394 | Clapp | May 1994 | A |
5339389 | Bates et al. | Aug 1994 | A |
5486686 | Zdybel | Jan 1996 | A |
5535332 | Ishida | Jul 1996 | A |
5568640 | Nishiyama et al. | Oct 1996 | A |
5623659 | Shi et al. | Apr 1997 | A |
5630138 | Raman | May 1997 | A |
5664186 | Bennett et al. | Sep 1997 | A |
5671428 | Muranaga et al. | Sep 1997 | A |
5692178 | Shaughnessy | Nov 1997 | A |
5729734 | Parker | Mar 1998 | A |
5751958 | Zweben | May 1998 | A |
5781732 | Adams | Jul 1998 | A |
5781908 | Williams et al. | Jul 1998 | A |
5787262 | Shakib et al. | Jul 1998 | A |
5835950 | Cho et al. | Nov 1998 | A |
5963931 | Fagg | Oct 1999 | A |
6000945 | Sanchez-Lazer | Dec 1999 | A |
6006239 | Bhansali et al. | Dec 1999 | A |
6026461 | Baxter et al. | Feb 2000 | A |
6055546 | Pongracz et al. | Apr 2000 | A |
6065026 | Cornelia | May 2000 | A |
6067551 | Brown et al. | May 2000 | A |
6073161 | DeBoskey et al. | Jun 2000 | A |
6088702 | Plantz | Jul 2000 | A |
6202085 | Benson et al. | Mar 2001 | B1 |
6209010 | Gauthier | Mar 2001 | B1 |
6209128 | Gerard et al. | Mar 2001 | B1 |
6240414 | Beizer et al. | May 2001 | B1 |
6275935 | Barlow | Aug 2001 | B1 |
6317777 | Skarbo et al. | Nov 2001 | B1 |
6327584 | Xian et al. | Dec 2001 | B1 |
6327611 | Everingham | Dec 2001 | B1 |
6341291 | Bentley et al. | Jan 2002 | B1 |
6342906 | Kumar et al. | Jan 2002 | B1 |
6363352 | Dailey et al. | Mar 2002 | B1 |
6411965 | Klug | Jun 2002 | B2 |
6438548 | Grim, III et al. | Aug 2002 | B1 |
6446093 | Tabuchi | Sep 2002 | B2 |
6529905 | Bray et al. | Mar 2003 | B1 |
6560614 | Barboy et al. | May 2003 | B1 |
6560620 | Ching | May 2003 | B1 |
6574377 | Cahill | Jun 2003 | B1 |
6662209 | Potts, Jr. et al. | Dec 2003 | B2 |
6681382 | Kakumani | Jan 2004 | B1 |
6687878 | Eintracht et al. | Feb 2004 | B1 |
6711718 | Pfeil et al. | Mar 2004 | B2 |
6751618 | Germscheid et al. | Jun 2004 | B1 |
6757678 | Myllymaki | Jun 2004 | B2 |
6757871 | Sato et al. | Jun 2004 | B1 |
6760840 | Shimbo et al. | Jul 2004 | B1 |
6772165 | O'Carroll | Aug 2004 | B2 |
6854087 | Takeo et al. | Feb 2005 | B1 |
6983416 | Bae | Jan 2006 | B1 |
7007235 | Hussein et al. | Feb 2006 | B1 |
7039679 | Mendez et al. | May 2006 | B2 |
7047407 | Itoh et al. | May 2006 | B2 |
7058663 | Johnston et al. | Jun 2006 | B2 |
7065633 | Yates et al. | Jun 2006 | B1 |
7069505 | Tamano | Jun 2006 | B2 |
7110936 | Hiew | Sep 2006 | B2 |
7111237 | Chan | Sep 2006 | B2 |
7127501 | Beir et al. | Oct 2006 | B1 |
7149776 | Roy et al. | Dec 2006 | B1 |
7185277 | Bernstein et al. | Feb 2007 | B1 |
7200668 | Mak | Apr 2007 | B2 |
7209948 | Srinivasa | Apr 2007 | B2 |
7225189 | McCormack et al. | May 2007 | B1 |
7249314 | Walker | Jul 2007 | B2 |
7310657 | Nakamura | Dec 2007 | B2 |
7328243 | Yeager et al. | Feb 2008 | B2 |
7346705 | Hullot et al. | Mar 2008 | B2 |
7401291 | Ramaley et al. | Jul 2008 | B2 |
7496577 | Williamson | Feb 2009 | B2 |
7536641 | Rosenstein et al. | May 2009 | B2 |
7577906 | Friedrichowitz | Aug 2009 | B2 |
7594163 | Slack-Smith | Sep 2009 | B2 |
7603357 | Gourdol | Oct 2009 | B1 |
7610287 | Dean et al. | Oct 2009 | B1 |
7647292 | Hayashi | Jan 2010 | B2 |
7650336 | Herrmann et al. | Jan 2010 | B1 |
7664750 | Frees et al. | Feb 2010 | B2 |
7694217 | Croft | Apr 2010 | B2 |
7714222 | Taub | May 2010 | B2 |
7761784 | Parks et al. | Jul 2010 | B2 |
7788326 | Buchheit et al. | Aug 2010 | B2 |
7792788 | Melmon et al. | Sep 2010 | B2 |
7839532 | Brawn et al. | Nov 2010 | B2 |
7912811 | Hodel-Widmer | Mar 2011 | B2 |
7941399 | Bailor et al. | May 2011 | B2 |
8028229 | Bailor et al. | Sep 2011 | B2 |
20010018697 | Kunitake et al. | Aug 2001 | A1 |
20020007287 | Straube et al. | Jan 2002 | A1 |
20020065848 | Walker et al. | May 2002 | A1 |
20030028600 | Parker | Feb 2003 | A1 |
20030093760 | Suzuki et al. | May 2003 | A1 |
20030097410 | Atkins | May 2003 | A1 |
20030097638 | Tamano | May 2003 | A1 |
20030115481 | Baird | Jun 2003 | A1 |
20030140067 | Sesek et al. | Jul 2003 | A1 |
20030159105 | Hiebert | Aug 2003 | A1 |
20030167281 | Cohen et al. | Sep 2003 | A1 |
20030172113 | Cameron et al. | Sep 2003 | A1 |
20030208534 | Carmichael | Nov 2003 | A1 |
20040039829 | Bucher | Feb 2004 | A1 |
20040068505 | Lee et al. | Apr 2004 | A1 |
20040107224 | Bera | Jun 2004 | A1 |
20040122870 | Park | Jun 2004 | A1 |
20040122898 | Srinivasa | Jun 2004 | A1 |
20040133858 | Barnett | Jul 2004 | A1 |
20040143630 | Kaufmann et al. | Jul 2004 | A1 |
20040172395 | Edelstein et al. | Sep 2004 | A1 |
20040177343 | McVoy et al. | Sep 2004 | A1 |
20040199550 | Ito et al. | Oct 2004 | A1 |
20040205539 | Mak et al. | Oct 2004 | A1 |
20040205653 | Hadfield et al. | Oct 2004 | A1 |
20040230903 | Elza et al. | Nov 2004 | A1 |
20040239700 | Baschy | Dec 2004 | A1 |
20050004990 | Durazo | Jan 2005 | A1 |
20050071386 | Wolfgang | Mar 2005 | A1 |
20050097440 | Lusk et al. | May 2005 | A1 |
20050198132 | Vellante et al. | Sep 2005 | A1 |
20050210392 | Koide | Sep 2005 | A1 |
20050223066 | Buchheit et al. | Oct 2005 | A1 |
20050234943 | Clarke | Oct 2005 | A1 |
20050240858 | Croft et al. | Oct 2005 | A1 |
20050262203 | Buchheit et al. | Nov 2005 | A1 |
20050289512 | Matsusaka | Dec 2005 | A1 |
20060015811 | Tanaka et al. | Jan 2006 | A1 |
20060020360 | Wu | Jan 2006 | A1 |
20060053194 | Schneider | Mar 2006 | A1 |
20060053195 | Schneider et al. | Mar 2006 | A1 |
20060080432 | Spataro et al. | Apr 2006 | A1 |
20060085402 | Brown et al. | Apr 2006 | A1 |
20060101328 | Albornoz | May 2006 | A1 |
20060123033 | Livshits | Jun 2006 | A1 |
20060136511 | Ngo | Jun 2006 | A1 |
20060136809 | Fernstrom | Jun 2006 | A1 |
20060200755 | Melmon et al. | Sep 2006 | A1 |
20060218476 | Gombert | Sep 2006 | A1 |
20060242549 | Schwier et al. | Oct 2006 | A1 |
20060248038 | Kaplan | Nov 2006 | A1 |
20060259524 | Horton | Nov 2006 | A1 |
20070066293 | Peng | Mar 2007 | A1 |
20070118598 | Bedi et al. | May 2007 | A1 |
20070130334 | Carley | Jun 2007 | A1 |
20070186157 | Walker et al. | Aug 2007 | A1 |
20070186171 | Junuzovic et al. | Aug 2007 | A1 |
20070198952 | Pittenger | Aug 2007 | A1 |
20070203917 | Du et al. | Aug 2007 | A1 |
20070226320 | Hager et al. | Sep 2007 | A1 |
20070226604 | Chalasani et al. | Sep 2007 | A1 |
20070271502 | Bedi et al. | Nov 2007 | A1 |
20070283321 | Hegde | Dec 2007 | A1 |
20080028300 | Krieger et al. | Jan 2008 | A1 |
20080059539 | Chin | Mar 2008 | A1 |
20080072141 | Hodel-Widmer | Mar 2008 | A1 |
20080086718 | Bostic et al. | Apr 2008 | A1 |
20080097993 | Nanba | Apr 2008 | A1 |
20080098294 | Le | Apr 2008 | A1 |
20080114740 | Vergottini | May 2008 | A1 |
20080126953 | Davidson et al. | May 2008 | A1 |
20080147590 | Bechtel et al. | Jun 2008 | A1 |
20080177782 | Poston | Jul 2008 | A1 |
20080195800 | Lee | Aug 2008 | A1 |
20080235579 | Champion et al. | Sep 2008 | A1 |
20080256113 | Rasmussen et al. | Oct 2008 | A1 |
20080256114 | Rasmussen et al. | Oct 2008 | A1 |
20080270386 | Ohi et al. | Oct 2008 | A1 |
20080294895 | Bodner | Nov 2008 | A1 |
20090006936 | Parker | Jan 2009 | A1 |
20090006948 | Parker | Jan 2009 | A1 |
20090063489 | Neumann et al. | Mar 2009 | A1 |
20090094242 | Lo et al. | Apr 2009 | A1 |
20090157811 | Bailor et al. | Jun 2009 | A1 |
20090171987 | Coppinger et al. | Jul 2009 | A1 |
20090193331 | Croft et al. | Jul 2009 | A1 |
20090228473 | Kannan et al. | Sep 2009 | A1 |
20090235158 | Rosenstein et al. | Sep 2009 | A1 |
20090271696 | Bailor et al. | Oct 2009 | A1 |
20090282462 | Skaria | Nov 2009 | A1 |
20090327294 | Bailor | Dec 2009 | A1 |
20100070464 | Aymeloglu et al. | Mar 2010 | A1 |
20100088676 | Yuan | Apr 2010 | A1 |
20100131836 | Dukhon et al. | May 2010 | A1 |
20110184906 | Bailor et al. | Jul 2011 | A1 |
Number | Date | Country |
---|---|---|
19844071 | Apr 1999 | DE |
1290575 | Jun 2005 | EP |
1681652 | Jul 2006 | EP |
10-0331685 | Apr 2002 | KR |
200424868 | Nov 2004 | TW |
200627259 | Aug 2006 | TW |
WO 0133362 | May 2001 | WO |
WO 02033575 | Apr 2002 | WO |
WO 2005114467 | Dec 2005 | WO |
WO 2007034858 | Mar 2007 | WO |
WO 2007062949 | Jun 2007 | WO |
WO 2009061638 | May 2009 | WO |
WO 2009076010 | Jun 2009 | WO |
WO 2009079116 | Jun 2009 | WO |
WO 2009134548 | Nov 2009 | WO |
WO 2009154842 | Dec 2009 | WO |
WO2009158108 | Dec 2009 | WO |
Number | Date | Country | |
---|---|---|---|
20090282041 A1 | Nov 2009 | US |