会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Expressing fault correlation constraints
    • 表示故障相关约束
    • US07996719B2
    • 2011-08-09
    • US12258158
    • 2008-10-24
    • Jose Bernabeu-AubanYousef A. Khalidi
    • Jose Bernabeu-AubanYousef A. Khalidi
    • G06F11/00
    • G06F11/008
    • Methods, systems, and computer-readable media for expressing fault correlation constrains to a developer of a service application are provided. Initially, the fault correlation constraints are identified by inspecting an architecture of resources comprising a data center. Based on the resources, sets of nodes that become concurrently unavailable due to a failure mode or update scheme are aggregated. These fault correlation constraints, upon being communicated to the developer, then may be incorporated into a service model produced thereby. Accordingly, the service model is tailored to the specific characteristics of the data center and is provided with instructions as to how to partition instances of the service application throughout the distributed resources of the data center. Thus, the fault correlation constraints provide a developer with insight into rules and structures on which the data center is constructed and assurances of a certain level of fault tolerance upon deploying the service application.
    • 提供了用于向服务应用程序的开发人员表示故障相关约束的方法,系统和计算机可读介质。 最初,通过检查包括数据中心的资源的架构来识别故障相关约束。 基于资源,聚合了由于故障模式或更新方案而变得并发不可用的节点集合。 这些故障相关性约束在传达给开发者之后可以被并入由其产生的服务模型中。 因此,服务模型是针对数据中心的具体特性量身定制的,并提供有关如何在数据中心的整个分布式资源中划分业务应用实例的指令。 因此,故障相关约束为开发人员提供了构建数据中心的规则和结构的洞察力,并在部署服务应用程序时保证了一定级别的容错能力。
    • 4. 发明授权
    • Providing functionality to client services by implementing and binding contracts
    • 通过实施和约束合同为客户服务提供功能
    • US07904508B2
    • 2011-03-08
    • US12258149
    • 2008-10-24
    • Jose Bernabeu-AubanYousef A. Khalidi
    • Jose Bernabeu-AubanYousef A. Khalidi
    • G06F15/16G06F15/177
    • G06F9/50
    • Methods, systems, and computer-readable media for automating the expression of functional aspects of a target service to a client service via a vehicle referred to herein as a contract are provided. Generally, the methods are performed in the context of a distributed computing environment configured to underlie operations of service application(s). In embodiments, the contract is implemented and bound upon ascertaining that the expressed functional aspects satisfy dependencies of the client service. Generally, the contract defines interfaces and maintains properties that configure the interfaces during installation. During the implementation, one of the interfaces is established and parameterized in accordance with the properties associated therewith. During the binding, the target service and the client service are linked via communication channels that are routed through the established interface. Accordingly, calls from the client service over the communication channels allow for reaching and employing the functional aspects of the target service.
    • 提供了用于使通过本文中称为合同的车辆将客户服务的目标服务的功能方面表达自动化的方法,系统和计算机可读介质。 通常,这些方法是在分布式计算环境的上下文中执行的,该分布式计算环境被配置为支持服务应用程序的操作。 在实施例中,通过确定表达的功能方面满足客户服务的依赖性来实现和约束合同。 通常,合同定义接口并维护在安装期间配置接口的属性。 在实现期间,根据与其相关联的属性,建立和参数化一个接口。 在绑定期间,目标服务和客户端服务通过经建立的接口路由的通信信道进行链接。 因此,通过通信信道来自客户端服务的呼叫允许达到和应用目标服务的功能方面。
    • 7. 发明授权
    • Method and apparatus for an efficient data transfer mechanism
    • 一种高效数据传输机制的方法和装置
    • US06405237B1
    • 2002-06-11
    • US08780790
    • 1997-01-09
    • Yousef A. KhalidiMoti N. Thadani
    • Yousef A. KhalidiMoti N. Thadani
    • G06F15163
    • G06F9/544
    • A method and apparatus are described that permit an application to control data transfer from a memory object of a source device to a sink device. The application can request that an operating system establish a mapping between a fast buffer and a memory object storing the data. The operating system then establishes the mapping between the fast buffer and the memory object thereby permitting the application to direct that the data of the memory object be transferred to the sink device. Thus, the sink device can use direct memory access to the source device to transfer the data from the memory object. Furthermore, if the application modifies a portion of the data of the memory object prior to directing the transfer, only the modified portion of the data is copied to main memory prior to transfer to the sink device.
    • 描述了允许应用程序控制从源设备的存储器对象到宿设备的数据传输的方法和装置。 应用程序可以请求操作系统建立快速缓冲区和存储数据的存储对象之间的映射。 然后,操作系统建立快速缓冲器和存储器对象之间的映射,从而允许应用程序将存储器对象的数据传送到宿设备。 因此,宿设备可以使用对源设备的直接存储器访问来从存储器对象传送数据。 此外,如果应用程序在指示传输之前修改存储器对象的一部分数据,则只有经修改的数据部分才能在传送到宿设备之前被复制到主存储器中。
    • 8. 发明授权
    • Method and apparatus for transparent server failover for highly available objects
    • 用于高可用性对象的透明服务器故障切换的方法和设备
    • US06185695B2
    • 2001-02-06
    • US09058406
    • 1998-04-09
    • Declan J. MurphyMadhusudhan TalluriVladimir MatenaYousef A. KhalidiJose M. Bernabeu-AubanAndrew G. Tucker
    • Declan J. MurphyMadhusudhan TalluriVladimir MatenaYousef A. KhalidiJose M. Bernabeu-AubanAndrew G. Tucker
    • G06F1107
    • G06F11/2097G06F11/2025G06F11/2028G06F11/2041G06F11/2046
    • One embodiment of the present invention provides a method and an apparatus that facilitates transparent failovers from a primary copy of an object on a first server to a secondary copy of the object on a second server when the first server fails, or otherwise becomes unresponsive. The method includes detecting the failure of the first server; selecting the second server; and reconfiguring the second server to act as a new primary server for the object. Additionally, the method includes transparently retrying uncompleted invocations to the object to the second server, without requiring explicit retry commands from a client application program. A variation on this embodiment further includes winding up active invocations to the object before reconfiguring the second server to act as the new primary server. This winding up process may include causing invocations to unresponsive nodes to unblock and complete. Another variation includes blocking new invocations to the object after detecting the failure of the first server, and unblocking these new invocations after reconfiguring the second server to act as the new primary server. Hence, the present invention can greatly simplify programming of client application programs for highly available systems. It also makes it possible to use a client application program written for a nonhighly available system in a highly available system.
    • 本发明的一个实施例提供了一种方法和装置,其在第一服务器发生故障时促进从第一服务器上的对象的主副本到第二服务器上的对象的副本的透明故障转移,或者否则变得不响应。 该方法包括检测第一服务器的故障; 选择第二台服务器; 并重新配置第二个服务器以充当该对象的新的主服务器。 此外,该方法包括将未完成的对该对象的调用透明地重试到第二个服务器,而不需要客户端应用程序的显式重试命令。 该实施例的变体还包括在重新配置第二服务器以充当新的主服务器之前将主动调用卷绕到对象。 这个清理过程可能包括导致对无响应节点的调用以解锁和完成。 另一个变体包括在检测到第一个服务器的故障之后阻止对对象的新的调用,并且在重新配置第二个服务器以充当新的主服务器之后解除这些新的调用。 因此,本发明可以极大地简化用于高可用性系统的客户端应用程序的编程。 它还可以在高可用性系统中使用为非高可用系统编写的客户端应用程序。
    • 9. 发明授权
    • Memory efficient directory coherency maintenance
    • 内存高效的目录一致性维护
    • US5860153A
    • 1999-01-12
    • US562177
    • 1995-11-22
    • Vladimir MatenaJose M. Bernabeu-AubanYousef A. KhalidiKenneth W. ShirriffMoti N. Thadani
    • Vladimir MatenaJose M. Bernabeu-AubanYousef A. KhalidiKenneth W. ShirriffMoti N. Thadani
    • G06F12/08H04L29/12G06F13/00G06F15/16
    • H04L61/00G06F12/0817H04L29/12009
    • A bit map is maintained by a provider object of a name server to keep track of names cached by a cache object of the client. The bit map is indexed by performing a hash of the name. When a name is looked up by the server on behalf of a client, the server hashes the name, and sets the bit in the bit map indexed by the result of the hash modulo the size of the bit map. The result of the hash is returned to the client and is stored with the entry in the cache. A bit "set" in the bit map indicates that the client caches at least one name that hashes into the bit. When the server invalidates a name, a hash of the name to be invalidated is used to find the corresponding bit in the bit mask. If the bit is set, the server sends an invalidation request to the client. The invalidation request includes the result of the hash, and the size of the provider's bit map. The client invalidates all entries that hash into the specified bit in the bitmap on the server. Alternatively, the invalidation request also includes the name to be invalidated and the client invalidates only the entry that matches the name.
    • 位图由名称服务器的提供程序对象维护,以跟踪由客户机的缓存对象缓存的名称。 通过执行名称的哈希来对位图进行索引。 当代表客户端查询服务器的名称时,服务器将哈希名称,并将由映射结果索引的位图中的位设置为模数位图的大小。 哈希的结果返回到客户端,并将该条目存储在缓存中。 位图中的位“位”表示客户端将至少一个散列的名称缓存到该位中。 当服务器使名称失效时,将使用要使无效名称的散列来查找位掩码中的相应位。 如果该位置位,则服务器向客户端发送无效请求。 无效请求包括哈希的结果和提供者的位图的大小。 客户端会将所有散列到服务器位图中指定位的条目无效。 或者,无效请求还包括要被无效的名称,并且客户端仅使与匹配该名称的条目无效。
    • 10. 发明授权
    • Extensible file system which layers a new file system with an old file
