公开(公告)号：US07137116B2

公开(公告)日：2006-11-14

申请号：US09779763

申请日：2001-02-08

Applicant: Michael A Parkes ,  James R. Larus

Inventor： Michael A Parkes ,  James R. Larus

IPC: G06F9/46 ,  G06F12/00

CPC classification number: G06F9/4843

Abstract: A method and system for performing a task on a computer is provided, in which the procedure is organized into multiple stages. Each stage of the task has an associated sub-task. Requests for the procedure are represented by “work packets” that stored in a holding area at each stage, such as a stack or a queue, until it is advantageous for a processor to execute them. Each work packet contains data and/or instructions for performing the sub-task of the stage. When a processor is available, it finds a stage having unexecuted work packets and executes a batch of work packets by repeatedly performing the sub-task of the stage. This repeated execution of a sub-task allows a processor to maximize its native time-saving mechanisms, such as cache. The invention may advantageously be used as an alternative to conventional thread-based programming.

Abstract translation: 提供了一种用于在计算机上执行任务的方法和系统，其中该过程被组织成多个阶段。 任务的每个阶段都有相关的子任务。 该过程的请求由存储在每个阶段的保持区域（例如堆栈或队列）中的“工作包”表示，直到处理器执行它们是有利的。 每个工作包包含用于执行舞台的子任务的数据和/或指令。 当处理器可用时，它发现一个阶段有未执行的工作包，并通过重复执行阶段的子任务来执行一批工作包。 子任务的这种重复执行允许处理器最大化其本机时间节省机制，例如高速缓存。 本发明可有利地用作常规线程编程的替代。

公开(公告)号：US06330556B1

公开(公告)日：2001-12-11

申请号：US09270125

申请日：1999-03-15

Applicant: Trishul M. Chilimbi ,  James R. Larus ,  Robert Davidson

Inventor： Trishul M. Chilimbi ,  James R. Larus ,  Robert Davidson

IPC: G06F1730

CPC classification number: G06F17/30339 ,  G06F12/0802 ,  Y10S707/99932

Abstract: Fields which are individually addressable data elements in data structures are reordered to improve the efficiency of cache line access. Temporal data regarding the referencing of such fields is obtained, and a tool is used to construct a field affinity graph of temporal access affinities between the fields. Nodes in the graph represent fields, and edges between the nodes are weighted to indicate field affinity. A first pass greedy algorithm attempts to combine high affinity fields in the same cache line or block. Constraints are used to reject invalid combinations of fields. Data structures such as class are partitioned into heavily referenced and less heavily referenced portions. The partitioning is based on profile information about field access counts with indirect addressing used to reference the less heavily referenced partitioned class. A class co-location scheme is used to ensure that temporally correlated classes are placed near each other in cache blocks. A generational garbage collection algorithm is used to ensure that objects that are most heavily referenced are more likely to remain in cache blocks.

Abstract translation: 数据结构中可单独寻址的数据元素的字段被重新排序以提高高速缓存行访问的效率。 获得关于这些字段的引用的时间数据，并且使用工具来构建字段之间的时间访问亲和度的字段关联图。 图中的节点表示字段，并且节点之间的边被加权以指示字段亲和度。 第一遍贪婪算法尝试将高亲和度字段组合在相同的高速缓存行或块中。 限制用于拒绝字段的无效组合。 诸如类的数据结构被划分为严格引用和较少引用的部分。 分区基于关于使用间接寻址的字段访问计数的配置文件信息，用于引用较不引用的分区类。 类别同位置方案用于确保时间相关的类在缓存块中彼此靠近放置。 代数垃圾收集算法用于确保被最多引用的对象更有可能保留在高速缓存块中。

公开(公告)号：US06321240B1

公开(公告)日：2001-11-20

申请号：US09268204

申请日：1999-03-15

Applicant: Trishul M. Chilimbi ,  James R. Larus

Inventor： Trishul M. Chilimbi ,  James R. Larus

IPC: G06F1700

CPC classification number: G06F8/4442 ,  Y10S707/99943 ,  Y10S707/99957

Abstract: Fields which are individually addressable data elements in data structures are reordered to improve the efficiency of cache line access. Temporal data regarding the referencing of such fields is obtained, and a tool is used to construct a field affinity graph of temporal access affinities between the fields. Nodes in the graph represent fields, and edges between the nodes are weighted to indicate field affinity. A first pass greedy algorithm attempts to combine high affinity fields in the same cache line or block. Constraints are used to reject invalid combinations of fields. Data structures such as class are partitioned into heavily referenced and less heavily referenced portions. The partitioning is based on profile information about field access counts with indirect addressing used to reference the less heavily referenced partitioned class. A class co-location scheme is used to ensure that temporally correlated classes are placed near each other in cache blocks. A generational garbage collection algorithm is used to ensure that objects that are most heavily referenced are more likely to remain in cache blocks.

