摘要:
Method and system of determining whether a user program has made a system level call and thus whether the user program is uncooperative with fault tolerant operation. Some exemplary embodiments may be a processor-based method comprising providing information from a first processor to a second processor (the information indicating that a user program executed on the first processor has not made a system level call in a predetermined amount of time), and determining by the first processor, using information from the second processor, whether a duplicate copy of the user program substantially simultaneously executed in the second processor has made a system level call in the predetermined amount of time.
摘要:
A method and system of loosely lock-stepped non-deterministic processors. Some exemplary embodiments may be a processor-based method comprising executing fault tolerant copies of a user program, one copy of the user program executed in a first processor performing non-deterministic execution, and a duplicate copy of the user program executing in a second processor performing non-deterministic execution, with the executing in the first processor and second processor not in cycle-by-cycle lock-stepped.
摘要:
A robust knowledge-based management and sharing system organized by context for context-based searching and retrieval of relevant information is disclosed. The described embodiments and techniques are used to automatically generate user profile data and organize it around one or more contexts associated with users such as their projects, products, or customers; or around users' expertise such as their competencies, knowledge, and experience. At least certain embodiments include a graphical user interface that is configured to display the automatically generated user profiles categorized based on a given expertise or context associated with the end-user.
摘要:
A method and associated apparatus may implement spontaneous topology discovery in a computer network. The network may include a plurality of entities. When a change in the topology is detected, a spanning tree is created and topology information is propagated from individual entities through the spanning tree towards an entity that functions as a “root.” Arbitrarily large topologies may be discovered this way without requiring arbitrarily large amounts of memory in participating switches.
摘要:
Interconnect networks are described that allow nodes having more than two ports to be interconnected. More particularly, each node interfaces with multiple and more than two, fabrics. Also, all fabrics are incomplete in that not every node interfaces with every fabric, and no fabric includes all the nodes, yet every pair of nodes appears together in at least one fabric. Nodes are used that appear together in a fabric as a class of nodes that exhibit similar interconnection properties. The present invention allows for scalable, high-performance and reliable interconnection of large numbers of end nodes while satisfying constraints on architecture of end nodes and networking equipment. Bounds for the number of fabrics and fabric size are disclosed for designing an optimized interconnection network.
摘要:
One embodiment of the present invention provides a distributed, differential electronic-data backup and archiving system that includes client computers and cells. Client computers execute front-end-application components of the distributed, differential electronic-data backup and archiving system, the front-end application components receiving data objects from client computers and sending the received data objects to cells of the distributed, differential electronic-data backup and archiving system for storage. Cells within the distributed, differential electronic-data backup and archiving system store the data objects, each cell comprising at least one computer system with attached mass-storage and each cell storing entire data objects as lists that reference stored, unique data chunks within the cell, a cell storing all of the unique data chunks for all data objects stored in the cell.
摘要:
A computer-implemented method and computer readable media for creating an ontology for a domain by reference to a knowledge corpus comprising linked documents and a category hierarchy wherein each document can be contained in one or more categories and wherein categories can contain one or more other categories. In some embodiments, the method comprises: searching the corpus to identify documents with text that matches a seed domain description; identifying further documents within the corpus that are semantically similar to the identified documents; identifying a subgraph of the category hierarchy that includes the categories assigned to the extracted documents and the further documents; reducing the subgraph to form the ontology by requiring that documents therein be indicative of a second domain description, the second domain description being at least as broad as the seed domain description.
摘要:
Embodiments of the present invention pertain to determining an approximate number of instances of an item for an organization. According to one embodiment, instances of items that reside on computer systems associated with the organization are determined. Instances of the same item can reside on different computers and an identification uniquely identifies an item. Random numbers are associated with identifications of the items. An approximate number of instances of the item is determined based on a highest random number associated with the item. The highest random number is the highest of the random numbers that were generated for the instances of the item.
摘要:
Various embodiments are directed to using interface events to group files. One embodiment, collects user interface events, uses the user interface events to generate a group of files that are related to a task, and enhances a query to discover files associated with the task.