Linxiao Wang's research while affiliated with The University of Western Ontario and other places

Publications (4)

Chapter
In this paper, we discuss a new algorithm for computing the integer hull PI of a rational polyhedral set P, together with its implementation in Maple and in the C programming language. Our implementation focuses on the two-dimensional and three-dimensional cases. We show that our algorithm computes the integer hull efficiently and can deal with pol...
Chapter
Consider a rational convex polygon given by a system of linear inequalities \(A \vec {x} \le \vec {b}\), where A is a matrix over \({{\mathbb Z}}\), with m rows and 2 columns, and \(\vec {b}\) is an integer vector. The coordinates \(b_1, \ldots , b_m\) of \(\vec {b}\) are treated as parameters while the coefficients of A have fixed values. We obser...
Preprint
Full-text available
In this paper we present KLARAPTOR (Kernel LAunch parameters RAtional Program estimaTOR), a new tool built on top of the LLVM Pass Framework and NVIDIA CUPTI API to dynamically determine the optimal values of kernel launch parameters of a CUDA program P. To be precise, we describe a novel technique to statically build (at the compile time of P) a s...
Conference Paper
We report on a multi-threaded implementation of Fast Fourier Transforms over generalized Fermat prime fields. This work extends a previous study realized on graphics processing units to multi-core processors. In this new context, we overcome the less fine control of hardware resources by successively using FFT in support of the multiplication in th...

Citations

... The library is mainly written in the C language, for high-performance, with a simplified C++ interface for end-user usability and object-oriented programming. The BPAS library also makes use of parallelization (e.g., via the CILK extension [14]) for added performance on multi-core architectures, such as in dense polynomial arithmetic [15,16] and arithmetic for big prime fields based on Fast Fourier Transform (FFT) [17]. Despite these previous achievements, the work presented here is in active development and not yet been parallelized. ...