Abstract translation: 数据结构中可单独寻址的数据元素的字段被重新排序以提高高速缓存行访问的效率。 获得关于这些字段的引用的时间数据，并且使用工具来构建字段之间的时间访问亲和度的字段关联图。 图中的节点表示字段，并且节点之间的边被加权以指示字段亲和度。 第一遍贪婪算法尝试将高亲和度字段组合在相同的高速缓存行或块中。 限制用于拒绝字段的无效组合。 诸如类的数据结构被划分为严格引用和较少引用的部分。 分区基于关于使用间接寻址的字段访问计数的配置文件信息，用于引用较不引用的分区类。 类别同位置方案用于确保时间相关的类在缓存块中彼此靠近放置。 代数垃圾收集算法用于确保被最多引用的对象更有可能保留在高速缓存块中。

公开(公告)号：US08719143B2

公开(公告)日：2014-05-06

申请号：US11613232

申请日：2006-12-20

Applicant: Henricus Johannes Maria Meijer ,  Gary W. Flake ,  Arnold N. Blinn ,  William J. Bolosky ,  Lili Cheng ,  Michael Connolly ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  David R. Treadwell, III

Inventor： Henricus Johannes Maria Meijer ,  Gary W. Flake ,  Arnold N. Blinn ,  William J. Bolosky ,  Lili Cheng ,  Michael Connolly ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  David R. Treadwell, III

IPC: G06Q40/00 ,  G06Q30/08 ,  G06Q30/06

CPC classification number: G06Q30/08 ,  G06F11/202 ,  G06F17/303 ,  G06Q30/0611 ,  G06Q40/00

Abstract: The claimed subject matter provides a system and/or a method that facilitates preserving and maintaining data and/or services associated with a network service. The network service can be any collection of resources that are maintained by a party (e.g., third-party, off-site, etc.) and accessible by an identified user over a network (e.g., WAN, Internet, etc.). An interface component can receive a termination notification related to the network service. An executor component can relocate at least a portion of one of data and a service associated with the terminated network service to a disparate replacement network service in order to preserve any services and/or data related therewith.

Abstract translation: 所要求保护的主题提供有助于保持和维护与网络服务相关联的数据和/或服务的系统和/或方法。 网络服务可以是由一方维护的任何资源集合（例如，第三方，非现场等），并且可以由被识别的用户通过网络（例如，WAN，因特网等）访问。 接口组件可以接收与网络服务相关的终止通知。 执行器组件可以将与终止的网络服务相关联的数据和服务中的一个的至少一部分重定位到不同的替换网络服务，以便保留与之相关的任何服务和/或数据。

公开(公告)号：US08402110B2

公开(公告)日：2013-03-19

申请号：US11613917

申请日：2006-12-20

Applicant: Henricus Johannes Maria Meijer ,  William H. Gates, III ,  Raymond E. Ozzie ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  Christopher W. Brumme ,  Lili Cheng ,  Nishant V. Dani ,  Daniel S. Glasser ,  Alexander G. Gounares ,  Galen C. Hunt ,  James R. Larus ,  Matthew B. MacLaurin ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath

Inventor： Henricus Johannes Maria Meijer ,  William H. Gates, III ,  Raymond E. Ozzie ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  Christopher W. Brumme ,  Lili Cheng ,  Nishant V. Dani ,  Daniel S. Glasser ,  Alexander G. Gounares ,  Galen C. Hunt ,  James R. Larus ,  Matthew B. MacLaurin ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath

IPC: G06F15/16

CPC classification number: H04L67/32 ,  H04L67/10

Abstract: Remote provisioning of an IT network and/or associated services is provided. Hardware, software, service and/or expertise can be moved from on-premise to a remote location (e.g., central, distributed . . . ). Accordingly, at least a large degree computation can be moved to the center to exploit economies of scale, among other things. In such an architecture, computational resources (e.g., data storage, computation power, cache . . . ) can be pooled, and entities can subscribe to a particular level of resources related to a private entity IT network.

Abstract translation: 提供IT网络和/或相关服务的远程配置。 硬件，软件，服务和/或专业知识可以从内部移动到远程位置（例如，中央，分布式）。 因此，除了别的以外，至少大部分的计算可以移动到中心以利用规模经济。 在这种架构中，可以汇集计算资源（例如，数据存储，计算能力，高速缓存...），并且实体可以订阅与私有实体IT网络相关的特定资源级别。

