Resource manager architecture
    1.
    发明授权
    Resource manager architecture 有权
    资源管理器架构

    公开(公告)号:US07337446B2

    公开(公告)日:2008-02-26

    申请号:US10931058

    申请日:2004-08-31

    IPC分类号: G06F9/46 G06F15/16

    摘要: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity. Each resource consumer can specify one or more configurations for each activity. If multiple configurations are specified, the resource consumer can rank them according to preference. This allows the resource consumers to be dynamically changed from one configuration to another as operating conditions change.

    摘要翻译: 描述了在计算机系统中实现的管理资源的资源管理架构。 在一个实施例中,一般架构包括资源管理器和支持一个或多个资源消费者(诸如系统组件或应用程序)的多个资源提供者。 当与资源管理器进行接口时,每个提供者都与资源相关联并充当该资源的管理器。 资源管理员代表消费者对资源提供者提供的资源的访问进行仲裁。 策略管理器设置资源管理器使用的各种策略来分配资源。 一个策略是一个基于优先级的策略,区分哪些应用程序和/或用户优先于其他应用程序和/或用户来使用资源。 资源消费者在资源管理器中创建“活动”,并构建一个或多个描述执行活动所需的各种首选资源集的“配置”。 每个资源消费者可以为每个活动指定一个或多个配置。 如果指定了多个配置,资源消费者可以根据喜好对其进行排名。 这允许在操作条件改变时资源消费者从一个配置动态地改变另一个配置。

    Resource manager architecture with dynamic resource allocation among multiple configurations
    2.
    发明授权
    Resource manager architecture with dynamic resource allocation among multiple configurations 有权
    资源管理器架构,具有多个配置之间的动态资源分配

    公开(公告)号:US07284244B1

    公开(公告)日:2007-10-16

    申请号:US09565284

    申请日:2000-05-02

    IPC分类号: G06F9/50 G06F9/44

    CPC分类号: G06F9/5027

    摘要: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity. Each resource consumer can specify one or more configurations for each activity. If multiple configurations are specified, the resource consumer can rank them according to preference. This allows the resource consumers to be dynamically changed from one configuration to another as operating conditions change.

    摘要翻译: 描述了在计算机系统中实现的管理资源的资源管理架构。 在一个实施例中,一般架构包括资源管理器和支持一个或多个资源消费者(诸如系统组件或应用程序)的多个资源提供者。 当与资源管理器进行接口时,每个提供者都与资源相关联并充当该资源的管理器。 资源管理员代表消费者对资源提供者提供的资源的访问进行仲裁。 策略管理器设置资源管理器使用的各种策略来分配资源。 一个策略是一个基于优先级的策略,区分哪些应用程序和/或用户优先于其他应用程序和/或用户来使用资源。 资源消费者在资源管理器中创建“活动”,并构建一个或多个描述执行活动所需的各种首选资源集的“配置”。 每个资源消费者可以为每个活动指定一个或多个配置。 如果指定了多个配置,资源消费者可以根据喜好对其进行排名。 这允许在操作条件改变时资源消费者从一个配置动态地改变另一个配置。

    Resource manager architecture
    4.
    发明授权
    Resource manager architecture 有权
    资源管理器架构

    公开(公告)号:US06799208B1

    公开(公告)日:2004-09-28

    申请号:US09563726

    申请日:2000-05-02

    IPC分类号: G06F1300

    摘要: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity. Each resource consumer can specify one or more configurations for each activity. If multiple configurations are specified, the resource consumer can rank them according to preference. This allows the resource consumers to be dynamically changed from one configuration to another as operating conditions change.

    摘要翻译: 描述了在计算机系统中实现的管理资源的资源管理架构。 在一个实施例中,一般架构包括资源管理器和支持一个或多个资源消费者(诸如系统组件或应用程序)的多个资源提供者。 当与资源管理器进行接口时,每个提供者都与资源相关联并充当该资源的管理器。 资源管理员代表消费者对资源提供者提供的资源的访问进行仲裁。 策略管理器设置资源管理器使用的各种策略来分配资源。 一个策略是一个基于优先级的策略,区分哪些应用程序和/或用户优先于其他应用程序和/或用户来使用资源。 资源消费者在资源管理器中创建“活动”,并构建一个或多个描述执行活动所需的各种首选资源集的“配置”。 每个资源消费者可以为每个活动指定一个或多个配置。 如果指定了多个配置,资源消费者可以根据喜好对其进行排名。 这允许在操作条件改变时资源消费者从一个配置动态地改变另一个配置。

    Resource manager architecture with resource allocation utilizing priority-based preemption
    5.
    发明授权
    Resource manager architecture with resource allocation utilizing priority-based preemption 有权
    资源管理器架构,资源分配利用基于优先级的抢占

    公开(公告)号:US07137119B1

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

    申请号:US09562936

    申请日:2000-05-02

    IPC分类号: G06F9/46

    CPC分类号: G06F9/5011

    摘要: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity. Each resource consumer can specify one or more configurations for each activity. If multiple configurations are specified, the resource consumer can rank them according to preference. This allows the resource consumers to be dynamically changed from one configuration to another as operating conditions change.

    摘要翻译: 描述了在计算机系统中实现的管理资源的资源管理架构。 在一个实施例中,一般架构包括资源管理器和支持一个或多个资源消费者(诸如系统组件或应用程序)的多个资源提供者。 当与资源管理器进行接口时,每个提供者都与资源相关联并充当该资源的管理器。 资源管理员代表消费者对资源提供者提供的资源的访问进行仲裁。 策略管理器设置资源管理器使用的各种策略来分配资源。 一个策略是一个基于优先级的策略,区分哪些应用程序和/或用户优先于其他应用程序和/或用户来使用资源。 资源消费者在资源管理器中创建“活动”,并构建一个或多个描述执行活动所需的各种首选资源集的“配置”。 每个资源消费者可以为每个活动指定一个或多个配置。 如果指定了多个配置,资源消费者可以根据喜好对其进行排名。 这允许在操作条件改变时资源消费者从一个配置动态地改变另一个配置。

    Smart Card File System
    6.
    发明申请
    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
    9.
    发明授权
    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.

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

    Providing predictable scheduling of programs using a repeating precomputed schedule
    10.
    发明授权
    Providing predictable scheduling of programs using a repeating precomputed schedule 失效
    使用重复的预先计算的计划提供可预测的程序调度

    公开(公告)号:US06317774B1

    公开(公告)日:2001-11-13

    申请号:US08781106

    申请日:1997-01-09

    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.

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