Sciweavers

5553 search results - page 186 / 1111
» Parallel Implementation of Sch
Sort
View
ASPLOS
2008
ACM
15 years 5 months ago
The potential for variable-granularity access tracking for optimistic parallelism
Support for optimistic parallelism such as thread-level speculation (TLS) and transactional memory (TM) has been proposed to ease the task of parallelizing software to exploit the...
Mihai Burcea, J. Gregory Steffan, Cristiana Amza
NETWORKING
2007
15 years 4 months ago
Accelerated Packet Placement Architecture for Parallel Shared Memory Routers
Abstract. Parallel shared memory (PSM) routers represent an architectural approach for addressing the high memory bandwidth requirements dictated by output-queued switches. A funda...
Brad Matthews, Itamar Elhanany, Vahid Tabatabaee
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 4 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
111
Voted
ISCI
1998
82views more  ISCI 1998»
15 years 3 months ago
The ParaStation Project: Using Workstations as Building Blocks for Parallel Computing
The ParaStation communication fabric provides a high-speed communicationnetwork with user-levelaccess to enable e cientparallel computing on workstation clusters. The architecture...
Thomas M. Warschko, Joachim M. Blum, Walter F. Tic...
CAP
2010
14 years 10 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan