We are inviting IDEALS users, both people looking for materials in IDEALS and those who want to deposit their work, to give us feedback on improving this service through an interview. Participants will receive a $20 VISA gift card. Please sign up via webform.
Files in this item
application/pdfSphinx Parallelization.pdf (398kB)
|(no description provided)|
|Author(s):||Tuck, James M.; Baugh, Lee W.; Renau, Jose; Torrellas, Josep|
|Abstract:||Speech recognition applications challenge traditional out-of-order processors because of low cache locality and poor branch behavior. We observe that these symptoms may be mitigated my exploiting the existing parallelism in these algorithms. In this project, we exploit many levels of parallelism in Sphinx, a leading speech recognition system, to improve architectural utilization by decreasing cache miss rates and improving branch prediction. The resulting parallel implementation will be evaluated in several single and multiprocessor systems. Additionally, we plan to evaluate Sphinx in the novel M3T architecture. The contribution of this project can be classified as threefold: parallelizing Sphinx, evaluating it in several single processor and multiprocessor systems, and analyzing M3T's effectiveness in executing Sphinx. All the evaluations are performed with a new simulation environment developed especially for chip-multiprocessor environments.|
|Rights Information:||You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).|
|Date Available in IDEALS:||2009-04-20|