172 results about "Refuse collector" patented technology

Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

With better knowledge of the behavior of objects in a running application, it is possible to improve execution environment decisions that affect management of such objects. For example, if available, object lifetime statistics could be employed in decisions that affect how and where objects are placed, e.g., on allocation or during operation of automatic dynamic memory management facilities such as a garbage collector. Typically, instrumenting all objects to sample lifetimes or other characteristics would impose an impractical level of overhead. We present a technique for dynamic sampling of a subset of allocated objects that incurs low runtime overheads. Coupled with automatic memory management or collection facilities, this technique allows us to improve the efficiency of a collector by segregating objects, sampled and non-sampled alike, based on observed characteristics such as object lifetime. The sampling techniques facilitate tracking of many kinds of object information. For purposes of illustration, an exemplary implementation is described in which such sampling techniques are exploited to improve performance of generational garbage collectors.

A garbage collector treats a garbage-collected heap as divided into heap regions, for each of which it maintains a respective remembered set, whose entries list the locations where references located in the heap outside that region refer to references inside that region. The remembered sets are used during space-incremental collection operations on collection sets of those regions; if the garbage collector determines that objects in the collection set are not referred to directly or indirectly from outside the collection set, it reclaims the memory space that they occupy. It places entries into the remembered sets independently of the locations at which the references were found, so any region can be chosen for inclusion in any collection set; no predetermined collection order is required. Instead, the garbage collector performs global marking operations and uses the results to select for collection-set membership the regions that it can most likely collect efficiently.

A garbage collection system that needs to meet real-time requirements uses an eager read barrier that performs a forwarding operation as soon as a quantity is loaded. The barrier maintains a to-space invariant by including a forwarding pointer in the header of objects to be moved or accessed that normally points to the object itself. However, if the object has been moved, the forwarding pointer points to the new object location. The eager read barrier maintains the registers and stack cells such that the registers and stack cells always point into to-space. Barrier-sinking and common sub-expression elimination are used to minimize the overhead associated with the read barrier.

A system includes a processor for executing a collector program to perform a method (e.g., a method of collection). The method includes using an object model during a collection phase that is different than an object model used during program execution. The processor may also perform a method including assigning a hash code to at least some objects, and consulting a structure that maintains a mapping of objects to hashcode values to determine said hashcode for one of said objects. The processor may also perform a method including storing a class pointer and garbage collector state information in a single word, and accessing said class pointer by masking out non-class bits.

The invention provides an unmanned ship used for on-water garbage cleaning. The unmanned ship used for on-water garbage cleaning adopts a stable double-ship-body structure, and a garbage salvage device includes a three-blade fan wheel, a bucket type chained conveying device, an automatic air jetting device and a garbage collection box. The ship has three working modes, namely the random operationmode, the semi-autonomous operation mode and the emergency mode. The designed automatic air jetting device can achieve automatic air jetting at the time of salvage, garbage adsorbed on a with-hole bucket type stainless steel net plate and a nail rake are blown, the garbage thus can naturally and vertically fall into the garbage collection box, kinetic energy is provided by the additional-value energy of a motor, and energy conservation and environment protection are achieved.

In a virtual machine, Java Virtual Machine, or other runtime environment, a system and a method for improving the garbage collection times of the virtual machine memory. The JVM, or a garbage collector operating therein, can estimate, for an area of the memory space, the sum of the pause times for garbage collection of the software objects within the area, and control the garbage collection process so that the sum of the pause times for garbage collection will be lower than a target pause time limit, with a high degree of probability. A preselected compaction area can be pre-compacted to keep the compaction time within the target limit. The garbage collector can also predict the time required for final marking and repeat precleaning until the predicted final marking time is within the limits for pause times, and can improve pause times by redirecting application worker threads to do garbage collector work when entering or leaving the memory subsystem.

A drain garbage collector of the invention includes a frame, a top grate, a separator grate, and a collector grate. A plurality of passages are defined through the top grate let the roadside garbage pass through. The separator grate prevents garbage from flowing out of the garbage collector via filtering wastewater flow. Thereby, the garbage collector collects garbage and the collected garbage can be cleaned regularly to prevent inundation caused by jammed drain.

Embodiments of the invention relate to hot-swapping a live dynamic code generator. In an embodiment, hot-swapping is done in the Java execution environment. The dynamic code generator to be hot-swapped is stored in a module of a shared library separated from other components of the Java environment such as the garbage collector, the class loader, the Java Native Interface, the threading and synchronization package, etc. A graphical user interface (GUI) is provided so that the user can interact with the execution environment to control and perform hot-swapping.

A methodology has been discovered for transforming garbage collection-dependent algorithms, shared object implementations and/or concurrent software mechanisms into a form that does not presume the existence of an independent, or execution environment provided, garbage collector. Algorithms, shared object implementations and/or mechanisms designed or transformed using techniques described herein provide explicit reclamation of storage using lock-free pointer operations. Transformations can be applied to lock-free algorithms and shared object implementations and preserve lock-freedom of such algorithms and implementations. As a result, existing and future lock-free algorithms and shared object implementations that depend on a garbage-collected execution environment can be exploited in environments that do not provide garbage collection. Furthermore, algorithms and shared object implementations that employ explicit reclamation of storage using lock-free pointer operations such as described herein may be employed in the implementation of a garbage collector itself.

