Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm
Miller P, Nadkarni P, Carriero N. Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm. Bioinformatics 1991, 7: 71-78. PMID: 2004277, DOI: 10.1093/bioinformatics/7.1.71.Peer-Reviewed Original ResearchConceptsSequence comparison algorithmAmount of computationMachine-independent parallel programming languageComparison algorithmsDisk I/OParallel programming languageParallel program runsO bottleneck problemDifferent parallel machinesBiological sequence comparisonNumber of processorsTime-consuming computationProgramming languageParallelization strategyParallel computationParallel machinesProgram design strategiesProgram runBottleneck problemFASTA algorithmFASTAAlgorithmComputationBottleneckGeneral problemParallel computation for biological sequence comparison: comparing a portable model to the native model for the Intel Hypercube.
Nadkarni P, Miller P. Parallel computation for biological sequence comparison: comparing a portable model to the native model for the Intel Hypercube. AMIA Annual Symposium Proceedings 1991, 404-8. PMID: 1807632, PMCID: PMC2247563.Peer-Reviewed Original ResearchConceptsMachine-independent parallel programming languageIntel HypercubeVirtual parallel machineParallel programming languageBiological sequence comparisonNumber of processorsParallel programmingParallel programsProgramming languageParallel computationDesktop workstationsParallel machinesProgramming commandsApplication areasPortable modelProcessorsLindaBenchmark testsNative modelsHypercubeParallelizationCase studyWorkstationsVersionMachine