公开(公告)号：US06718360B1

公开(公告)日：2004-04-06

申请号：US09564881

申请日：2000-05-04

申请人： Michael B. Jones ,  Richard P. Draves, Jr. ,  Daniela Rosu ,  Marcel-Catalin Rosu

发明人： Michael B. Jones ,  Richard P. Draves, Jr. ,  Daniela Rosu ,  Marcel-Catalin Rosu

IPC分类号： G06F900

CPC分类号： G06F9/4887

摘要： The present invention provides predictable scheduling of programs using a repeating precomputed schedule. In a preferred embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. The scheduler first selects a current node within the accessed scheduling graph. When the processor becomes available to execute threads, the scheduler advances from the current node to a new current node in accordance with a root-to-leaf traversal of the scheduling graph. After advancing to the new current node, the scheduler executes one or more threads of the activity to which the new current node is dedicated for the execution interval length associated with the new current node. In a further preferred embodiment, the scheduler allocates specific iterations through specific nodes to satisfy the constraints submitted by threads.

摘要翻译： 本发明使用重复的预先计算的进度来提供程序的可预测的调度。 在优选实施例中，调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成，并且具有一个根，一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上，并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量，该节点 是在。 每个节点与其相关联的执行间隔长度，并且适于专用于执行单个活动的线程。 调度器首先选择所访问的调度图中的当前节点。 当处理器可用于执行线程时，调度器将根据调度图的根到叶遍历从当前节点前进到新的当前节点。 在进入新的当前节点之后，调度器执行新的当前节点专用于与新的当前节点相关联的执行间隔长度的活动的一个或多个线程。 在另一优选实施例中，调度器通过特定节点分配特定迭代以满足线程提交的约束。

公开(公告)号：US09262208B2

公开(公告)日：2016-02-16

申请号：US13589585

申请日：2012-08-20

申请人： Shang Q. Guo ,  Ramesh S. Palakodeti ,  Rajeev Puri ,  Daniela Rosu ,  Cashchakanithara Venugopal ,  Frederick Y. Wu ,  Sai Zeng

发明人： Shang Q. Guo ,  Ramesh S. Palakodeti ,  Rajeev Puri ,  Daniela Rosu ,  Cashchakanithara Venugopal ,  Frederick Y. Wu ,  Sai Zeng

IPC分类号： G06F7/04 ,  G06F9/46 ,  G06F9/48 ,  H04L12/24

CPC分类号： G06F9/468 ,  G06F9/4843 ,  H04L41/22 ,  H04L41/28

摘要： Distributed execution of commands and scripts may comprise a script execution manager having access to a library of executable objects comprising at least one or more of commands or scripts or combination of commands and scripts. A script execution console may be operable to present a graphical user interface for selecting an executable object from the library to execute and for selecting one or more managed computers, on which to execute the selected executable object. The script execution console may be further operable to present a dynamically updated collation of results from execution of the selected executable object. One or more script execution agents may be operable to run on the selected respective one or more managed computers and further operable to communicate with the script execution manager.

公开(公告)号：US07577759B2

公开(公告)日：2009-08-18

申请号：US11069153

申请日：2005-03-01

申请人： Daniela Rosu ,  Marcel C. Rosu

发明人： Daniela Rosu ,  Marcel C. Rosu

IPC分类号： G06F15/16

CPC分类号： H04L69/02

摘要： Transferring content between one or more input streams and one or more output streams via an application running on a host system. A kernel-level service is provided which is adapted to perform application-specific processing and which attends to transfer of content from at least one input stream to at least one output stream. With the kernel-level service, an operation is performed for the collection of at least one input stream and at least one output stream via: performing application-specific processing; and attending to the transfer of content from at least one input stream to at least one output stream.

摘要翻译： 通过在主机系统上运行的应用程序，在一个或多个输入流与一个或多个输出流之间传输内容。 提供了内核级服务，其适于执行特定于应用程序的处理，并且其涉及将内容从至少一个输入流传输到至少一个输出流。 利用内核级服务，通过执行特定于应用的处理来执行至少一个输入流和至少一个输出流的收集的操作; 并且考虑将内容从至少一个输入流传输到至少一个输出流。

公开(公告)号：US20050108298A1

公开(公告)日：2005-05-19

申请号：US10715237

申请日：2003-11-17

申请人： Arun Iyengar ,  Richard King ,  Lakshmish Ramaswamy ,  Daniela Rosu ,  Karen Witting

发明人： Arun Iyengar ,  Richard King ,  Lakshmish Ramaswamy ,  Daniela Rosu ,  Karen Witting

IPC分类号： G06F17/30

CPC分类号： G06F17/30215 ,  Y10S707/99932 ,  Y10S707/99952

