公开(公告)号：US06788672B1

公开(公告)日：2004-09-07

申请号：US08842591

申请日：1997-04-15

申请人： Cagatay Buyukkoc ,  Michael B. Jones ,  David Hilton Shur

发明人： Cagatay Buyukkoc ,  Michael B. Jones ,  David Hilton Shur

IPC分类号： H04L1256

CPC分类号： H04M3/5307 ,  H04L29/06 ,  H04M7/006 ,  H04M7/12 ,  H04M2201/60

摘要： A method and apparatus for telephony messaging based on a network of packet telephony messaging (PTM) servers. A message is received at an originating PTM server from an originator for delivery to a target device for a recipient. The message is stored at the originating PTM server. The message is routed from the originating PTM server (possibly via a second and subsequent PTM servers) over a first network to a destination PTM server located near the target device. The recipient is notified of the message by the destination PTM server. The message is delivered to the target device from the second PTM server over a second network in response to a request by the recipient.

摘要翻译： 一种基于分组电话消息（PTM）服务器网络的电话消息收发的方法和装置。 在始发PTM服务器处从发送方接收到用于传送到用于接收者的目标设备的消息。 消息存储在始发PTM服务器。 消息从始发PTM服务器（可能经由第二和后续PTM服务器）通过第一网络路由到位于目标设备附近的目的地PTM服务器。 收件人被目的地PTM服务器通知该消息。 响应于接收者的请求，该消息通过第二网络从第二PTM服务器传送到目标设备。

公开(公告)号：US20100240413A1

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

申请号：US12408697

申请日：2009-03-21

申请人： Jialin He ,  Michael B. Jones ,  Arun K. Nanda

发明人： Jialin He ,  Michael B. Jones ,  Arun K. Nanda

IPC分类号： H04M1/00 ,  G06F13/00 ,  G06F17/30 ,  G06F9/54 ,  G06F12/00

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响应，并将响应转换成高级文件命令。 高级文件命令可以允许使用长文件名，分层目录结构访问文件，并且可以允许创建，写入，读取和删除文件。 一些实施例可以具有用于导航和操纵分层目录结构的更复杂的功能，以及将包括访问特权和文件类型的元数据定义到单个文件。

公开(公告)号：US07694300B2

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

申请号：US11118684

申请日：2005-04-29

申请人： Galen C. Hunt ,  James R. Larus ,  John D. DeTreville ,  Michael B. Jones ,  Trishul A. Chilimbi

发明人： Galen C. Hunt ,  James R. Larus ,  John D. DeTreville ,  Michael B. Jones ,  Trishul A. Chilimbi

IPC分类号： G06F9/46

CPC分类号： G06F21/562 ,  G06F21/566 ,  G06F21/57

摘要： Described herein is an implementation of a technology for the construction, identification, and/or optimization of operating-system processes. At least one implementation, described herein, constructs an operating-system process having the contents as defined by a process manifest. Once constructed, the operating-system process is unalterable.

摘要翻译： 这里描述了用于构建，识别和/或优化操作系统过程的技术的实现。 这里描述的至少一个实现构造具有由过程清单定义的内容的操作系统过程。 一旦构建，操作系统过程是不可改变的。

公开(公告)号：US07171669B2

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

申请号：US10841092

申请日：2004-05-07

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

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.

公开(公告)号：US07162720B2

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

申请号：US10842213

申请日：2004-05-10

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

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.

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

公开(公告)号：US06799208B1

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

申请号：US09563726

申请日：2000-05-02

申请人： Mukund Sankaranarayan ,  Forrest C. Foltz ,  George Shaw ,  Dale A. Sather ,  Andy R. Raffman ,  Jai Srinivasan ,  Terje K. Backman ,  William G. Parry ,  David S. Bakin ,  Michael B. Jones ,  Sean C. McDowell ,  Jayachandran Raja ,  Robin Speed

发明人： Mukund Sankaranarayan ,  Forrest C. Foltz ,  George Shaw ,  Dale A. Sather ,  Andy R. Raffman ,  Jai Srinivasan ,  Terje K. Backman ,  William G. Parry ,  David S. Bakin ,  Michael B. Jones ,  Sean C. McDowell ,  Jayachandran Raja ,  Robin Speed

IPC分类号： G06F1300

CPC分类号： G06F9/50 ,  G06F9/526 ,  G06F2209/5014 ,  G06F2209/522 ,  H04N21/4424 ,  H04N21/443

摘要： 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.

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

公开(公告)号：US06317774B1

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

申请号：US08781106

申请日：1997-01-09

申请人： 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.

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

公开(公告)号：US5473362A

公开(公告)日：1995-12-05

申请号：US159188