A system, method and program product for optimizing the mark phase of garbage collection in a JVM. A garbage collector is provided for removing unused objects, wherein the garbage collector includes: a traversing system for traversing object fields in objects obtained from a work queue, wherein the traversing system includes a leaf identifying system for determining whether object fields contain a leaf node; and a marking system for marking objects as live.

A garbage collector that employs the train algorithm determines whether futile collections have been occurring or the number of trains has reached a maximum. When either situation occurs, it merges a plurality of existing trains into a single new train. If the collector detects futile collection, it merges the oldest train with one of the other trains. If the number of trains reaches a maximum, the collection so merges trains that the next train addition will not cause the number of trains to exceed the maximum.

A Java object is scan-missed during the mark phase of a garbage collection cycle. A list of any unscanned objects, comprising all objects of a particular object type, is created during a sweep phase of the garbage collection cycle. After the garbage collection cycle is completed, and the application resumes, for every PUTFIELD/GETFIELD operation on the object type that is part of a specific parent object, a comparison is made with the relevant information in the unscanned objects list. A scan-miss is identified by determining whether the current object being referenced by the application is a part of the unscanned object list that has been created during the sweep phase of the garbage collection cycle.

The invention discloses an automatic die cleaning machine, and belongs to a cleaning machine. The automated die cleaning machine structurally comprises a cleaning machine support, cleaning machine lifting air cylinders, a cleaning brush fixing plate, cleaning brushes, ash absorbers, a draught fan and a garbage collecting box, wherein the cleaning brushes are arranged on the cleaning brush fixing plate, the lower parts of the cleaning brushes are provided with brush hairs, the upper part of the cleaning brush fixing plate is connected with the top part of the cleaning machine support through the cleaning machine lifting air cylinders, the upper parts of the ash absorbers are connected with the garbage collecting box through absorbing pipes, the other end of the garbage collecting box is connected with the draught fan through an air pipe, the garbage collecting box and the draught fan are respectively arranged on a garbage collecting box supporting plate, the garbage collecting box supporting plate is arranged at the front part of the cleaning machine support, and the absorbing pipes are telescopic pipes. The automated die cleaning machine disclosed by the invention has the characteristics that the automation of cleaning a die is realized, time and labor are saved, the labor intensity of a worker is reduced, ash can be collected and can be uniformly processed, ash flying cannot be generated, the environment cannot be polluted, the environment of a production line is good, and the like.

A method for efficiently implementing a remembered set for a region-based garbage collector includes maintaining, for each region in an object heap, a remembered set card list (RSCL). Each card in the RSCL identifies an area in the object heap that includes at least one object that references an object in the region associated with the RSCL. The method further establishes a collection set identifying a subset of regions in the object heap on which to perform partial garbage collection. Prior to performing the partial garbage collection, the method flushes cards from RSCLs associated with the collection set to the card table, globally discards cards that are about to be rebuilt from all RSCLs, and globally cleans the card table. The method then adds cards to the RSCLs for inter-region references discovered while traversing live objects in the collection set. A corresponding computer program product and apparatus are also disclosed.

A large to medium-size sweeping and mopping vehicle and a mopping vehicle are provided. The large to medium-size sweeping and mopping vehicle comprises a vehicle body, and a disc-type sweeping mechanism, a round-roller-type sweeping mechanism and a first mopping mechanism sequentially disposed along the vehicle body; the disc-type sweeping mechanism comprising a clean water tank and disc-type sweeping edge brushes driven by a motor and disposed obliquely with respect to ground, the clean water tank being disposed in front of the vehicle body driver zone, and a nozzle being disposed above each disc-type sweeping edge brush and in communication with the clean water tank; the round-roller-type sweeping mechanism comprising a refuse collector and a round-roller-type main sweeping brush driven by the motor to rotate horizontally; and the first mopping mechanism comprising a dragging roller, a guiding mopping roller, a guiding roller, a ring-shaped mop and a washing water tank.

The techniques described ease the work of garbage collectors by reducing the garbage produced. These embodiments combine the data-flow analysis of native compilers with an extension of the Java Virtual Machine (JVM). A special bytecode is inserted into the original bytecode to explicitly free unused objects. As a result, the garbage collector does not see the object that was explicitly reclaimed and the object doesn't reserve memory after it is not used anymore. The memory footprint of the JVM decreases and the responsiveness is better because the garbage collector has less work and, thus, it interrupts the application more rarely and for less time.

The invention discloses a solar electrostatic cleaning trolley, which comprises a trolley body, wherein four wheels with speed reducing motors are arranged on the trolley body, and are driven by a solar panel arranged on the trolley body; the solar panel is connected with the trolley body through support rods; an electrostatic cleaning device used for adsorbing garbage is arranged at the front part of the trolley body; blades used for generating wind power are arranged at the middle part of the trolley body; a controller is also arranged on the trolley body; the controller is respectively used for controlling the blades and the electrostatic cleaning device; through sucking force generated by the blades, the garbage adsorbed by the electrostatic cleaning device is sucked into a collector arranged at the back part of the trolley body for completing garbage cleaning. The solar electrostatic cleaning trolley has the advantages that by using the electrostatic principle, various kinds of garbage on the ground can be automatically cleaned and are conveyed into the garbage collector; the garbage in the collector only needs to be manually poured into a garbage can; particularly, the fallen leaf sweeping effect in autumn is obvious; great convenience is brought for workers; the solar board provides energy for the solar electrostatic cleaning trolley, so that the energy can be saved and made, and the long-time continuous work can be realized.