system to provide coherent file data
    • 可扩展文件系统,用新的文件系统对新的文件系统进行分层,以提供一致的文件数据
    • US5561799A
    • 1996-10-01
    • US584878
    • 1996-01-11
    • Yousef A. KhalidiMichael N. Nelson
    • Yousef A. KhalidiMichael N. Nelson
    • G06F12/00G06F17/30
    • G06F17/30067Y10S707/966
    • In this disclosure an architecture for extensible file systems is described. Also disclosed is an implementation of the architecture. The architecture enables the extension of file system functionality by stacking (or composing) new file systems (layers) on top of existing file systems. The implementor of a new layer has the option of keeping the files exported by the new layer coherent with files of the underlying layer, as well as the option of sharing the same cached memory with the files of the underlying layer. A flexible framework is also disclosed for arranging the file systems' name spaces. Composing of new layers on top of existing ones can be done statically (at compile/configuration time) or dynamically (at boot/run time). In addition, the file system layers can reside in the same address space or in different address spaces, and be implemented on a local computer node or on a remote computer node.
    • 在本公开中描述了用于可扩展文件系统的架构。 还公开了该架构的实现。 该架构通过在现有文件系统之上堆叠(或组合)新的文件系统(层)来实现文件系统功能的扩展。 新层的实现者可以选择保留新层导出的文件与底层文件的一致性,以及与底层文件共享相同的缓存内存的选项。 还公开了一种用于布置文件系统名称空间的灵活框架。 可以静态地(在编译/配置时)或动态地(在引导/运行时)完成新层上的构建。 此外,文件系统层可以驻留在相同的地址空间或不同的地址空间中,并且可以在本地计算机节点或远程计算机节点上实现。