Sciweavers

448 search results - page 29 / 90
» On Parallel Pseudo-Random Number Generation
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
IPPS
2006
IEEE
14 years 3 months ago
GPU-ABiSort: optimal parallel sorting on stream architectures
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
Alexander Greß, Gabriel Zachmann
CSFW
2002
IEEE
14 years 2 months ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe
HPDC
2010
IEEE
13 years 11 months ago
Exploring the RNA folding energy landscape using scalable distributed cyberinfrastructure
The increasing significance of RNAs in transcriptional or post-transcriptional gene regulation processes has generated considerable interest towards the prediction of RNA folding ...
Joohyun Kim, Wei Huang, Sharath Maddineni, Fareed ...
HOTI
2008
IEEE
14 years 4 months ago
QsNetIII an Adaptively Routed Network for High Performance Computing
—In this paper we describe QsNetIII , an adaptively routed network for High Performance Computing (HPC) applications. We detail the structure of the network, the evolution of our...
Duncan Roweth, Trevor Jones