Sciweavers

260 search results - page 15 / 52
» Array SSA Form and Its Use in Parallelization
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
16 years 11 days ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
128
Voted
ICPP
1989
IEEE
15 years 10 months ago
A Self-Routing Permutation Network
A self–routing permutation network is a connector which can set its own switches to realize any one-to-one mapping of its inputs onto its outputs. Many permutation networks have...
David M. Koppelman, A. Yavuz Oruç
CVPR
2008
IEEE
16 years 7 months ago
A Parallel Decomposition Solver for SVM: Distributed dual ascend using Fenchel Duality
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
Tamir Hazan, Amit Man, Amnon Shashua
CCGRID
2001
IEEE
15 years 9 months ago
Parallel I/O Support for HPF on Clusters
Clusters of workstations are a popular alternative to integrated parallel systems designed and built by a vendor. Besides their huge cumulative processing power, they also provide...
Peter Brezany, Viera Sipková
IPPS
2002
IEEE
15 years 10 months ago
Implementing Associative Search and Responder Resolution
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
Meiduo Wu, Robert A. Walker, Jerry L. Potter