TOWARDS CACHE OPTIMIZATION IN FINITE
暂无分享,去创建一个
[1] Markus Kowarschik,et al. Maximizing Cache Memory Usage for Multigrid Algorithms , 2000 .
[2] William F. Smyth,et al. A taxonomy of suffix array construction algorithms , 2007, CSUR.
[3] R. D. Dowsing,et al. Computers: From Logic to Architecture , 1990 .
[4] Maxime Crochemore,et al. Algorithms on strings , 2007 .
[5] Bertrand Meyer,et al. Introduction to the Theory of Programming Languages , 1990 .
[6] John A. Moyne. Formal Languages and Automata , 1985 .
[7] Gonzalo Navarro,et al. Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences , 2002 .
[8] Derrick G. Kourie,et al. Dynamic Allocation of Finite Automata States for Fast String Recognition , 2006, Int. J. Found. Comput. Sci..
[9] David A. Patterson,et al. Computer Organization and Design, Fourth Edition, Fourth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design) , 2008 .
[10] Derrick G. Kourie,et al. Reordering finite automata states for fast string recognition , 2005, Stringology.
[11] Derrick G. Kourie,et al. Preliminary Experiments in Hardcoding Finite Automata , 2003, CIAA.
[12] Eric Rotenberg,et al. A Trace Cache Microarchitecture and Evaluation , 1999, IEEE Trans. Computers.
[13] Derick Wood,et al. The Grail papers: version 2.3 , 1995 .
[14] Edsger W. Dijkstra,et al. A method of programming , 1988 .
[15] Ken Thompson,et al. Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.
[16] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[17] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[18] Michael S. Waterman,et al. Introduction to Computational Biology: Maps, Sequences and Genomes , 1998 .
[19] G. Vichniac. Simulating physics with cellular automata , 1984 .
[20] David A. Patterson,et al. Computer Architecture: A Quantitative Approach , 1969 .
[21] Bruce W. Watson,et al. The design and implementation of the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .
[22] Bruce W. Watson,et al. Performance of hardcoded finite automata , 2006 .
[23] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.
[24] Bruce W. Watson,et al. Hardcoding finite state automata processing , 2003 .
[25] John W. Lockwood,et al. Implementation of a content-scanning module for an Internet firewall , 2003, 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2003. FCCM 2003..
[26] Frank DeRemer,et al. Efficient computation of LALR(1) look-ahead sets , 2004, SIGP.
[27] John W. Lockwood,et al. Internet Worm and Virus Protection in Dynamically Reconfigurable Hardware , 2003 .
[28] R. McNaughton. Elementary Computability, Formal Languages, and Automata , 1981 .
[29] David Loshin. Efficient Memory Programming , 1998 .
[30] Bruce W. Watson,et al. SPARE Parts: a C++ toolkit for string pattern recognition , 2004, Softw. Pract. Exp..
[31] Ceriel J. H. Jacobs,et al. Parsing Techniques - A Practical Guide , 2007, Monographs in Computer Science.
[32] Bruce W. Watson,et al. Taxonomy-based software construction of SPARE Time: a case study , 2005, IEE Proc. Softw..
[33] Andrew Chi-Chih Yao,et al. The Complexity of Pattern Matching for a Random String , 1977, SIAM J. Comput..
[34] Thomas J. Pennello,et al. Very fast LR parsing , 1986, SIGPLAN '86.
[35] A. Deutsch. Principles of biological pattern formation: swarming and aggregation viewed as selforganization phenomena , 1999, Journal of Biosciences.
[36] Randall Hyde,et al. The Art of Assembly Language , 2003 .
[37] John P. Hayes,et al. Computer Architecture and Organization , 1980 .
[38] John W. Lockwood,et al. Control and configuration software for a reconfigurable networking hardware platform , 2002, Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.
[39] Ernest Ketcha Ngassam,et al. Hardcoding finite automata , 2005 .