摘要:
A garbage collector collects a generation of a dynamically allocated heap in a computer's memory incrementally. A collection set within the generation is associated with each collection increment. The collector reclaims for reuse the memory space occupied by any collection-set object not reachable by a reference chain that extends from outside the collection set. The collector monitors the total amount of allocation that occurs within the generation between collection increments, and it bases the collection-set size on those allocation amounts.
摘要:
An osteogenic implant with improved osteointegration properties, this implant being made of titanium metal or a titanium-based alloy and being suitable for implantation in bones, said implant having a roughened surface, which in the hydroxylated state has been at least partially covered with a compound which comprises in the molecule at least two groups which are, independently of one another, a primary amino group, a secondary amino group, a carboxyl group, an amide group, a phosphano group and/or hydroxyl, or with a mixture of such compounds.
摘要:
In a garbage collector that employs the train algorithm, the collector identifies cars that are located far back in the collection order but already have large remembered sets, and it advances their collection. One way of doing so includes advancing a car's nominal position in the collection order, placing it nominally ahead of erstwhile “older” cars as well as actually. Another way does not include changing the advanced car's nominal position. The advancement operation is simpler with the latter approach, but normal updating is simpler with the former. Although both approaches tend to increase the number of entries in the remembered set of the car thus advanced, they actually reduce the overall memory cost of remembered-set maintenance.
摘要:
An electroluminescent device comprising: a first charge carrier injecting layer for injecting positive charge carriers; a second charge carrier injecting layer for injecting negative charge carriers; and a light-emissive layer located between the charge carrier injecting layers and comprising a mixture of: a first component for accepting positive charge carriers from the first charge carrier injecting layer; a second component for accepting negative charge carriers from the second charge carrier injecting layer; and a third, organic light-emissive component for generating light as a result of combination of charge carriers from the first and second components; at least one of the first, second and third components forming a type II semiconductor interface with another of the first, second and third components.
摘要:
A copying garbage collector evacuates to a to space the objects in a from space that are referred to by references, including references in previously evacuated objects, that are located outside the from space. It divides the to space into local-allocation buffers (“LABs”), and it adopts one of these as a destination LAB, i.e., as the LAB into which it places the objects that it evacuates. When a destination LAB becomes full, the thread adopts a new LAB as its destination LAB. When a destination LAB's contents fill it to some predetermined fill threshold, that destination LAB becomes the source LAB, i.e., the LAB that the collector scans for references to the collection-set objects. If a previous source LAB's contents has not yet been completely scanned when the collector thus adopts a new source LAB, the previous source LAB is placed on a LAB stack. When no more references to unevacuated collection-set objects remain in its current source LAB, the collector then pops a LAB from its LAB stack on a last-in, first-out basis and adopts that LAB as the source LAB.
摘要:
In accordance with the principles of the present invention, management of a data replication system is provided by a three-tiered arrangement. The lowest, or agent, tier comprises Common Information Model (CIM) provider objects that reside in the hosts providing the data replication service and that can make method calls on the low-level kernel routines. The middle, or logic, tier is a set of federated Java beans that communicate with each other, with the management facades and with the upper tier of the system. The upper, or presentation, tier of the inventive system comprises web-based presentation programs that can be directly manipulated by management personnel to view and control the data replication system.
摘要:
A garbage collector operates in multiple threads, and one thread can be parsing a region containing a free block while another thread is allocating space from that free block for an object being relocated to that region. The object being relocated may be an array object, for which the length determination is based on more than one word in the object; it may be based on a class-identifying word and a number-of-elements word. To prevent a parsing thread from parsing erroneously by reading both of those words between the relocating thread's writing one of them and writing the other, the relocating thread first writes into the classifying word a distinguished value from which a parsing thread can conclude that the values it reads in other fields of the block are not to be trusted. The relocating thread then completes writing the other fields before it writes the relocated object's classifying word, and any parsing thread repeats the size-determining routine until the uninitialized value is removed and it can therefore rely on other values in the block.
摘要:
A garbage collector divides the garbage-collected heap into “cards.” It maintains a table containing a card-object table entry for each card. A card's entry contains information from which the collector can determine where any references in the card are located and thereby identify objects that may be reachable. Specifically, although each entry is smaller than a memory address, it has enough possible values to give the relative location of the object in which the associated card begins or to direct the collector to another entry for that information. But the entries are additionally grouped into sequences of contiguous entries that together are large enough to contain a complete address. When every card associated with a entry in a given (address-sized) entry sequence begins in the same object, that entry sequence is together given a value that the collector can recognize as indicating that object's absolute location.
摘要:
A network appliance for monitoring, diagnosing and documenting problems among a plurality of devices and processes (objects) coupled to a computer network utilizes periodic polling and collection of object-generated trap data to monitor the status of objects on the computer network. The status of a multitude of objects is maintained in memory utilizing virtual state machines which contain a small amount of persistent data but which are modeled after one of a plurality of finite state machines. The memory further maintains dependency data related to each object which identifies parent/child relationships with other objects at the same or different layers of the OSI network protocol model. A decision engine verifies through on-demand polling that a device is down. A root cause analysis module utilizes status and dependency data to locate the highest object in the parent/child relationship tree that is affected to determine the root cause of a problem. Once a problem has been verified, a “case” is opened and notification alerts may be sent out to one or more devices. A user interface allows all objects within the network to be displayed with their respective status and their respective parent/child dependency objects in various formats.
摘要:
A swapping utility enables directional commands from a graphic user interface and/or keyboard to be utilized to swap data items associated with lists, tables or other series of data items. Upon receipt of both a directional command, e.g. up, down, left, or right, and a swap command, the utility uses the current position of the cursor or a selected entity to identify a first data item to be swapped and the relative direction thereto to identify a second, adjacent data item to be swapped. If both identified data items are of the same data type, their respective contents are exchanged within the ordered list or table without the need to cut and paste the content. In alternative embodiments, multiple adjacent data items may be swapped, or, in an embodiment which utilizes multiple selection icons, single or multiple nonadjacent entities may be directly swapped.