1992
Parallel Computation for Medicine and Biology: Applications of Linda At Yale University
Sittig D, Shifman M, Nadkarni P, Miller P. Parallel Computation for Medicine and Biology: Applications of Linda At Yale University. The International Journal Of High Performance Computing Applications 1992, 6: 147-163. DOI: 10.1177/109434209200600203.Peer-Reviewed Original ResearchMolecular dynamics simulation on a network of workstations using a machine-independent parallel programming language
Shifman M, Windemuth A, Schulten K, Miller P. Molecular dynamics simulation on a network of workstations using a machine-independent parallel programming language. Journal Of Biomedical Informatics 1992, 25: 168-180. PMID: 1582193, DOI: 10.1016/0010-4809(92)90019-7.Peer-Reviewed Original ResearchConceptsMachine-independent parallel programming languageParallel programming languageProgramming languageShared memory parallel computerHigh performance Unix workstationsNetwork of workstationsParallel computing approachMemory parallel computersComputing approachNetworked workstationsUNIX workstationsParallel computersExpensive phaseEffective algorithmResearch communityPerformance benchmarksWorkstationsAlgorithmNetworkGlobal motionLanguageComputerLindaSimulationsBenchmarks
1991
Molecular dynamics simulation on a network of workstations using a machine-independent parallel programming language.
Shifman M, Windemuth A, Schulten K, Miller P. Molecular dynamics simulation on a network of workstations using a machine-independent parallel programming language. AMIA Annual Symposium Proceedings 1991, 414-8. PMID: 1807634, PMCID: PMC2247565.Peer-Reviewed Original ResearchConceptsMachine-independent parallel programming languageParallel programming languageProgramming languageShared memory parallel computerHigh performance Unix workstationsNetwork of workstationsParallel computing approachMemory parallel computersComputing approachNetworked workstationsUNIX workstationsParallel computersExpensive phaseEffective algorithmResearch communityPerformance benchmarksWorkstationsAlgorithmNetworkGlobal motionLanguageComputerLindaSimulationsBenchmarksParallel 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