Heuristic Instruction Scheduling Algorithm Using Available Distance for Partial Forwarding Processor-Reference-Cited by-同舟云学术

Heuristic Instruction Scheduling Algorithm Using Available Distance for Partial Forwarding Processor

Published:2009 Issue:12 Volume:E92-A Page:3258-3267
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

HIEDA Takuji¹,TANAKA Hiroaki¹,SAKANUSHI Keishi¹,TAKEUCHI Yoshinori¹,IMAI Masaharu¹

Affiliation:

1. Department of Information Systems Engineering, Graduate School of Information Science and Technology, Osaka University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

http://www.jstage.jst.go.jp/article/transfun/E92.A/12/E92.A_12_3258/_pdf

Reference20 articles.

1. [1] M. Imai, “ASIP meister: A configurable processor core development system, ” Proc. ITI 3rd International Conference on Information & Communications Technology, 2005.

2. [2] P.S. Ahuja, D.W. Clark, and A. Rogers, “The performance impact of incomplete bypassing in processor pipelines, ” Proc. MICRO-28, pp.36-45, 1995.

3. [3] J.L. Hennessy and D.A. Patterson, Computer architecture: A quantitative approach, Second ed., Morgan Kaufmann, 1996.

4. [4] S. Radhakrishnan, H. Guo, S. Parameswaran, and A. Ignjatovic, “Application specific forwarding network and instruction encoding for multi-pipe ASIPs, ” Proc. International Conference on Hardware-Software Codesign and System (CODES+ISSS), pp.241-246, 2006.

5. [5] A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986.