Method for providing guaranteed distributed failure notification
    2.
    发明授权
    Method for providing guaranteed distributed failure notification 有权
    提供有保证的分布式故障通知的方法

    公开(公告)号:US07551552B2

    公开(公告)日:2009-06-23

    申请号:US10686658

    申请日:2003-10-17

    IPC分类号: H04J1/16

    摘要: A guaranteed distributed failure notification method is described, wherein a failure notification (FN) facility allows applications using the facility to create FN groups to which the application associates an application state. The application registers failure handlers with the FN facility on nodes in the FN group; each failure handler is associated with a specific FN group. When, on a given node, the FN facility learns of a failure in the FN group, the facility executes the associated failure handler on that node. System failures detected by the application are signaled to other FN group members using the facility. The facility detects system failures that occur in an overlay network on which the facility is implemented, and signals a failure notification to the other FN group members.

    摘要翻译: 描述了有保证的分布式故障通知方法,其中故障通知(FN)设施允许使用该设施的应用创建应用程序将应用程序状态与应用程序状态相关联的FN组。 应用程序在FN组中的节点上注册FN设备的故障处理程序; 每个故障处理程序与特定的FN组相关联。 当FN给定节点在FN组中发现故障时,设备将在该节点上执行关联的故障处理程序。 使用该设施向应用程序检测到的系统故障发信号通知其他FN组成员。 该设施检测在实施设施的覆盖网络中发生的系统故障,并向其他FN组成员发出故障通知。

    Method for multicasting a message on a computer network
    3.
    发明授权
    Method for multicasting a message on a computer network 有权
    在计算机网络上组播消息的方法

    公开(公告)号:US07620730B2

    公开(公告)日:2009-11-17

    申请号:US11487778

    申请日:2006-07-17

    IPC分类号: G06F15/173

    CPC分类号: G06F9/542 H04L12/18 H04L69/40

    摘要: A method for multicasting a message in a computer network is described, in which at least some nodes of a multicast group transmit fault recovery information to other nodes of the group in addition to, or as part of, the message itself. The fault recovery information allows nodes to determine what dissemination responsibility should be assigned to successor nodes in the event that one or more nodes of the multicast group fail.

    摘要翻译: 描述了在计算机网络中组播消息的方法,其中组播组的至少一些节点除了消息本身之外或作为消息本身的一部分,还将故障恢复信息发送到该组的其他节点。 故障恢复信息允许节点确定在多播组的一个或多个节点出现故障的情况下,哪些传播责任应分配给后继节点。

    Smart Card File System
    7.
    发明申请
    Smart Card File System 审中-公开
    智能卡文件系统

    公开(公告)号:US20100240413A1

    公开(公告)日:2010-09-23

    申请号:US12408697

    申请日:2009-03-21

    CPC分类号: G06F16/1847

    摘要: An application programming interface (API) may receive high level file commands and implement those commands using the storage mechanism on a smart card. The smart card may have a processor and storage mechanism and may communicate to a host device using a packet based communication protocol, such as ADPU. The API may translate the high level file commands into one or more ADPU commands, communicate with the smart card, receive APDU responses, and translate the responses into high level file commands. A high level file command may allow access to a file using long file names, a hierarchical directory structure, and may allow creating, writing, reading, and deleting a file. Some embodiments may have more complex functions for navigating and manipulating a hierarchical directory structure, as well as defining metadata including access privileges and file types to individual files.

    摘要翻译: 应用编程接口(API)可以接收高级文件命令,并使用智能卡上的存储机制来实现这些命令。 智能卡可以具有处理器和存储机制,并且可以使用诸如ADPU的基于分组的通信协议来与主机设备通信。 API可以将高级别文件命令转换成一个或多个ADPU命令,与智能卡通信,接收APDU响应,并将响应转换成高级文件命令。 高级文件命令可以允许使用长文件名,分层目录结构访问文件,并且可以允许创建,写入,读取和删除文件。 一些实施例可以具有用于导航和操纵分层目录结构的更复杂的功能,以及将包括访问特权和文件类型的元数据定义到单个文件。

    Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems

    公开(公告)号:US07171669B2

    公开(公告)日:2007-01-30

    申请号:US10841092

    申请日:2004-05-07

    IPC分类号: G06F9/00 G06F15/173

    CPC分类号: G06F9/4887

    摘要: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one 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. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

    Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems
    10.
    发明授权
    Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems 有权
    通过在离散计划和/或多处理器操作系统上重复预先计算的计划来提供可预测的程序调度

    公开(公告)号:US07162720B2

    公开(公告)日:2007-01-09

    申请号:US10842213

    申请日:2004-05-10

    IPC分类号: G06F9/00 G06F15/173

    CPC分类号: G06F9/4887

    摘要: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one 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. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

    摘要翻译: 本发明提供了使用在离散调度和/或多处理器操作系统上重复预先计算的调度的程序的可预测调度。 在一个实施例中,调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成,并且具有一个根,一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上,并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量,该节点 是在。 每个节点与其相关联的执行间隔长度,并且适于专用于执行单个活动的线程。 每个处理器可能有一个调度图,或调度图可以遍历多个处理器。 调整预约和约束的开始和结束时间以补偿系统时钟的粒度。 此外,调度器可以使用现有的基于优先级的调度器,以便使其作出的调度决定。