-
1.发明授权Method for synchronizing use of dual and solo locking for two competing processors responsive to membership changes 失效同时使用响应于会员资格变更的两个竞争性处理器的双重和单独锁定的方法
公开(公告)号：US6105099A
公开(公告)日：2000-08-15
申请号：US203102
申请日：1998-11-30
申请人： Richard Francis Freitas , Divyesh Jadav , Deepak Kenchammana-Hosekote , Jaishankar Moothedath Menon , Hovey Raymond Strong, Jr.
发明人： Richard Francis Freitas , Divyesh Jadav , Deepak Kenchammana-Hosekote , Jaishankar Moothedath Menon , Hovey Raymond Strong, Jr.
CPC分类号： G06F9/52
摘要： To satisfy host requests, two competing processors self-manage access to a shared resource. Each processor maintains a lock table listing that processor's access state regarding the shared resource. Each processor repeatedly sends the other processor a state announcement message representing the processor's state. These include birth cry, heartbeat, or death knell messages. Whenever certain join-entry conditions apply to a processor, the processor performs a JOIN operation to evaluate and attempt to synchronize its lock table with the other processor's lock table. If data is needed from the other processor's lock table, the processor changes its state announcement message to birth cry. If the processor successfully synchronizes its lock table with the other processor, the JOIN operation dictates DUAL mode for that processor. If the synchronization attempt fails, SOLO results. When JOIN completes, the processor operates in its chosen mode. In DUAL, the processor's state announcement message is heartbeat, signifying healthy operation. In DUAL, the processors cooperatively establish temporary single-processor locks on the shared resource to satisfy host requests. In SOLO, a processor sets its state announcement message to death knell, advising the other processor not to access the shared resource. Also in SOLO, the processor attempts to "acquire" the shared resource by storing a predetermined identifier thereon. In SOLO, a processor refrains from accessing the shared resource unless it has acquired it.
摘要翻译： 为了满足主机请求，两个竞争的处理器自我管理对共享资源的访问。 每个处理器维护一个锁表，列出处理器关于共享资源的访问状态。 每个处理器重复地向其他处理器发送表示处理器状态的状态通知消息。 这些包括出生哭泣，心跳或死亡消息。 每当某个加入条件适用于处理器时，处理器执行JOIN操作来评估并尝试将其锁定表与其他处理器的锁定表同步。 如果需要其他处理器的锁定表的数据，处理器将其状态通知消息改变为出生哭泣。 如果处理器将其锁定表与其他处理器成功同步，则JOIN操作将指定该处理器的DUAL模式。 如果同步尝试失败，SOLO结果。 当JOIN完成时，处理器以其所选模式运行。 在DUAL中，处理器的状态通知信号是心跳，意味着健康运行。 在DUAL中，处理器在共享资源上协作建立临时单处理器锁以满足主机请求。 在SOLO中，处理器将其状态通知消息设置为死机，建议另一个处理器不要访问共享资源。 同样在SOLO中，处理器尝试通过在其上存储预定的标识符来“获取”共享资源。 在SOLO中，处理器除非已获取共享资源，否则不会访问共享资源。
-
公开(公告)号：US06401110B1
公开(公告)日：2002-06-04
申请号：US09203101
申请日：1998-11-30
申请人： Richard Francis Freitas , Divyesh Jadav , Deepak Kenchammana-Hosekote , Jaishankar Moothedath Menon , Hovey Raymond Strong, Jr.
发明人： Richard Francis Freitas , Divyesh Jadav , Deepak Kenchammana-Hosekote , Jaishankar Moothedath Menon , Hovey Raymond Strong, Jr.
IPC分类号： G06F900
CPC分类号： G06F9/526 , G06F2209/522
摘要： Multiple competing processors cooperatively manage access to a shared resource. Each processor separately stores a lock table, listing shared resource subparts, such as memory addresses of a data storage device, for example. The lock tables are stored in nonvolatile storage. In each lock table, each subpart is associated with a “state,” such as; LOCAL or REMOTE. In response to access requests from the hosts, the processors exchange various messages to cooperatively elect a single processor to have exclusive access to the subparts involved in the access requests. After one processor is elected, the lock-holding processor configures its lock table to show the identified subpart in the LOCAL state, and all non-lock-holding processors configure their lock tables to show the identified subpart in the REMOTE state. Thus, rather than replicating one lock table for all processors, the processors separately maintain lock tables that are coordinated with each other. Importantly, each processor honors its lock table by refraining from accessing a subpart of the shared resource unless the processor's lock table indicates a LOCAL state for that subpart. In one embodiment, optimized for the two processor environment, the messages exchanged by the processors include lock request, lock release, and lock grant messages.
摘要翻译： 多个竞争处理器协同地管理对共享资源的访问。 每个处理器分别存储锁表，列出例如数据存储设备的共享资源子部分，例如存储器地址。 锁表存储在非易失性存储器中。 在每个锁表中，每个子部分与“状态”相关联，如 LOCAL或REMOTE。 响应于来自主机的访问请求，处理器交换各种消息以协作地选择单个处理器以具有对访问请求中涉及的子部分的独占访问。 在选择一个处理器之后，锁定保持处理器配置其锁定表以在LOCAL状态下显示所识别的子部件，并且所有非锁定保持处理器都配置其锁定表以显示REMOTE状态中标识的子部件。 因此，处理器不是为所有处理器复制一个锁定表，而是分别维护彼此协调的锁定表。 重要的是，每个处理器通过禁止访问共享资源的子部分来履行其锁定表，除非处理器的锁表指示该子部分的LOCAL状态。 在针对两个处理器环境进行了优化的一个实施例中，由处理器交换的消息包括锁定请求，锁定释放和锁定授权消息。
-
公开(公告)号：US07480859B2
公开(公告)日：2009-01-20
申请号：US11243123
申请日：2005-10-04
IPC分类号： G06N3/00
CPC分类号： G06F17/227 , G06F17/2247
摘要： Transforming a user-supplied DTD satisfying a first XML grammar into a PDTD satisfying a second XML grammar, including converting DTD declarations of alternate content to sequences, converting DTD declarations of optional content to mandatory content, converting DTD declarations of imbedded sequences to subsequences, and demoting attribute definitions of DTD elements having attributes to children of the DTD elements having attributes. Embodiments include converting recursions into repetitions, demoting imbedded compound repetitions from element declarations having imbedded compound repetitions, and demoting imbedded leaves from elements having imbedded leaves.
摘要翻译： 将满足第一XML语法的用户提供的DTD转换为满足第二XML语法的PDTD，包括将替代内容的DTD声明转换为序列，将可选内容的DTD声明转换为强制内容，将嵌入式序列的DTD声明转换为子序列，以及 将具有属性的DTD元素的属性定义降级为具有属性的DTD元素的子元素。 实施例包括将递归转换为重复，从嵌入复合重复的元素声明降级嵌入的复合重复，以及从嵌入叶片的元素降级嵌入的叶。
-
公开(公告)号：US08572553B2
公开(公告)日：2013-10-29
申请号：US13158352
申请日：2011-06-10
申请人： Anca Andreea Chandra , Benjamin Gordon Shaw , Hovey Raymond Strong, Jr. , Jakita Nicole Owensby Thomas
发明人： Anca Andreea Chandra , Benjamin Gordon Shaw , Hovey Raymond Strong, Jr. , Jakita Nicole Owensby Thomas
IPC分类号： G06F9/44
摘要： Systems and methods for transforming applications to provide uniform mechanisms for commenting on application objects, and mechanisms for collecting and processing feedback are described herein. An aspect provides for analyzing application code for at least one user action event handler associated with at least one object; and for modifying each at least one user action event handler located within the application code to contain at least one action configured to handle feedback for the associated at least one object; wherein invoking the at least one user action event handler triggers the at least one action configured to handle feedback. Other embodiments and aspects are also described herein.
摘要翻译： 本文描述了用于转换应用以提供用于评估应用对象的统一机制的系统和方法，以及用于收集和处理反馈的机制。 一个方面提供用于分析与至少一个对象相关联的至少一个用户动作事件处理程序的应用程序代码; 并且用于修改位于所述应用代码内的每个至少一个用户动作事件处理器，以包含被配置为处理所述相关联的至少一个对象的反馈的至少一个动作; 其中调用所述至少一个用户动作事件处理程序触发被配置为处理反馈的所述至少一个动作。 本文还描述了其它实施例和方面。
-
公开(公告)号：US08549113B2
公开(公告)日：2013-10-01
申请号：US13015282
申请日：2011-01-27
IPC分类号： G06F15/16
CPC分类号： G06F9/4856
摘要： A computer program product, including a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for moving data stored on a transactional semantic independent persister in a distributed environment. The operations include: receiving an indicator to move data stored by the persister at a first node of the distributed environment to a second node of the distributed environment, wherein the data corresponds to a source; and cloning the persister at the first node to a cloned persister at the second node in response to receiving the indicator, wherein the cloning includes: moving data stored by the persister at the first node to the cloned persister; and moving remaining data in a data stream between the source and the persister at the first node to the cloned persister.
摘要翻译： 一种计算机程序产品，包括用于存储计算机可读程序的计算机可读存储介质，其中所述计算机可读程序在由计算机内的处理器执行时使得所述计算机执行用于移动存储在事务语义独立的存储器上的数据的操作 分布式环境。 操作包括：接收指示符，将由分支环境的第一节点处的持久存储器存储的数据移动到分布式环境的第二节点，其中数据对应于源; 以及响应于接收到所述指示符，将所述第一节点处的所述持久性克隆到所述第二节点处的克隆的持续器，其中所述克隆包括：将所述第一节点处的所述持续器存储的数据移动到所述克隆的持续器; 以及将数据流中的剩余数据移动到第一节点处的源和持续器之间的克隆持续器。
-
公开(公告)号：US07076729B2
公开(公告)日：2006-07-11
申请号：US10142616
申请日：2002-05-09
IPC分类号： G06F15/00
CPC分类号： G06F8/34
摘要： Graphical specification of an XML to XML transformation rule, including receiving a user's selection of a user-selected, optionally ambiguous, target leaf node, from a target tree of an initial target context, the target leaf node representing a target XML element to be mapped by the transformation rule; if the target leaf node is ambiguous, disambiguating the target leaf node; and adding the target leaf node to the transformation rule. Embodiments typically include receiving a user's selection of at least one user-selected, optionally ambiguous, source leaf node, from a source tree of an initial source context, wherein the source leaf node represents a source XML element to be mapped to the target leaf node by the transformation rule; if the source leaf node is ambiguous, disambiguating the source leaf node; and adding the user-selected source leaf node to the transformation rule.
-
公开(公告)号：US07069504B2
公开(公告)日：2006-06-27
申请号：US10246991
申请日：2002-09-19
IPC分类号： G06F3/00
CPC分类号： G06F17/3092
摘要： Transforming a source XML document satisfying a source DTD into a target XML document satisfying a target DTD, transforming the source XML document into a source document tree, where the source XML document satisfies a first XML grammar and the source document tree satisfies a second XML grammar; converting the source document tree into a target document tree satisfying the second XML grammar; and transforming the target document tree into the target XML document, wherein the target XML document satisfies the first XML grammar.
摘要翻译： 将满足源DTD的源XML文档转换为满足目标DTD的目标XML文档，将源XML文档转换为源文档树，其中源XML文档满足第一XML语法，源文档树满足第二XML语法 ; 将源文档树转换成满足第二XML语法的目标文档树; 并将目标文档树转换成目标XML文档，其中目标XML文档满足第一XML语法。
-
公开(公告)号：US09292601B2
公开(公告)日：2016-03-22
申请号：US11971673
申请日：2008-01-09
CPC分类号： G06F17/30719
摘要： A method of summarizing a document includes a step of extracting one or more sections of the document. The method also includes a step of separating at least one of the one or more extracted sections into one or more subsections based at least in part on a conjunctive structure of the section, wherein each subsection comprises one or more terms. The method also includes steps of determining whether one or more terms within a designated set of terms are present within at least one of the one or more subsections and, responsive to a determination that one or more terms within the designated set of terms are present within at least one of the one or more subsections, removing the one or more terms from the one or more subsections. The method also includes a step of aggregating at least a portion of the one or more sections into a summary of the document.
摘要翻译： 总结文档的方法包括提取文档的一个或多个部分的步骤。 该方法还包括至少部分地基于该部分的连接结构将一个或多个提取部分中的至少一个分离成一个或多个子部分的步骤，其中每个子部分包括一个或多个术语。 所述方法还包括以下步骤：确定所指定的一组术语中的一个或多个术语是否存在于所述一个或多个子部分的至少一个部分内，以及响应于确定所述指定术语集合内的一个或多个术语存在于 所述一个或多个子部分中的至少一个，从所述一个或多个子部分移除所述一个或多个条款。 该方法还包括将该一个或多个部分的至少一部分聚集成文档的摘要的步骤。
-
公开(公告)号：US09046914B2
公开(公告)日：2015-06-02
申请号：US13293182
申请日：2011-11-10
CPC分类号： G06F8/00 , G06F17/30342
摘要： Embodiments of the invention relate to reducing memory required to store an array of formulas and values corresponding to a formula-array. A set of formula-array representations is provided and arranged in a successive order. Each formula-array representation is evaluated for an associated memory requirement to support use thereof, followed by conversion to a structure of the formula-array representation at a successive level. Selection of the formula-array representation is determined based upon a minimal memory requirement from the formula-array representations in the order.
摘要翻译： 本发明的实施例涉及减少存储对应于公式数组的公式和值的阵列所需的存储器。 提供一组公式数组表示并按顺序排列。 对于相关联的存储器要求来评估每个公式数组表示以支持其使用，随后在连续的级别转换为公式数组表示的结构。 公式数组表示的选择基于从顺序的公式数组表示中的最小内存要求来确定。
-
10.发明授权Method and apparatus for accessing shared resources with asymmetric safety in a multiprocessing system 失效用于在多处理系统中访问具有不对称安全性的共享资源的方法和装置公开(公告)号：US06748438B2
公开(公告)日：2004-06-08
申请号：US08971276
申请日：1997-11-17
IPC分类号： G06F1516
CPC分类号： H04L67/10
摘要： In a multiprocessing system, access to a shared resource is arbitrated among multiple computing nodes. The shared resources has a membership view resulting from a predetermined membership protocol performed by the shared resource and the computing nodes. Preferably, this membership protocol includes a termination condition guaranteeing asymmetric safety among all members of the multiprocessing system. The shared resource arbitrates access to itself by fencing computing nodes outside shared resource's membership view. In one embodiment, the shared resource may comprise a data storage facility, such as a disk drive. Illustratively, computation of the shared resource's membership view may employ a procedure where each computing node subscribes to the resource during prescribed membership intervals.
摘要翻译： 在多处理系统中，在多个计算节点之间仲裁对共享资源的访问。 共享资源具有由共享资源和计算节点执行的预定成员协议产生的成员关系视图。 优选地，该会员协议包括保证多处理系统的所有成员之间的非对称安全性的终止条件。 共享资源通过围绕共享资源成员资格视图外的计算节点来仲裁对其自身的访问。 在一个实施例中，共享资源可以包括诸如磁盘驱动器的数据存储设施。 说明性地，共享资源的成员关系视图的计算可以采用其中每个计算节点在规定的成员关系间隔期间预订资源的过程。
-
-
-
-
-
-
-
-
-
搜索结果
24 条记录 (耗时 0.026 秒)
