Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2007-08-08
2011-11-01
Khatri, Anil (Department: 2191)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
C717S142000, C717S148000
Reexamination Certificate
active
08051411
ABSTRACT:
A method for copy propagations of a processor including two clusters, each cluster comprising a first function unit and a second function unit, a first local register file and a second local register file being respectively accessible by the first and second function unit only, and a global register file having a ping-pong structure to access the first and second local register files, the method comprising the steps of: (a) listing possible copy propagation paths between two nodes of a data flow graph; (b) calculating a profit of machine cycles for each of the copy propagation paths according to constraints of the processor; and (c) performing a copy propagation through the copy propagation path if the profit thereof is greater than a threshold value.
REFERENCES:
patent: 4693896 (1987-09-01), Wheatley et al.
patent: 5287490 (1994-02-01), Sites
patent: 5507030 (1996-04-01), Sites
patent: 5857097 (1999-01-01), Henzinger et al.
patent: 5973202 (1999-10-01), Sezi et al.
patent: 6016399 (2000-01-01), Chang
patent: 6112317 (2000-08-01), Berc et al.
patent: 6286135 (2001-09-01), Santhanam
patent: 6427234 (2002-07-01), Chambers et al.
patent: 6651247 (2003-11-01), Srinivasan
patent: 6883165 (2005-04-01), Blandy et al.
patent: 6986131 (2006-01-01), Thompson et al.
patent: 7107568 (2006-09-01), Cronquist
patent: 7426721 (2008-09-01), Saulpaugh et al.
patent: 7614044 (2009-11-01), Bhansali et al.
patent: 7730464 (2010-06-01), Trowbridge
patent: 7782873 (2010-08-01), Sharma et al.
patent: 7793273 (2010-09-01), Mercer et al.
patent: 7941460 (2011-05-01), Bar-Or et al.
Knerr et al, “task scheduling for power optimisation of multi frequency synchronous data flow graphs”, ACM SBCCI, pp. 50-55, 2005.
Horstmannshoff et al, “Efficient building block based RTL code generation from synchronous data flow graphs”, ACM 552-555, 2000.
Jong, “Data flow graphs: system apecification with most unrestricted semantics”, IEEE, pp. 401-405.
Ghamarian et al, Parametric throughput analysis of synchronous data flow graphs, ACM EDAA, pp. 116-121, 2008.
Mohanty et al, “A model based extensible framework fro efficient application design using FPGA”, ACM Trans. design Automation of Elec. Sys. vol. 12, No. 2, article 13, pp. 1-26, 2007.
Bazargan et al, “Integrating scheduling and physical design into a coherent compilation cycle for reconfigurable computing architectures”, ACM DAC, pp. 635-640, 2001.
Chen Sheng Yuan
Lee Jenq Kuen
Wu Chung Ju
Khatri Anil
King Anthony
National Tsing Hua University
WPAT, P.C.
LandOfFree
Method for copy propagations for a processor with... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for copy propagations for a processor with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for copy propagations for a processor with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4280405