31,413 research outputs found

    UTHM water quality classification based on sub index

    Get PDF
    River or stream at their source is unpolluted, but as water flow downstream, the river or lake is receiving point and non-point pollutant source. Ammoniacal nitrogen (NH3- N) and suspended solids (SS) strongly influences the dynamics of the dissolved oxygen in the water. Studies on monitoring this parameter were conducted for a river or lake but limited to the small man-made lake. This study is initiate to determine the changes in water quality of UTHM watershed as the water flows from upstream to downstream. The monitoring of NH3-N and TSS were monitored at two sampling schemes, 1) at the two-week interval and, 2) at a daily basis followed by the determination of the water quality sub-index particularly SIAN and SISS. The results showed that the two lakes in UTHM watershed were classified as polluted. In conclusion, the remedial action should be implemented to improve the water quality to meet the requirements at least to meet the recreational purpose

    Locality-Adaptive Parallel Hash Joins Using Hardware Transactional Memory

    Get PDF
    Previous work [1] has claimed that the best performing implementation of in-memory hash joins is based on (radix-)partitioning of the build-side input. Indeed, despite the overhead of partitioning, the benefits from increased cache-locality and synchronization free parallelism in the build-phase outweigh the costs when the input data is randomly ordered. However, many datasets already exhibit significant spatial locality (i.e., non-randomness) due to the way data items enter the database: through periodic ETL or trickle loaded in the form of transactions. In such cases, the first benefit of partitioning — increased locality — is largely irrelevant. In this paper, we demonstrate how hardware transactional memory (HTM) can render the other benefit, freedom from synchronization, irrelevant as well. Specifically, using careful analysis and engineering, we develop an adaptive hash join implementation that outperforms parallel radix-partitioned hash joins as well as sort-merge joins on data with high spatial locality. In addition, we show how, through lightweight (less than 1% overhead) runtime monitoring of the transaction abort rate, our implementation can detect inputs with low spatial locality and dynamically fall back to radix-partitioning of the build-side input. The result is a hash join implementation that is more than 3 times faster than the state-of-the-art on high-locality data and never more than 1% slower

    On the performance of routing algorithms in wormhole-switched multicomputer networks

    Get PDF
    This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions. Despite the previously reported results, our results show that the adaptive routing does not consistently outperform the deterministic routing even for high dimensional networks. In fact, it appears that the superiority of adaptive routing is highly dependent to the broadcast traffic rate generated at each node and it begins to deteriorate by growing the broadcast rate of generated message
    • …
    corecore