On the extraction and analysis of prevalent dataflow patterns

Proceedings of the 2004 7th Annual IEEE International Workshop on Workload Characterization, WWC-7

Volumn , Issue , 2004, Pages 11-18

  Sassone, Peter G ^a   Wills, D Scott ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATAFLOW PATTERNS; DYNAMIC INSTRUCTIONS; INSTRUCTION SET ARCHITECTURE (ISA); WORKLOADS;

CODES (SYMBOLS); COMPUTER ARCHITECTURE; COMPUTER SIMULATION; GRAPH THEORY; OPTIMIZATION; PROGRAM COMPILERS;

DATA FLOW ANALYSIS;

EID: 19644386332     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Aho, R. Sethi, and J. Ulman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. G. Araujo, P. Centoducatte, M. Cortes, and R. Pannain. Code compression using operand factorization. In Proceedings of the International Symposium on Microarchitecture, Dec. 1998.
3. D. Burger and T. Austin. The Simplescalar tool set, version 2.0. Technical Report 1342, University of Wisconsin-Madison Computer Science Dept., 1997.
4. N. Clark, H. Zhong, and S. Mahlke. Processor acceleration through automated instruction set customization. In Proceed ings of the International Symposium on Microarchitecture, Dec. 2003.
5. P. Foggia, C. Sansone, and M. Vente. A performance comparison of five algorithms for graph isomorphism. In Proceedings of the Workshop on Graph-based Representations in Pattern Recognition, May 2001.
6. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979.
7. L. Gwennap. Digital 21264 sets new standard. Microprocessor Report, pages 11-16, Oct. 1996.
8. H. Kim and J. Smith. Instruction-level distributed processing. In Proceedings of the International Symposium on Computer Architecture, May 2002.
9. I. Kim and M. Lipasti. Half-price architecture. In Proceedings of the International Symposium on Computer Architecture, June 2003.
10. B. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
11. B. Mckay. Nauty users' guide. Technical Report TR-CS-94-10, Australian National University, 1994.
12. S. Palacharla, N. Jouppi, and J. Smith. Complexity-effective superscalar processors. In Proceedings of the International Symposium on Computer Architecture, May 1997.
13. P. Sassone and D. Wills. Dynamic strands: Collapsing speculative dependence chains for reducing pipeline communication. In Proceedings of the International Symposium on Microarchitecture, Dec. 2004.
14. P. Sassone and D. Wills. Multicycle bypass: Too readily overlooked. In Proceedings of the Workshop on Complexity-Effective Design, June 2004.
15. F. Spadini, M. Fertig, and S. Patel. Characterization of repeating dynamic code fragments. Technical Report CRHC-02-09, University of Illinois at Urbana-Champaign, 2002.
16. S. Yehia and O. Temam. From sequences of dependent instructions to functions: A complexity-effective approach for improving performance without ILP or speculation. In Proceedings of the International Symposium on Computer Architecture, June 2004.