Analysis of parallel algorithms
Semantic Scholar uses AI to extract papers important to this topic.
Many applications are inherently error tolerant. Approximate Computing is an emerging design paradigm, which gives the… Expand Complex “fat operators” are important contributors to the efficiency of specialized hardware. This paper introduces two new… Expand Bit-parallel finite field multiplication using polynomial basis can be realized in two steps: polynomial multiplication and… Expand Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for… Expand Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The… Expand It has been argued for many years that functional programs are well suited to parallel evaluation. This thesis investigates this… Expand A simple and efficient method for evaluating the performance of an algorithm, rendered as a directed acyclic graph, on any… Expand Abstract Various heuristic procedures have been proposed to solve the well known NP-hard, resource-constrained project scheduling… Expand Harnessing the massively parallel architectures soon to become available into efficient algorithmic cooperation is one of the… Expand Kurskod: 5DV050 Inrättad: 2008-03-31 Inrättad av: teknisk-naturvetenskapliga fakultetsnämnden Reviderad: 2012-02-29 Reviderad av… Expand