Sciweavers

77 search results - page 8 / 16
» Efficient Parallel Pseudo-random Number Generation
Sort
View
APPT
2005
Springer
15 years 5 months ago
Contention-Free Communication Scheduling for Irregular Data Redistribution in Parallelizing Compilers
Abstract. The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute d...
Kun-Ming Yu, Chi-Hsiu Chen, Ching-Hsien Hsu, Chang...
106
Voted
ICALP
2009
Springer
16 years 1 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ICPADS
1994
IEEE
15 years 3 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
BMCBI
2011
14 years 3 months ago
Efficient alignment of pyrosequencing reads for re-sequencing applications
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
Francisco Fernandes, Paulo G. S. da Fonseca, Lu&ia...
ICS
2010
Tsinghua U.
15 years 2 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...