2637 results about "Refuse collection" patented technology

A system and method for performing garbage collection. A system includes a storage medium, a first table including entries which map a virtual address to locations in the storage medium, and a second table with entries which include a reverse mapping of a physical address in a data storage medium to one or more virtual addresses. A storage controller is configured to perform garbage collection. During garbage collection, the controller is configured to identify one or more entries in the second table which correspond to a segment to be garbage collected. In response to determining the first table includes a valid mapping for a virtual address included in an entry of the one of the one or more entries, the controller is configured to copy data from a first location identified in the entry to a second location in the data storage medium, and reclaim the first storage location.

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.

An apparatus includes a non-volatile memory and a controller. The controller is coupled to the non-volatile memory and configured to (i) measure a rate of free space consumption in the non-volatile memory, (ii) measure a rate of free space production in the non-volatile memory, and (iii) adjust a rate of a recycling process in response to the measured rate of free space consumption and the measured rate of free space production.

Computer system, method and article of manufacture for garbage collection in computer systems that combines individual objects into linearized trees called multiobjects and thereafter utilizes multiobjects to implement most memory management operations such as detection of dead objects and compaction without the need to inspect individual objects, thereby improving performance and reducing power consumption.

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 method and system for concurrent garbage collection wherein live memory objects, i.e., not garbage, can be marked while an application executes. Root information is gleaned by taking a snapshot program roots or by arranging the stack to be scanned during execution of the program. Next, a first marking act is performed using the root information while the program executes. Modifications in the memory structure that occur during the concurrent marking act are logged or accumulated by a write watch module. The application is then paused or stopped to perform a second marking act using information from the write watch module. Following the second marking act, the garbage collection may be completed using various techniques.

A multiprocessor, multi-program, stop-the-world garbage collection program is described. The system initially over partitions the root sources, and then iteratively employs static and dynamic work balancing. Garbage collection threads compete dynamically for the initial partitions. Work stealing double-ended queues, where contention is reduced, are described to provide dynamic load balancing among the threads. Contention is resolved by using atomic instructions. The heap is broken into a young and an old generation where parallel semi-space copying is used to collect the young generation and parallel mark-compacting the old generation. Speed and efficiency of collection is enhanced by use of card tables and linking objects, and overflow conditions are efficiently handled by linking using class pointers. A garbage collection termination employs a global status word.

An apparatus and electronic system for optimizing a trash pick-up schedule of a plurality of trash compactors is disclosed. The system comprises the steps of measuring the weight of trash in a trash compactor; calculating from said trash weight a targeted trash weight optimal for pick up; predicting a pick-up time based on said trash weight and said optimal trash weight; transmitting a signal to a fleet management unit; calculating a pick-up schedule for said plurality of trash compactors; generating a bill containing accounting information for said trash compactor unit; and generating a warning when said trash compactor unit malfunctions. The system permits efficient trash pick-up based on customer needs and accordingly provides a cost-effective and environmentally friendly system.

A method of memory management can include creating an initial root set of pointers for a program during execution of the program and performing a marking process by iteratively marking referred objects of each pointer of the root set and expanding the root set with filtered, encoded pointers. The method also can include identifying each non-live object for any marked object as red-marked and performing, using a processor, a re-marking process on the root set in which red-marked objects are excluded. Each object of the root set not marked can be designated as including a memory leak.

A collapsible refuse collection apparatus. The invention includes a body; the body includes a frame portion and a covering portion having predetermined dimensions. The frame portion has an opened and closed position, two sides and a base; the two sides being adjacently and pivotally attached to the base. The covering portion is surroundedly attached to the frame portion, wherein the covering portion protects the frame portion and, in the frame portion's opened position, forms an inner compartment, a top, an opened end and a closed end. The apparatus also includes a wheel assembly attached to the frame portion providing mobility for the apparatus, a flap pivotally attached to the opened end of the covering portion and having predetermined dimensions. The inner compartment, formed by the frame portion's opened position, has predetermined dimensions such that the inner compartment can accommodate a collection bag. The inner compartment and the collection bag are used to collect the refuse. The sides pivot towards each other and fold towards the base, forming the frame portion's closed position.

A garbage collection (GC) process within a deduplication backup network comprising a GC component identifying metadata stored in file system (FS) segments, storing the metadata in a metadata container locally on the server as well as on cloud storage, and reading the locally stored metadata container through the GC process to obtain metadata of the FS containers and determine live data regions of the FS containers, wherein the metadata contains fingerprints of all segments of the file system containers; and a copy forward component forwarding the live data regions to new containers written both locally on the server and on the cloud storage, writing live portions of the metadata container to a new metadata container written both locally on the server and on the cloud storage, and deleting dead compression regions from the cloud storage and deleting the original metadata container from local storage and the cloud storage.

