Taming of large diameter triaxial setup

Triaxial tests are essential to estimate the shear strength properties of the soil or rock. Normally triaxial tests are carried out on samples of 38 mm diameter and 76 mm height. Granular materials, predominantly used in base/sub-base construction of pavements or in railways have size range of 60-75 mm. Determination of shear strength parameters of those materials can be made possible only through triaxial tests on large diameter samples. This paper describes a large diameter cyclic triaxial testing facility set up in the Geotechnical Engineering lab of Indian Institute of Science. This setup consists of 100 kN capacity dynamic loading frame, which facilitates testing of samples of up to 300 mm diameter and 600 mm height. The loading ram can be actuated up to a maximum frequency of 10 Hz, with maximum amplitude of 100 mm. The setup is capable of carrying out static as well as dynamic triaxial tests under isotropic, anisotropic conditions with a maximum confining pressure of 1 MPa. Working with this setup is a difficult task because of the size of the sample. In this paper, a detailed discussion on the various problems encountered during the initial testing using the equipment, the ideas and solutions adopted to solve them are presented. Pilot experiments on granular sub-base material of 53 mm down size are also presented.

The role of competition and habitat in structuring small mammal communities in a tropical montane ecosystem in southern India

Small mammals were sampled in two natural habitats (montane stunted evergreen forests and montane grassland) and four anthropogenic habitats (tea, wattle, bluegum and pine plantation) in the Upper Nilgiris in southern India. Of the species trapped, eight were in montane evergreen forests and three were in other habitats. Habitat discrimination was studied in the rodents Rattus rattus and Mus famulus and the shrew Suncus montanus in the montane forest habitat. Multivariate tests on five variables (canopy cover, midstorey density, ground cover, tree density, canopy height) showed that R. rattus uses areas of higher tree density and lower canopy cover. Suncus montanus and M. famulus use habitat with higher tree density and ground cover and lower canopy height. Multivariate tests did not discriminate habitat use between the species. Univariate tests, however, showed that M. famulus uses areas of higher tree density than R. rattus and S. montanus. Rattus rattus was the dominant species in the montane forest, comprising 60.9% of total density, while the rodent Millardia meltada was the dominant species in the grassland. Studies of spatial interaction between these two species in habitats where they coexisted showed neither overlap nor avoidance between the species. Rattus rattus, however, did use areas of lower ground cover than did M. meltada. The analysis of spatial interactions between the species, habitat discrimination and use, and the removal experiments suggest that interspecific competition may not be a strong force in structuring these small mammal communities. There are distinct patterns in the use of different habitats by some species, but microhabitat selection and segregation is weak. Other factors such as intraspecific competition may play a more important role in these communities.

Taming Control Divergence in GPUs through Control Flow Linearization

Branch divergence is a very commonly occurring performance problem in GPGPU in which the execution of diverging branches is serialized to execute only one control flow path at a time. Existing hardware mechanism to reconverge threads using a stack causes duplicate execution of code for unstructured control flow graphs. Also the stack mechanism cannot effectively utilize the available parallelism among diverging branches. Further, the amount of nested divergence allowed is also limited by depth of the branch divergence stack. In this paper we propose a simple and elegant transformation to handle all of the above mentioned problems. The transformation converts an unstructured CFG to a structured CFG without duplicating user code. It incurs only a linear increase in the number of basic blocks and also the number of instructions. Our solution linearizes the CFG using a predicate variable. This mechanism reconverges the divergent threads as early as possible. It also reduces the depth of the reconvergence stack. The available parallelism in nested branches can be effectively extracted by scheduling the basic blocks to reduce the effect of stalls due to memory accesses. It can also increase execution efficiency of nested loops with different trip counts for different threads. We implemented the proposed transformation at PTX level using the Ocelot compiler infrastructure. We evaluated the technique using various benchmarks to show that it can be effective in handling the performance problem due to divergence in unstructured CFGs.