公开(公告)号：US07882317B2

公开(公告)日：2011-02-01

申请号：US11462556

申请日：2006-08-04

Applicant: Galen C. Hunt ,  Chris K. Hawblitzel ,  James R. Larus ,  Manuel A. Fahndrich ,  Mark Aiken

Inventor： Galen C. Hunt ,  Chris K. Hawblitzel ,  James R. Larus ,  Manuel A. Fahndrich ,  Mark Aiken

IPC: G06F12/00

CPC classification number: G06F21/562 ,  G06F9/544 ,  G06F12/1009 ,  G06F12/109 ,  G06F12/1491 ,  G06F21/566 ,  G06F21/57 ,  G06F2212/1016 ,  G06F2212/1052 ,  G06F2212/651 ,  G06F2212/657

Abstract: A first plurality of operating system processes is assigned to a first protection domain, and a second plurality of operating system processes is assigned to a second protection domain. One or more hardware protection mechanisms are used to prevent the first plurality of operating system processes from accessing the memory space of the second plurality of operating system processes, and also to prevent the second plurality of operating system processes from accessing the memory space of the first plurality of operating system processes.

Abstract translation: 第一多个操作系统进程被分配给第一保护域，并且第二多个操作系统进程被分配给第二保护域。 使用一个或多个硬件保护机制来防止第一多个操作系统进程访问第二多个操作系统进程的存储器空间，并且还防止第二多个操作系统进程访问第一多个操作系统进程的存储器空间 多个操作系统进程。

公开(公告)号：US07716280B2

公开(公告)日：2010-05-11

申请号：US11613892

申请日：2006-12-20

Applicant: Henricus Johannes Maria Meijer ,  William H. Gates, III ,  Raymond E. Ozzie ,  Gary W. Flake ,  Lili Cheng ,  Nishant V. Dani ,  Daniel S. Glasser ,  Alexander G. Gounares ,  James R. Larus ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath

Inventor： Henricus Johannes Maria Meijer ,  William H. Gates, III ,  Raymond E. Ozzie ,  Gary W. Flake ,  Lili Cheng ,  Nishant V. Dani ,  Daniel S. Glasser ,  Alexander G. Gounares ,  James R. Larus ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath

IPC: G06F15/16

CPC classification number: H04L67/20 ,  G06Q40/12 ,  G06Q50/22 ,  H04L67/28 ,  H04L67/2842

Abstract: The claimed subject matter provides systems and/or methods that facilitate replicating a state associated with a client, user, service, application, and the like. A third party service provider can support any number of services that can be concurrently requested by several clients without user perception of degraded computing performance as compared to conventional systems/techniques due to improved connectivity and mitigated latencies. A replication component can generate replicas of states associated with requested services. Further, the replicas can facilitate seamlessly interacting with the third party service provider (e.g., while transitioning between client devices). Additionally, by providing replicas of the state related information, differing third party service providers can effectuate services based upon a request from a client without regenerating the state.

Abstract translation: 所要求保护的主题提供了有助于复制与客户端，用户，服务，应用等相关联的状态的系统和/或方法。 与传统的系统/技术相比，由于改进了连接性和缓解延迟，第三方服务提供商可以支持多个客户端可以同时请求的任何数量的服务，而无需用户感知降级的计算性能。 复制组件可以生成与请求的服务相关联的状态的副本。 此外，副本可以促进与第三方服务提供商的无缝交互（例如，在客户端设备之间转换时）。 此外，通过提供状态相关信息的副本，不同的第三方服务提供商可以基于来自客户端的请求来实现服务而不再生状态。

公开(公告)号：US07689524B2

公开(公告)日：2010-03-30

申请号：US11536488

申请日：2006-09-28

Applicant: Raymond E. Ozzie ,  William H. Gates, III ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  William J. Bolosky ,  Christopher W. Brumme ,  Lili Cheng ,  Michael Connolly ,  Dane A. Glasgow ,  Daniel S. Glasser ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Henricus Johannes Maria Meijer ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath ,  Melora Zaner-Godsey

Inventor： Raymond E. Ozzie ,  William H. Gates, III ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  William J. Bolosky ,  Christopher W. Brumme ,  Lili Cheng ,  Michael Connolly ,  Dane A. Glasgow ,  Daniel S. Glasser ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Henricus Johannes Maria Meijer ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath ,  Melora Zaner-Godsey

IPC: G06F15/18 ,  G06F17/00 ,  G06F5/00 ,  G06F9/44 ,  G06F15/16 ,  G06N7/02 ,  G06N7/06

