A new denoising technique based on the multi-level dissipation element (ML-DE) structure is proposed. A dissipation element (DE) is defined as collection of spatial points whose gradient trajectories share the same pair of extremal points. The entire space can be decomposed into space-filling DEs. From the concept of multi-level extremal points, such a DE structure can be extended to different scale levels. The general idea of image smoothing is realized via smoothing each decomposed DE, remaining the function values at the critical points (maximal, minimal and saddle points) unchanged, from which the key features of the original image can be preserved. The test example of spiky map topology justifies the efficiency and effectiveness of this newly proposed method.

Distributed-memory systems can incorporate thousands of processors at a reasonable cost. However, with an increasing number of processors in a system, fault detection and fault tolerance become critical issues. By replicating the computation on more than one processor and comparing the results produced by these processors, errors can be detected. During the execution of a program, due to data dependencies, typically not all of the processors in a multiprocessor system are busy at all times. Therefore processor schedules contain idle time slots and it is the goal of this work to exploit these idle time slots to schedule duplicated computation for the purpose of fault detection. We propose a compiler-assisted approach to fault detection in regular loops on distributed-memory systems. This approach achieves fault detection by duplicating the execution of statement instances. After carefully analyzing the data dependencies of a regular loop, selected instances of loop statements are duplicated in a way that ensures the desired fault coverage. We first present duplication strategies for fault detection and show that these strategies use idle processor times for executing replicated statements, whenever possible. Next, we present loop transformations to implement these fault-detection strategies. Also, a general framework for selecting appropriate loop transformations is developed. Experimental results performed on the CRAY-T3D show that the overhead of adding the fault detection capability is usually less than 25%, and is less than 10% when communication overhead is reduced by grouping messages.

Communication overhead can significantly impact the performance execution of programs on distributed-memory systems.