Sciweavers

195 search results - page 4 / 39
» Lock-Free Parallel Algorithms: An Experimental Study
Sort
View
PPOPP
2012
ACM
12 years 1 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
SC
2000
ACM
13 years 10 months ago
A Comparative Study of the NAS MG Benchmark across Parallel Languages and Architectures
Hierarchical algorithms such as multigrid applications form an important cornerstone for scientific computing. In this study, we take a first step toward evaluating parallel lan...
Bradford L. Chamberlain, Steven J. Deitz, Lawrence...
SAINT
2005
IEEE
13 years 12 months ago
A Case Study in Running a Parallel Branch and Bound Application on the Grid
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
Kento Aida, Tomotaka Osumi
IJPP
2010
137views more  IJPP 2010»
13 years 4 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis
IEEEHPCS
2010
13 years 4 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...