Sciweavers

795 search results - page 78 / 159
» Efficient Coupling of Parallel Applications Using PAWS
Sort
View
ASPLOS
1992
ACM
15 years 4 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
136
Voted
CPHYSICS
2010
184views more  CPHYSICS 2010»
15 years 20 days ago
Parallel Newton-Krylov-Schwarz algorithms for the three-dimensional Poisson-Boltzmann equation in numerical simulation of colloi
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
Feng-Nan Hwang, Shang-Rong Cai, Yun-Long Shao, Jon...
111
Voted
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
16 years 1 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
104
Voted
CLUSTER
2006
IEEE
15 years 19 days ago
Performance of parallel communication and spawning primitives on a Linux cluster
The Linux cluster considered in this paper, formed from shuttle box XPC nodes with 2 GHz Athlon processors connected by dual Gb Ethernet switches, is relatively easily constructed...
David J. Johnston, Martin Fleury, Michael Lincoln,...
EGH
2010
Springer
14 years 10 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...