Operating System-level virtualization technology, or containers as they are commonly known, represents the next generation of light-weight virtualization, and is primarily represented by Docker. However, Docker’s current design does not complement the SLAs from Docker-based container cloud offerings promising both reliability and high availability. The tight coupling between the containers and ...

Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The ...

Containerized data centers can improve the computational density of IaaS layers. This intensive high-concurrency environment has high requirements for message scheduling and container processing. In the paper, an elastically scalable strategy for cloud containers based on predictive message scheduling is introduced, in order to reduce the delay of messages and improve the response time of servi...

The root : shoot ratio for Ilex cassine L. grown 7 months in copper-treated containers was less than in nontreated containers. There was less dry weight for roots <5 mm in diameter in copper-treated containers than in nontreated containers in the outer 1 cm of the rootball. Dry weight of roots >5 mm in diameter within the rootball were not affected by copper hydroxide treatment. Coating the int...

Container-based computed is rapidly changing the way software is developed, tested, and deployed. This paper builds on previously presented work on a prototype framework for running containers on HPC platforms. We will present a detailed overview of the design and implementation of Shifter, which in partnership with Cray has extended on the early prototype concepts and is now in production at N...

Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G = (V, E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest u-t-path starts with (u, v). Shortest path queries can then be answered by Dijkstra’s algorithm restricted t...

More than 500 million ocean freight container units are shipped annually between countries and continents. Residual levels of fumigants, as well as naturally occurring off-gassing chemicals emanating from the goods, constitute safety risks, which may affect uniformed workers upon entering the container. The aim of this study was to assess workers' exposure during stripping of containers and is ...

We are investigating McBride’s idea that the type of one-hole contexts are the formal derivative of a functor from a categorical perspective. Exploiting our recent work on containers we are able to characterise derivatives by a universal property and show that the laws of calculus including a rule for initial algebras as presented by McBride hold — hence the differentiable containers include th...

We propose Janus | a C++ template library of container classes and communication primitives for parallel dynamic mesh applications. The paper focuses on two phase containers that are a central component of the Janus framework. These containers are quasi-constant, i.e., they have an extended initialization phase after which they provide read-only access to their elements. Two phase containers ar...