CPC classification number: G06N5/02 ,  G06Q10/00

Abstract: An intelligent personalized agent monitors, regulates, and advises a user in decision-making processes for efficiency or safety concerns. The agent monitors an environment and present characteristics of a user and analyzes such information in view of stored preferences specific to one of multiple profiles of the user. Based on the analysis, the agent can suggest or automatically implement a solution to a given issue or problem. In addition, the agent can identify another potential issue that requires attention and suggests or implements action accordingly. Furthermore, the agent can communicate with other users or devices by providing and acquiring information to assist in future decisions. All aspects of environment observation, decision assistance, and external communication can be flexibly limited or allowed as desired by the user.

Abstract translation: 智能个性化代理在决策过程中对用户的效率或安全问题进行监控，调节和建议。 代理监视环境并呈现用户的特征，并根据对用户的多个配置文件之一特有的存储的偏好来分析这些信息。 基于分析，代理可以建议或自动实现给定问题或问题的解决方案。 此外，代理可以确定需要注意的另一个潜在问题，并相应地提出或实施行动。 此外，代理可以通过提供和获取信息来协助未来的决定与其他用户或设备进行通信。 环境观察，决策辅助和外部沟通的各个方面可以根据用户的需要进行灵活的限制或允许。

公开(公告)号：US07647522B2

公开(公告)日：2010-01-12

申请号：US11613241

申请日：2006-12-20

Applicant: Henricus Johannes Maria Meijer ,  Raymond E. Ozzie ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  Christopher W. Brumme ,  Michael Connolly ,  Dane A. Glasgow ,  Alexander G. Gounares ,  Galen C. Hunt ,  James R. Larus ,  Matthew B. MacLaurin ,  David R. Treadwell, III

Inventor： Henricus Johannes Maria Meijer ,  Raymond E. Ozzie ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  Christopher W. Brumme ,  Michael Connolly ,  Dane A. Glasgow ,  Alexander G. Gounares ,  Galen C. Hunt ,  James R. Larus ,  Matthew B. MacLaurin ,  David R. Treadwell, III

IPC: G06F11/00

CPC classification number: G06F11/004 ,  H04L41/0659 ,  H04L41/16 ,  H04L41/22

Abstract: The claimed subject matter provides a system and/or a method that facilitates re-locating a web application associated with a network service utilizing a portion of serialized data. The network service can be any collection of resources that are maintained by a party (e.g., third-party, off-site, etc.) and accessible by an identified user over a network (e.g., WAN, Internet, etc.). A receiver component can receive a request for initiating and execution of a process that is maintained by the network service. A servicing component can analyze representations of multiple processes within the network service and determines whether to enable initiation and execution of the process based at least in part upon the analysis.

Abstract translation: 所要求保护的主题提供了利用序列化数据的一部分来促进与网络服务相关联的web应用重新定位的系统和/或方法。 网络服务可以是由一方维护的任何资源集合（例如，第三方，非现场等），并且可以由被识别的用户通过网络（例如，WAN，因特网等）访问。 接收器组件可以接收由网络服务维护的进程的启动和执行请求。 服务组件可以分析网络服务内的多个进程的表示，并且至少部分地基于分析来确定是否启动和执行进程。

公开(公告)号：US07600232B2

公开(公告)日：2009-10-06

申请号：US11007655

申请日：2004-12-07

Applicant: Galen C. Hunt ,  James R. Larus ,  Manuel Fahndrich ,  Edward P. Wobber ,  Martin Abadi ,  John D. DeTreville

Inventor： Galen C. Hunt ,  James R. Larus ,  Manuel Fahndrich ,  Edward P. Wobber ,  Martin Abadi ,  John D. DeTreville

IPC: G06F3/00 ,  G06F9/44 ,  G06F9/46 ,  G06F13/00

CPC classification number: G06F9/546 ,  G06F2209/547

Abstract: Described herein is an implementation of an inter-process communications technology. One or more implementations, described herein, facilitate creation of a bi-directional message conduit having exactly two endpoints. A first endpoint is owned by a first software process and a second endpoint is owned by a second software process. One or more implementations, described herein, maintain the bi-directional message conduit for passing multiple messages via the bi-directional message conduit from the first process to the second process, according to established rules that can be checked.

Abstract translation: 这里描述的是进程间通信技术的实现。 本文描述的一个或多个实施方式有助于创建具有正好两个端点的双向消息导管。 第一端点由第一软件进程拥有，第二端点由第二软件进程所拥有。 根据已经可以检查的规则，本文描述的一个或多个实施方案维护双向消息管道，用于经由双向消息管道将多个消息从第一进程传递到第二进程。