Condition assessment of a 63-year old reinforced concrete structure exposed to the North Sea

This paper describes the condition of a reinforced concrete balustrade consisting of some 1000 individual beam elements all exposed similarly to the hostile marine environment of the North Sea at Arbroath, Scotland since 1943. A comparison is made of the condition of the original construction with the condition of repairs carried out in 1968 and in 1993. It is shown that the 1943 construction shows very little corrosion-induced cracking and little rust staining even though it does not appear to be of high construction quality. Only a very low percentage of the balustrade beams have been replaced. In contrast the beam installed in 1968 and later in 1993 show very considerable and large concrete cracks directly attributable to the corrosion of the longitudinal reinforcement, even though the concrete is of a higher quality and density. A detailed condition survey and statistics of crack sizes are presented in the paper. It is found that the higher corrosion resistance of the 1943 concrete is generally consistent with the concrete electrical resistivity measurements but the degree of corrosion of the reinforcing bars is inconsistent with chloride penetration measurements. The results are compared with the very few observations available in the literature for ageing concrete structures in marine environments. The results cast doubt on the conventional wisdom that chloride content at the reinforcement correlates well with reinforcement corrosion.

Parallel optimisation algorithms for multilevel mesh partitioning

Three parallel optimisation algorithms, for use in the context of multilevel graph partitioning of unstructured meshes, are described. The first, interface optimisation, reduces the computation to a set of independent optimisation problems in interface regions. The next, alternating optimisation, is a restriction of this technique in which mesh entities are only allowed to migrate between subdomains in one direction. The third treats the gain as a potential field and uses the concept of relative gain for selecting appropriate vertices to migrate. The results are compared and seen to produce very high global quality partitions, very rapidly. The results are also compared with another partitioning tool and shown to be of higher quality although taking longer to compute.

Parallel mesh partitioning on distributed memory systems

The problem of deriving parallel mesh partitioning algorithms for mapping unstructured meshes to parallel computers is discussed in this chapter. In itself this raises a paradox - we seek to find a high quality partition of the mesh, but to compute it in parallel we require a partition of the mesh. In fact, we overcome this difficulty by deriving an optimisation strategy which can find a high quality partition even if the quality of the initial partition is very poor and then use a crude distribution scheme for the initial partition. The basis of this strategy is to use a multilevel approach combined with local refinement algorithms. Three such refinement algorithms are outlined and some example results presented which show that they can produce very high global quality partitions, very rapidly. The results are also compared with a similar multilevel serial partitioner and shown to be almost identical in quality. Finally we consider the impact of the initial partition on the results and demonstrate that the final partition quality is, modulo a certain amount of noise, independent of the initial partition.