专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20080313645A1 Automatic Mutual Exclusion 有权
标题翻译：自动相互排斥
公开(公告)号：US20080313645A1
公开(公告)日：2008-12-18
申请号：US11763964
申请日：2007-06-15
申请人： Andrew David Birrell , Michael Acheson Isard
发明人： Andrew David Birrell , Michael Acheson Isard
IPC分类号： G06F13/00
CPC分类号： G06F3/0622 , G06F3/0619 , G06F3/0659 , G06F3/0673 , G06F9/3004 , G06F9/3834 , G06F9/467 , G06F9/528 , G06F12/14 , G06F12/1425 , G06F13/4239
摘要： An automatic mutual exclusion computer programming system is disclosed which allows a programmer to produce concurrent programming code that is synchronized by default without the need to write any synchronization code. The programmer creates asynchronous methods which are not permitted make changes to shared memory that they cannot reverse, and can execute concurrently with other asynchronous methods. Changes to shared memory are committed if no other thread has accessed shared memory while the asynchronous method executed. Changes are reversed and the asynchronous method is re-executed if another thread has made changes to shared memory. The resulting program executes in a serialized order. A blocking system method is disclosed which causes the asynchronous method to re-execute until the blocking method's predicate results in an appropriate value. A yield system call is disclosed which divides asynchronous methods into atomic fragments. When a yield method call is made, shared memory changes are committed if possible or reversed and the atomic fragment is re-executed.
摘要翻译：公开了一种自动互斥计算机编程系统，其允许程序员产生默认同步的并行编程代码，而不需要编写任何同步代码。程序员创建异步方法，不允许对共享内存进行更改，而不能反转，并且可以与其他异步方法并发执行。如果在执行异步方法时没有其他线程访问共享内存，则会提交对共享内存的更改。更改被反转，如果另一个线程已更改共享内存，则重新执行异步方法。生成的程序以序列化的顺序执行。公开了阻塞系统方法，其导致异步方法重新执行，直到阻塞方法的谓词产生适当的值。公开了一种将异步方法分解为原子碎片的收益系统调用。当进行yield方法调用时，如果可能或反转，则提交共享内存更改，并重新执行原子片段。

2. 发明授权

US07797298B2 Serving cached query results based on a query portion 有权
标题翻译：根据查询部分提供缓存的查询结果
公开(公告)号：US07797298B2
公开(公告)日：2010-09-14
申请号：US11363895
申请日：2006-02-28
申请人： Gaurav Sareen , Michael Acheson Isard , Yinzhe Yu , Girish Kumar
发明人： Gaurav Sareen , Michael Acheson Isard , Yinzhe Yu , Girish Kumar
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30902
摘要： The embodiments contemplate a system and method for obtaining related results for a portion of a query and for generating an updated set of queries for a cache of a server. Other queries beginning with the portion of the query may be identified and obtained from a data structure that includes a server cache and a set of common queries. Once the other queries are identified, results for the other queries are obtained from the server cache or from a back-end database. A set of common queries, which may include deleted and additional queries, may be utilized to generate the updated set of queries for the server. Both missing queries and deleted queries that may belong to the server based on an assignment function are inserted into a queue, which is later delivered to the cache of the server. The transfer may occur during a low-activity or idle state.
摘要翻译：这些实施例考虑了用于获得查询的一部分的相关结果以及用于为服务器的高速缓存生成更新的一组查询的系统和方法。可以从包括服务器高速缓存和一组常见查询的数据结构中识别并获得从查询部分开始的其他查询。一旦识别出其他查询，则从服务器缓存或后端数据库获取其他查询的结果。可以使用一组常见查询（可以包括删除的和附加的查询）来生成针对服务器的更新的查询集合。基于分配功能可能属于服务器的丢失查询和已删除查询都将被插入到队列中，该队列稍后会传递到服务器的缓存。传输可能在低活动或空闲状态期间发生。

3. 发明授权

US08458724B2 Automatic mutual exclusion 有权
公开(公告)号：US08458724B2
公开(公告)日：2013-06-04
申请号：US11763964
申请日：2007-06-15
申请人： Andrew David Birrell , Michael Acheson Isard
发明人： Andrew David Birrell , Michael Acheson Isard
IPC分类号： G06F3/00 , G06F9/46
CPC分类号： G06F3/0622 , G06F3/0619 , G06F3/0659 , G06F3/0673 , G06F9/3004 , G06F9/3834 , G06F9/467 , G06F9/528 , G06F12/14 , G06F12/1425 , G06F13/4239
摘要： An automatic mutual exclusion computer programming system is disclosed which allows a programmer to produce concurrent programming code that is synchronized by default without the need to write any synchronization code. The programmer creates asynchronous methods which are not permitted make changes to shared memory that they cannot reverse, and can execute concurrently with other asynchronous methods. Changes to shared memory are committed if no other thread has accessed shared memory while the asynchronous method executed. Changes are reversed and the asynchronous method is re-executed if another thread has made changes to shared memory. The resulting program executes in a serialized order. A blocking system method is disclosed which causes the asynchronous method to re-execute until the blocking method's predicate results in an appropriate value. A yield system call is disclosed which divides asynchronous methods into atomic fragments. When a yield method call is made, shared memory changes are committed if possible or reversed and the atomic fragment is re-executed.

4. 发明授权

US07529834B1 Method and system for cooperatively backing up data on computers in a network 有权
公开(公告)号：US07529834B1
公开(公告)日：2009-05-05
申请号：US09668643
申请日：2000-09-22
申请人： Andrew David Birrell , Mark David Lillibridge , Michael Burrows , Michael Acheson Isard
发明人： Andrew David Birrell , Mark David Lillibridge , Michael Burrows , Michael Acheson Isard
IPC分类号： G06F15/173 , G06F15/16 , G06F11/00
CPC分类号： G06F11/1464 , Y10S707/99953
摘要： A method for backing up data in a plurality of computers connected via a network. The method includes forming partnerships between the plurality of computers such that each computer in a partnership commits under agreements to help backup the data of its partners. The method further includes periodically verifying that previously backed up data is being retained by the computers committed to act as backup partners in accordance with the agreements. In another embodiment, the method provides a distributed cooperative backing up of data in a system that includes a loose confederation of computers connected via a network. In this embodiment the method includes selecting computers as potential backup partners from among the loose confederation of computers connected via the network based on predetermined criteria, and negotiating a reciprocal backup partnership agreement between the computers based on predetermined requirements, including backup requirements. Once the negotiations are complete and the agreements are made, the method proceeds to form partnerships between the computers. The computers become backup partners by agreeing to cooperatively provide backup services to each other so that a distributed cooperative backing up of data can be administered in the absence of central control. The method further includes periodically backing up data at the backup partners, where the data being backed up is encoded. The method also includes periodically verifying that previously backed up data is retained by the backup partners. Another aspect of the invention is a distributed cooperative backup system that includes a network and a loose confederation of computers connected via the network. A plurality of computers from among the loose confederation of computers is configured for distributed cooperative backing up of data and for functioning as backup partners. Each computer of the plurality of computers has a storage that can be used for providing reciprocal backup services. Each computer of the plurality of computers respectively also has a computer readable medium embodying computer program code configured to cause the computer to perform functions comparable to the method steps as described above.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式