Results 251 to 260 of about 2,988,978 (309)
Some of the next articles are maybe not open access.
Journal of the ACM, 1980
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Richard E. Ladner, Michael J. Fischer
openaire +2 more sources
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Richard E. Ladner, Michael J. Fischer
openaire +2 more sources
Horizons of parallel computation
Journal of Parallel and Distributed Computing, 1995This paper considers the ultimate impact of fundamental physical limitations—notably, speed of light and device size—on parallel computing machines. Although we fully expect an innovative and very gradual evolution to the limiting situation, we take here the provocative view of exploring the consequences of the accomplished attainment of the physical ...
Franco P. Preparata, Gianfranco Bilardi
openaire +3 more sources
SIAM Journal on Computing, 1987
Fundamental discussion of fast parallel computation of a b mod m, for n- bit integers a,b,m, in time (log n)\({}^{O(1)}\), and of related questions, including arithmetic and boolean circuits, extension to polynomials.
openaire +3 more sources
Fundamental discussion of fast parallel computation of a b mod m, for n- bit integers a,b,m, in time (log n)\({}^{O(1)}\), and of related questions, including arithmetic and boolean circuits, extension to polynomials.
openaire +3 more sources
ACM SIGGRAPH 2008 classes, 2008
Users always care about performance. Although often it's just a matter of making sure the software is doing only what it should, there are many cases where it is vital to get down to the metal and leverage the fundamental characteristics of the processor.Until recently, performance improvement was not difficult.
openaire +3 more sources
Users always care about performance. Although often it's just a matter of making sure the software is doing only what it should, there are many cases where it is vital to get down to the metal and leverage the fundamental characteristics of the processor.Until recently, performance improvement was not difficult.
openaire +3 more sources
Scheduling Parallel Computations
Journal of the ACM, 1968A model for parallel computations is given as a directed graph in which nodes represent elementary operations, and branches, data channels. The problem considered is the determination of an admissible schedule for such a computation; i.e. for each node determine a sequence of times at which the node initiates its operation.
openaire +1 more source
ON PARALLEL PREFIX COMPUTATION
Parallel Processing Letters, 1994We prove that prefix sums of n integers of at most b bits can be found on a COMMON CRCW PRAM in [Formula: see text] time with a linear time-processor product. The algorithm is optimally fast, for any polynomial number of processors. In particular, if [Formula: see text] the time taken is [Formula: see text]. This is a generalisation of previous result.
Sanjeev Saxena +2 more
openaire +2 more sources
Journal of the ACM, 1966
Various classes of machines incorporating parallelism are considered. A general class of large-scale multiprocessors is outlined, and some problems of hardware and software implementation for computers of this class are discussed.
openaire +1 more source
Various classes of machines incorporating parallelism are considered. A general class of large-scale multiprocessors is outlined, and some problems of hardware and software implementation for computers of this class are discussed.
openaire +1 more source
Parallel computing on personal computers
Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems - SIGSMALL '86, 1986A set of Personal Computers is connected to form a ring-structured parallel system. Each computer has access to its local memory and can communicate with its two neighbours in the ring.This network of asynchronous processors is used to solve in parallel combinatorial optimization problems that are too time- and space-consuming to be handled on a single
openaire +2 more sources
Computational biology on parallel computers
2003 European Control Conference (ECC), 2003Several applications in computational biology have large runtime and memory requirements either because of large data sizes or the inherent time and memory complexity of the underlying algorithms. Parallel computing is an effective way to address both these concerns — run-time can be reduced by the use of multiple processors to solve the same problem ...
openaire +2 more sources