ISSAC

Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of operators on parallel computers because their communications can overlap ...

In the past decade we have seen significant advances in the reliability and performance of commodity computing elements, such as processors, disks and network devices. Processors, in particular, have increased the computational power available in ...

The high availability of multiprocessor clusters for computer science seems to be very attractive to the engineer because,at a first level, such computers aggregate high performances. Nevertheless, obtaining peak performances on irregular applications ...

Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such language, Unified Parallel C (UPC) is an extension of ISO C defined by a ...

The parallelization of two applications in symmetric cryptography is considered: block ciphering and a new method based on random sampling for the selection of basic substitution boxes (S-box) with good algebraic properties. While both consists mainly ...

This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the considered matrices ranges from 8 to 37 millions. The largest rank ...

We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We focus on parallel normal form computations since this is a core subroutine in many high-level algorithms, such as triangular decompositions of polynomial ...

We report on a high-level categorical parallel framework, written in the Aldor language, to support high-performance computer algebra on symmetric multi-processors and multi-core processors. This framework provides functions for dy-namic process ...

We discuss the parallelization of algorithms for solving poly-nomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which the number of processors in use depends on the geometry of the solution ...

It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and from artificial intelligence. In the field of parallel search, disk-based ...

In [6], a new approach for certifying the correctness of program executions in hostile environments has been proposed. The authors presented probabilistic certification by massive attack detection through two algorithms MCT and EMCT. The execution to ...

The systems of equations arising from the search for inequivalent Hadamard matrices from full orthogonal designs using circulant and symmetric block matrices, can be solved using high-performance computing. Not all orthogonal designs produce ...

Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continuation can also be useful in pure mathematical research. We discuss ...

We report on our implementation for parallel computations of comprehensive Gröbner systems (introduced by Weispfenning [7]) based on Suzuki-Sato algorithm. It is the first ever parallel implementation of comprehensive Gröbner systems.

Computer chip design is entering an era in which further increases in computational power will come by increased on-chip parallelism through multi-core architectures rather than by increasing clock speed. If high performance computer algebra tools are ...

In this paper, we describe the design of a C library which is named PTPol implementing arithmetic operations for univariate polynomials. We report on practical experiments showing the relevance of using threads on recent multicore computers.

We show how ...