432 search results - page 48 / 87 » Internally deterministic parallel algorithms can be fast |
135
Voted
EGH
2010
Springer
14 years 12 months ago
2010
Springer
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...
119
click to vote
CSL
2005
Springer
15 years 7 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
114
click to vote
HPDC
2010
IEEE
15 years 3 months ago
2010
IEEE
We introduce LogGOPSim--a fast simulation framework for parallel algorithms at large-scale. LogGOPSim utilizes a slightly extended version of the well-known LogGPS model in combin...
116
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
132
Voted
SIAMJO
2010
14 years 8 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...