申请日：1993-11-30

申请人： Robert P. Fitzgerald ,  Joseph S. Barrera, III ,  William J. Bolosky ,  Richard P. Draves, Jr. ,  Michael B. Jones ,  Steven P. Levi ,  Nathan P. Myhrvold ,  Richard F. Rashid ,  Garth A. Gibson

发明人： Robert P. Fitzgerald ,  Joseph S. Barrera, III ,  William J. Bolosky ,  Richard P. Draves, Jr. ,  Michael B. Jones ,  Steven P. Levi ,  Nathan P. Myhrvold ,  Richard F. Rashid ,  Garth A. Gibson

IPC分类号： H04N5/907 ,  H04H20/76 ,  H04N7/173 ,  H04N21/472

CPC分类号： H04N21/47202 ,  H04N7/17318 ,  H04N7/17336

摘要： A scalable method and system for easily scheduling data transfer for a video-on-demand server system is provided. A strategy for locating available bandwidth and allocating available bandwidth to subscribers as needed is provided. The input/output bandwidth of storage devices that store data for video image sequences is modelled as a series of bandwidth units. Each bandwidth unit has sufficient capacity to service an individual subscriber during a scheduling cycle. Video image sequences or other data sequences are striped across storage devices such that data for a data sequence is forwarded to the subscriber by reading from a sequence of storage devices in consecutive time frames.

摘要翻译： 提供了一种用于轻松调度视频点播服务器系统的数据传输的可扩展方法和系统。 提供了一种用于定位可用带宽并根据需要为订户分配可用带宽的策略。 存储视频图像序列数据的存储设备的输入/输出带宽被建模为一系列带宽单位。 每个带宽单元在调度周期内具有足够的容量来服务单个用户。 视频图像序列或其他数据序列在存储设备之间被条带化，使得通过在连续的时间帧中从一系列存储设备读取来将数据序列的数据转发给用户。

公开(公告)号：US08443755B2

公开(公告)日：2013-05-21

申请号：US12595898

申请日：2008-04-03

申请人： Michael B. Jones

发明人： Michael B. Jones

IPC分类号： B05B9/03 ,  B05C11/10

CPC分类号： B05B9/0426 ,  B05B9/01 ,  B05B9/04 ,  B05B9/0861

摘要： A paint spraying system having a paint reservoir (16) remote from a spray gun (12) of the type which draws paint to the gun using vacuum (6, 7). A paint pump (14) delivers paint under positive pressure to the paint gun and a paint regulator (28) in or associated with the paint gun delivers the paint to the gun as drawn by vacuum by the gun through the regulator. An over-pressure relief valve (70) may be used to limit the positive pressure delivered by the pump. A mechanical switch may be used to select a SPRAY or CLEAN mode for the operation of the paint regulator to allow flushing of the paint regulator.

摘要翻译： 一种涂料喷涂系统，其具有远离喷枪（12）的油漆储存器（16），该喷枪将抽油漆（6,7）抽吸到喷枪上。 油漆泵（14）在油漆枪的正压力下输送涂料，并且与喷枪相关联的涂料调节器（28）将涂料通过喷枪通过调节器由真空抽出。 可以使用过压安全阀（70）来限制由泵输送的正压力。 可以使用机械开关来选择喷涂或清洁模式来进行油漆调节器的操作以允许油漆调节器的冲洗。

公开(公告)号：US07571438B2

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

申请号：US09909072

申请日：2001-07-18

申请人： Michael B. Jones ,  Paul J. Leach ,  Richard P. Draves, Jr. ,  Joseph S. Barrera, III

发明人： Michael B. Jones ,  Paul J. Leach ,  Richard P. Draves, Jr. ,  Joseph S. Barrera, III

IPC分类号： G06F9/46

CPC分类号： G06F9/5011 ,  G06F2209/5014

摘要： A resource management mechanism is provided to ensure that real-time application programs running on a single machine or set of machines exhibit predictable behavior. The resource management mechanism employs the abstraction of an activity which serves as the basis for granting resource reservations and for accounting. An activity submits a request for resources in specified amounts to a resource planner. The activity is resource self-aware so that it is aware of its resource requirements. The activity may query resource providers to obtain resource requirements for particular operations. The resource planner determines whether the activity should be granted the requested reservation by employing an internal policy. Policy is separated by mechanism so that the resource planner may implement any of a number of policies. The resource planner may choose to grant the reservation to an activity or deny the request by an activity. When denying a request, the resource planner may inform the activity of what quantity of the requested resources are currently available so that the activity may submit a modified request. The resource management mechanism includes a dynamic feedback mechanism for initiating renegotiation of resource reservations when appropriate.