The UCSC Kestrel parallel processor
Authors:
- D.M. DahleDDD.M. Dahle
- M. DiekhansMDM. Diekhans
- L. GrateLGL. Grate
- J. HirschbergJHJ. Hirschberg
- K. KarplusKKK. Karplus
- H. KellerHKH. Keller
- M. KendrickMKM. Kendrick
- F.J. Mesa-MartinezFMF.J. Mesa-Martinez
- D. PeaseDPD. Pease
- E. RiceERE. Rice
- A. SchultzASA. Schultz
- 17 January 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 16 (1) , 80-92
Abstract
The architectural landscape of high-performance computing stretches from superscalar uniprocessor to explicitly parallel systems, to dedicated hardware implementations of algorithms. Single-purpose hardware can achieve the highest performance and uniprocessors can be the most programmable. Between these extremes, programmable and reconfigurable architectures provide a wide range of choice in flexibility, programmability, computational density, and performance. The UCSC Kestrel parallel processor strives to attain single-purpose performance while maintaining user programmability. Kestrel is a single-instruction stream, multiple-data stream (SIMD) parallel processor with a 512-element linear array of 8-bit processing elements. The system design focuses on efficient high-throughput DNA and protein sequence analysis, but its programmability enables high performance on computational chemistry, image processing, machine learning, and other applications. The Kestrel system has had unexpected longevity in its utility due to a careful design and analysis process. Experience with the system leads to the conclusion that programmable SIMD architectures can excel in both programmability and performance. This work presents the architecture, implementation, applications, and observations of the Kestrel project at the University of California at Santa Cruz.Keywords
This publication has 30 references indexed in Scilit:
- Processor autonomy and its effect on parallel program execution2002
- Explicit SIMD programming for asynchronous applications2002
- High Speed Homology Search with FPGAs2001
- Sequence Analysis With the Kestrel SIMD Parallel Processor2000
- Sequence comparisons using multiple sequences detect three times as many remote homologues as pairwise methodsJournal of Molecular Biology, 1998
- Reduced space sequence alignmentBioinformatics, 1997
- Hidden Markov Models in Computational BiologyJournal of Molecular Biology, 1994
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975