A trash skimmer work boat collects and discharges debris from the front or bow. A storage conveyor positioned approximately amidships and along the center line, and is mounted to the hull on a slide or track arrangement that permits fore and aft motion. A collection and discharge conveyor is mounted at the bow portion of the hull. The forward conveyor can be oriented in a trash collection position or in a trash discharge position. The storage conveyor is brought sternward so that there is clearance for the proximal end of the forward conveyor to be raised or lowered, and then is brought back forward so that the storage conveyor is in position to receive debris or to discharge it. Auxiliary floats at the sides of the boat hull provide additional buoyant support for the front conveyor, and are detachable so they can be removed for road transport of the boat.

A mechanism or apparatus mounted on a refuse collection vehicle that is capable of reaching out from that vehicle and grasping a full refuse container, lifting the container vertically off the ground and transporting said container to the side of the refuse collection vehicle, rotating and inverting the container over the center of the refuse collection vehicle's collection hopper and empting the contents of the container into the collection hopper and returning the empty refuse container to the original location, all without spilling any of the contents of the refuse container anywhere other than in the collection hopper.

A method, system and computer program product for reducing garbage collection pause time. According to example embodiments, a garbage collection cycle is initiated on a set of objects that have been dynamically allocated in a memory. An identification is made of new persistent objects and reachable non-persistent objects while ignoring old persistent objects that have been identified as persistent in previous garbage collection cycles. The new persistent objects are associated as members of a set of persistent objects that includes the old persistent objects. The persistence information for the set of persistent objects is preserved for use during subsequent garbage collection cycles. All reachable non-persistent objects and all persistent objects in the set of persistent objects are marked for memory reclamation phase processing. The persistent objects are so marked using the preserved persistence information such that repeated scanning of persistent objects during multiple garbage collection cycles is avoided.

The invention discloses an intelligent classified recovery system of medical waste and a control method of the intelligent classified recovery system. The intelligent classified recovery system of the medical waste comprises a separating wall, a window, a receiving device, an output device, a conveyor belt and a plurality of waste collection devices, wherein the separating wall is used for forming a first chamber and a second chamber, which are isolated from each other; the window penetrates through the separating wall; the receiving device is arranged in the first chamber, and the receiving device is used for receiving the medical waste and conveying the medical waste to the second chamber through the window; the output device is arranged in the second chamber, and the output device is used for receiving and conveying the medical waste; the conveyor belt is arranged in the second chamber, and the conveyor belt is used for driving the output device to move; a plurality of waste collection devices are arranged in the second chamber; the control device is used for distinguishing the types of the medical waste and controlling the output device to convey the medical waste to the corresponding waste collection device. By adopting the intelligent classified recovery system, a consulting room and a waste treatment room can be separated, the medical waste can be distributed to different waste collection devices, the environment of the consulting room is improved, and the working intensity is alleviated.

A method is provided for garbage collection in a computer system that executes at least one mutator. The collector scans objects stored in a memory of the computer system so as to create a wavefront behind which are the objects that have already been scanned. The collector records progress information that indicates the collector's progress in scanning the fields of at least one of the objects, and the behavior of the mutator is changed when mutating the one object based on the progress information that is currently recorded. In another method, the collector scans objects stored in a memory of the computer system so as to create a wavefront behind which are the objects that have already been scanned, and reference counts are maintained behind the wavefront such that each of the reference counts indicates the number of pointers from already scanned fields of objects to unscanned objects.

The operation of a pool of solid state drives is orchestrated to manage garbage collection and wear leveling. Each individual solid state drive is operated in either an Active Mode in which I/O commands are processed or in a Maintenance Mode in which garbage collection is performed and no I/O commands are processed. The selection of solid state drives in the Active Mode is further selected to achieve wear leveling over the pool of solid state drives. A virtualization layer provides dynamic mapping of virtual volume addresses to physical solid state drives.

Disclosed are a partial heap garbage collector, and a partial heap garbage collection method, that during collection checks the time remaining (or equivalently the time taken so far, or the work done so far) to complete the partial heap collection. In a preferred embodiment, the partial heap collection is guaranteed to complete within a fixed time interval. For example, this guarantee may be obtained by applying a worst-case execution time (WCET) and sizing a nursery so that complete evacuation of the nursery can always be achieved on time. As an alternative, a technique, referred to as syncopation, may be used to allow generational collection to be used despite variance in program behavior over the short time scales in which a nursery can be collected. Syncopation may be accomplished via allocation control or via collection control.

Methods and systems for autonomously interacting with persons in a public environment to store and transport their personal material items are described herein. A service robot includes one or more secure storage cells, and is configured to collect items such as personal belongings, refuse, etc., from users and transport the collected items to different locations. The service robot maneuvers through a crowded environment autonomously, avoiding collisions with people and objects, and minimizing disturbances to traffic flow. Users indicate a desire to store and transport items to a desired location. In response, the service robot unlocks a lid of a storage cell, and the user is able to load material items. In some examples, access to the storage cell is controlled based on access codes. In some examples, access to the storage cell is controlled based on receipt of an electronic payment.