Sciweavers

2432 search results - page 44 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
LCPC
2000
Springer
15 years 1 months ago
Automatic Coarse Grain Task Parallel Processing on SMP Using OpenMP
This paper proposes a simple and efficient implementation method for a hierarchical coarse grain task parallel processing scheme on a SMP machine. OSCAR multigrain parallelizing c...
Hironori Kasahara, Motoki Obata, Kazuhisa Ishizaka
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 1 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
POPL
1996
ACM
15 years 1 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
CONCURRENCY
2002
112views more  CONCURRENCY 2002»
14 years 9 months ago
An analysis of VI Architecture primitives in support of parallel and distributed communication
We present the results of a detailed study of the Virtual Interface (VI) paradigm as a communication foundation for a distributed computing environment. Using Active Messages and ...
Andrew Begel, Philip Buonadonna, David E. Culler, ...
93
Voted
SRDS
1998
IEEE
15 years 1 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz