Introduction: Many items are needed for dressing including sterile dressing set, antiseptic and washing solutions, leucoplast tape, waste bin for infectious garbage, waste bin for noninfectious garbage, safe disposal trash for sharp cutting instruments, bedpan and sometimes drugs. All the items are laid out on a simple wheeled trolley. The multiplicity of items together with problems in placin...

The function of a garbage collector in a computer system is to reclaim storage that is no longer in use. Developing a garbage collector for a distributed system composed of autonomous computers (nodes) connected by a communication network poses a challenging problem: optimising performance whilst achieving fault-tolerance. The paper presents the design and implementation of a reference-count ga...

We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined whether or not the link will possibly be used once again by the program, and if not the link is automat...

Persistent data structures often use tricks to achieve their performance guarantees. In these structures, pointer reachability fails as a method of determining what is and isn’t garbage. We present an extension for a garbage collector which can understand and collect a particular persistent structure called trailer arrays. Our method does not increase the time or space complexity of garbage col...

Object-oriented programming languages are being widely adopted as one of the most powerful languages due their flexibility and reusability. However, these languages suffer from memory mismanagement that could be critical especially in real-time and embedded systems. Automatic memory management through garbage collector handles this problem. Concurrent garbage collection based on sporadic or def...

As open systems persist, garbage collection (GC) can be a vital aspect in managing system resources. Although garbage collection has been proposed for the standard Linda, it was a rather course-grained mechanism. This finer-grained method is offered in Lindacap, a capability-based coordination system for open distributed systems. Multicapabilities in Lindacap enable tuples to be uniquely refere...

In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection push the boundaries of what we can learn about programs statically. This work illuminates and poses solutions to theoretical and practical challenges that stand in the way of combining the power of these techniques. Pushdown flow analysis grants unbounded yet computable polyvariance to the anal...

A solution of the optimization garbage removal problem in the large cities is suggested. In this paper there is described a system architecture to find time-optimal dynamic route for garbage trucks within “Smart Clean City” project which unites an approach to put special electronic devices on the garbage containers with the developed software responsible for the detecting the filled up containe...

We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. We also show that garbage collection may be stated via a left adjoint, hence preserving colimits, followed by two right adjoints. These three adjoints cope well with the different phases of a traditional garbage collec...

Recently, many storage systems use SSD based on NAND flash memory, which has many advantages such as low power, low access latency and high reliability. However, NAND flash memory has disadvantages such as erase-beforeprogram, limited P/E cycle, and unbalanced operation latency, compared to conventional magnetic disks. To solve these problems, many works mainly adopt FTL with garbage collection...