Sciweavers

3656 search results - page 348 / 732
» Parallel programming in Split-C
Sort
View
DAM
2007
107views more  DAM 2007»
15 years 6 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SAC
2009
ACM
16 years 1 months ago
GTfold: a scalable multicore code for RNA secondary structure prediction
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
Amrita Mathuriya, David A. Bader, Christine E. Hei...
EUROPAR
1998
Springer
15 years 10 months ago
Analysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
Jonathan M. D. Hill, Stephen A. Jarvis, Constantin...
PC
2006
103views Management» more  PC 2006»
15 years 6 months ago
Is MPI suitable for a generative design-pattern system?
Generative parallel design patterns is a proven technique to improve the productivity of parallel program development. However many of the generative design-pattern systems are de...
Paras Mehta, José Nelson Amaral, Duane Szaf...