An efficient representation format for fuzzy intervals based on symmetric membership functions
Résumé
This paper proposes a novel implementation of fuzzy arithmetics that exploits both fuzzy intervals and hardware specificities. First, we propose and evaluate the benefit of an alternative representation format to the traditional lower-upper and midpoint-radius representation formats for intervals. Thanks to the proposed formats, we show that it is possible to halve the number of operations and memory requirements compared to conventional methods. Then, we show that operations on fuzzy intervals are sensitive to hardware specificities of accelerators such as GPU. These include static rounding, memory usage, instruction level parallelism (ILP) and thread-level parallelism (TLP). We develop a library of fuzzy arithmetic operations in CUDA and C++ over several formats. The proposed library is evaluated using compute-bound and memory-bound benchmarks on Nvidia GPUs, and shows a performance gain of 2 to 20 over traditional approaches.