Urban garbage disposal and management in China

This paper, probing into the present situation of urban domestic garbage by analyzing its growing trend, compositional change and regional difference, reveals the problems existing in its disposal and management in China. Meanwhile, a questionnaire was conducted in five big cities around China for surveying urban residents' attitudes towards garbage disposal and management policies and measures. Results showed the output of urban domestic garbage in Chinese cities is ever increasing, and the recoverable materials and energy in garbage composition are also increasing. The population growth, economic development, and increase of residents' expenditure level are the main factors influencing the growing output and changing composition of the garbage. Information acquired from the questionnaire showed that majority of the urban residents are in favor of the garbage reduction policies and managerial measures and are willing to collaborate with municipal government in battling against garbage. Based on the analysis and questionnaire, some policymaking oriented suggestions such as operating the garbage disposal from a social welfare service to a sector of profit gaining enterprises, transferring the garbage management from passive end control to active source control, promoting the classified garbage collection in cities around China, and charging garbage fees for its cleanup and disposal, have also been put forward in the paper.

Design of Closed-loop Garbage collection system based on IOT Technology

Our country＇s garbage collection system has been widely concerned in society, because of its low reclamation rate, and difficult in supervision. The Internet of things technology has shown significant superiority in solving that＇s problem because of its traceability characteristics, dynamic. This paper takes the Internet of things technology as the basis, starting from the end of the collection, transportation and treatment of urban wastes in three aspects, construct a closed loop waste treatment system has good information feedback and processing capacity.

Quantitative analysis of Boehm' s GC

The term garbage collection describes the automated process of finding previously allocated memorythatis no longer in use in order to make the memory available to satisfy subsequent allocation requests. Wehave reviewed existing papers and implementations of GC, and especially analyzed Boehm' s C codes, which isa real-time mark-sweep GC running under Linux and ANSI C standard. In this paper, we will quantitatively an-alyze the performance of different configurations of Boehm' s collector subjected to different workloads. Reportedmeasurements demonstrate that a refined garbage collector is a viable alternative to traditional explicit memorymanagement techniques, even for low-level languages. It is more a trade-off for certain system than an all-or-nothing proposition.

Class-Based Garbage Collection in Object-Oriented Programming Environments

Many garbage collection algorithms have been proposed, but few address the special needs of long-running server programs. Server applications usually run for years and spawn many threads, so they create and discard thousands of objects. Therefore, efficient garbage collection is especially important for those applications. This paper presents a class-based garbage collector for object-oriented programming environments that classifies objects by their types to achieve better gradualness. Grouping objects of the same type into a group, with a limited type-lock, a mutator cache and the lease protocol will reduce memory fragmentation, which is especially important for the efficiency of long-running server applications. This class-based collector partitions the heap space by type, which provides better concurrency than the traditional mark-sweep collector, and its reusable garbaged object pool also reduces the object allocation overhead. This paper also discusses the implementation details, such as the mutator cache and the lease protocol, and techniques to achieve better accuracy.

Garbage Collection in Uncoordinated Checkpointing Algorithms

In this papert the hard problem of the thorough garbage collection in uncoordinated Checkpointing algorithms is studied. After introduction of the traditional garbage collecting scheme, with which only obsolete checkpoints can be discarded, it is shown that this kind of traditional method may fail to discard any checkpoint in some special cases, and it is necessary and urgent to find a thorough garbage collecting method, with which all the checkpoints useless for any future rollback-recovery including the obsolete ones can be discarded. Then, the Thorough Garbage Collection Theorem is proposed and proved, which ensures the feasibility of the thorough garbage collection, and gives the method to calculate the set of the useful checkpoints as well.

Garbage Collection and Data Recovery for N2DB

Non-Volatile Memory(NVM) offers byte-addressability and persistency. Because NVM can be plugged into memory and provide low latency, it offers a new opportunity to build new database systems with a single-layer storage design. A single-layer NVM-Native DataBase(N2 DB) provides zero copy and log freedom. Hence, all data are stored in NVM and there is no extra data duplication and logging during execution. N2 DB avoids complex data synchronization and logging overhead in the two-layer storage design of disk-oriented databases and in-memory databases. Garbage Collection(GC) is critical in such an NVM-based database because memory leaks on NVM are durable. Moreover, data recovery is equally essential to guarantee atomicity, consistency, isolation, and durability properties. Without logging, it is a great challenge for N2 DB to restore data to a consistent state after crashes and recoveries. This paper presents the GC and data recovery mechanisms for N2 DB. Evaluations show that the overall performance of N2 DB is up to 3:6 higher than that of InnoDB. Enabling GC reduces performance by up to 10%,but saves storage space by up to 67%. Moreover, our data recovery requires only 0:2% of the time and half of the storage space of InnoDB.

Asurvey on design and application of open-channel solid-state drives

Compared with traditional solid-state drives(SSDs),open-channel SSDs(OCSSDs)expose their internal physical layout and provide a host-based flash translation layer(FTL)that allows host-side software to control the internal operations such as garbage collection(GC)and input/output(I/O)scheduling.In this paper,we comprehensively survey research works built on OCSSDs in recent years.We show how they leverage the features of OCSSDs to achieve high throughput,low latency,long lifetime,strong performance isolation,and high resource utilization.We categorize these efforts into five groups based on their optimization methods:adaptive interface customizing,rich FTL co-designing,internal parallelism exploiting,rational I/O scheduling,and efficient GC processing.We discuss the strengths and weaknesses of these efforts and find that almost all these efforts face a dilemma between performance effectiveness and management complexity.We hope that this survey can provide fundamental knowledge to researchers who want to enter this field and further inspire new ideas for the development of OCSSDs.

Robust Optimization of Municipal Solid Waste Collection and Transportation with Uncertain Waste Output: A Case Study

Garbage collection is an important issue in urban environmental management.With the increased awareness of urban residents regarding safety,environmental protection,and health in recent years,it is necessary to logically organize municipal solid waste collection and transportation routes while also considering economic and social benefits.This article focuses on the optimization of the waste transportation routes of garbage trucks.With the objective of minimizing transportation costs and maximizing resident satisfaction,we establish a robust optimization model for the multi-trip collection and transportation of municipal solid waste in an uncertain environment.Resident satisfaction is defined as the penalty cost against a time window constraint.The Bertsimas robust optimization method is applied to characterize the uncertainty,and the decision-making scheme of the receiving route is used to adapt to waste volume changes.We conduct a case study based on real-world data for municipal solid waste collection and transportation in the Dongcheng District of Beijing,China.The solution is validated using the CPLEX program,and the validity of the model is verified.In addition,a sensitivity analysis of related parameters is conducted to study the impacts of variations in work hour limits and time windows on the total cost and service levels,as well as their relationships with the level of robustness.This could help decision-makers make reasonable choices based on actual conditions and to balance reductions in total cost with service level improvements.