A parallel computing approach to genetic sequence comparison: The master-worker paradigm with interworker communication
Sittig D, Foulser D, Carriero N, McCorkle G, Miller P. A parallel computing approach to genetic sequence comparison: The master-worker paradigm with interworker communication. Journal Of Biomedical Informatics 1991, 24: 152-169. PMID: 2036781, DOI: 10.1016/0010-4809(91)90027-t.Peer-Reviewed Original ResearchConceptsTuple spaceGenetic sequence comparisonC-LindaMachine-independent parallel programming languageComparison algorithmsSimilarity scoresParallel programming languageMaster-worker paradigmTest sequencesParallel computing approachTotal search timeSequence comparison algorithmComputing approachParallel programsProgramming languageParallel computersWorker processesParallel implementationSequent SymmetryMaster processSequential versionIntel HypercubeParallel versionString comparisonSearch timeParallel 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 problem