摘要： A system and method for maintaining consistency in a system where multiple copies of an object may exist is provided for maintaining consistent copies. Consistency is maintained using a plurality of consistency policies in which at least one consistency policy results in different performance than a second consistency policy. A consistency policy is selected from the plurality consistency policies for each object to improve system performance.

摘要翻译： 提供用于维持一个对象的多个副本可能存在的系统中的一致性的系统和方法，用于维持一致的副本。 使用多个一致性策略维护一致性，其中至少一个一致性策略导致与第二一致性策略不同的性能。 从每个对象的多个一致性策略中选择一致性策略以提高系统性能。

公开(公告)号：US20050108191A1

公开(公告)日：2005-05-19

申请号：US10715260

申请日：2003-11-17

申请人： Arun Iyengar ,  Richard King ,  Daniela Rosu ,  Karen Witting

发明人： Arun Iyengar ,  Richard King ,  Daniela Rosu ,  Karen Witting

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30902 ,  Y10S707/955 ,  Y10S707/99953 ,  Y10S707/99954

摘要： In a system having a plurality of caches, a method for maintaining cached objects includes storing an object in a plurality of caches. In response to a request to update the object, a future invalidation time is determined when the object should be invalidated in caches currently storing the object. Updating of the object is delayed until the invalidation time has passed.

摘要翻译： 在具有多个高速缓存的系统中，用于维护高速缓存对象的方法包括将对象存储在多个高速缓存中。 响应于更新对象的请求，当对象应该在当前存储对象的高速缓存中被禁用时，确定将来的无效时间。 对象的更新被延迟，直到失效时间过去。

公开(公告)号：US06553411B1

公开(公告)日：2003-04-22

申请号：US09313409

申请日：1999-05-18

申请人： Daniel M. Dias ,  Arun K. Iyengar ,  Daniela Rosu ,  Renu Tewari

发明人： Daniel M. Dias ,  Arun K. Iyengar ,  Daniela Rosu ,  Renu Tewari

IPC分类号： G06F1516

CPC分类号： H04L29/06 ,  H04L67/2814 ,  H04L67/2852 ,  H04L67/2885 ,  H04L69/329

摘要： A method, which may be implemented by a program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for satisfying requests between a client and a server including the steps of providing a first entity with a directory of information about contents of a cache of a second entity, the first entity for receiving a request from a client, determining whether the directory of information indicates that the request is satisfied by the cache of the second entity by querying the directory of information on the first entity, sending the request to the second entity, if the directory indicates that the request is satisfied by the cache of the second entity, and otherwise, sending the request to be satisfied by another entity. A system is also included.

摘要翻译： 可以由机器可读的程序存储设备实现的方法，其有形地体现由机器执行的指令程序，以执行用于满足客户端与服务器之间的请求的方法步骤，包括以下步骤：向第一实体提供目录 关于第二实体的缓存的内容的信息，用于从客户端接收请求的第一实体，通过查询第二实体的信息目录来确定信息目录是否指示该请求被第二实体的高速缓存所满足 第一实体向第二实体发送请求，如果目录指示该请求被第二实体的高速缓存满足，否则发送另一个实体要满足的请求。 还包括一个系统。

公开(公告)号：US06490612B1

公开(公告)日：2002-12-03

申请号：US09564564

申请日：2000-05-04

申请人： Michael B. Jones ,  Richard P. Draves, Jr. ,  Daniela Rosu ,  Marcel-Catalin Rosu

发明人： Michael B. Jones ,  Richard P. Draves, Jr. ,  Daniela Rosu ,  Marcel-Catalin Rosu

IPC分类号： G06F15173

CPC分类号： G06F9/4887

摘要： The present invention provides predictable scheduling of programs using a repeating precomputed schedule. In a preferred embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. The scheduler first selects a current node within the accessed scheduling graph. When the processor becomes available to execute threads, the scheduler advances from the current node to a new current node in accordance with a root-to-leaf traversal of the scheduling graph. After advancing to the new current node, the scheduler executes one or more threads of the activity to which the new current node is dedicated for the execution interval length associated with the new current node. In a further preferred embodiment, the scheduler allocates specific iterations through specific nodes to satisfy the constraints submitted by threads.

摘要翻译： 本发明使用重复的预先计算的进度来提供程序的可预测的调度。 在优选实施例中，调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成，并且具有一个根，一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上，并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量，该节点 是在。 每个节点与其相关联的执行间隔长度，并且适于专用于执行单个活动的线程。 调度器首先选择所访问的调度图中的当前节点。 当处理器可用于执行线程时，调度器将根据调度图的根到叶遍历从当前节点前进到新的当前节点。 在进入新的当前节点之后，调度器执行新的当前节点专用于与新的当前节点相关联的执行间隔长度的活动的一个或多个线程。 在另一优选实施例中，调度器通过特定节点分配特定迭代以满足线程提交的约束。