Method and apparatus for cycle-based computation

Details Method and apparatus for cycle-based computation Method and apparatus for cycle-based computation

2006-04-25

2006-04-25

Khatri, Anil (Department: 2193)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S136000, C719S323000

Reexamination Certificate

active

07036114

ABSTRACT:
A computer system for cycle-based computation includes a processor array, a translation component adapted to translate a cycle-based design, a host computer operatively connected to the processor array and to the translation component, a data connection component interconnecting a plurality of members of the processor array using static routing, a synchronization component enabling known timing relationships among the plurality of members of the processor array, a host service request component adapted to send a host service request from a member of the processor array to the host computer, and an access component adapted to access a portion of a state of the processor array and a portion of a state of the data connection.

REFERENCES:
patent: 4885684 (1989-12-01), Austin et al.
patent: 5121498 (1992-06-01), Gilbert et al.
patent: 5274818 (1993-12-01), Vasilevsky et al.
patent: 5561802 (1996-10-01), Orimo et al.
patent: 5872990 (1999-02-01), Luick et al.
patent: 5913925 (1999-06-01), Kahle et al.
patent: 6021274 (2000-02-01), Reed et al.
patent: 6058266 (2000-05-01), Megiddo et al.
patent: 6059841 (2000-05-01), Caracuzzo
patent: 6070011 (2000-05-01), Liu et al.
patent: 6438747 (2002-08-01), Schreiber et al.
patent: 6507947 (2003-01-01), Schreiber et al.
patent: 6772299 (2004-08-01), McWilliams et al.
patent: 6792599 (2004-09-01), Poulsen et al.
patent: 6925634 (2005-08-01), Hunter et al.
patent: 1 107 116 (2001-06-01), None
Gross et al, “Compilation for a high performance systolic array”, ACM pp 27-38, 1986.
Cabodi et al, “Computing times transition relations for sequential based simulation”, ACM poc. of the conf. on design, automation tested in Europe, article No. 4, pp 1-5, 1999.
Kanellakis et al, “Efficient parallel algorithms on restartable fail stop procesors”, ACM pp 23-36, 1991.
Mendelson et al, “Mapping data flow programs on aVLSI array of processors”, ACM pp 72-80, 1987.
Hwang, Jing-Jang, Chow, Yuan-Chieh, Anger, Frank D., Lee, Chung-Yee; “Scheduling Precedence Graphs in Systems with Interprocessor Communication Times;” Journal; Apr. 1989; pp. 244-257; vol. 18, No. 2; Siam Journal Computing.
Wu, Min-You and Gajski, Daniel D.; “Hypertool: A Programming Aid For Message-Passing Systems;” Jul. 1990; pp. 1-26; vol. 1, No. 3; IEEE Transactions On Parallel and Distributed Systems.
Dally, William J., Fiske, J.A. Stuart, Keen, John S., Lethin, Richard A., Noakes, Michael D., Nuth, Peter R., Davison, Roy E., Fyler, Gregory A.; “The Message-Driven Processor, A Multicomputer Processing Node with Efficient Mechanisms;” Apr. 1992; pp. 23-39; IEEE Micro.
Sih, Gilbert C., Lee, Edward A. Lee; “A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures;” Feb. 1993; pp. 175-187; vol. 4, No. 2; IEEE Transactions On Parallel and Distributed Systems.
Yang, Tao and Gerasoulis, Apostolos; “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors;” Sep. 1994; pp. 1-36; vol. 5, No. 9; IEEE Transactions On Parallel and Distributed Systems.
Alpert, Charles J. and Kahng, Andrew B.; “Recent Directions in Netlist Partitioning: A Survey;” 1995; pp. 1-93; UCLS Computer Science Department.
Kwok, Yu-Kwong, Ahmad, Ishfaq; “Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors;” May 1996; pp. 506-521; vol. 7, No. 5; IEEE Transactions On Parallel and Distributed Systems.
Quickturn Cobalt Webpage; “Quickturn Boosts Speed, Flexibility in CoBALT 2.0;” Apr. 20, 1998; pp. 1-4.
Vivek Sarkar; “Partitioning and Scheduling Parallel Programs for Multiprocessors;” Copyright 1989, pp. 1-201, The MIT Press.
C. Ajluni; “Advanced Emulation Tool Targets High-Speed Functional Verification”; vol. 45, No. 5, pp. 80, 82; Mar. 3, 1997; Electronic Design, Penton Publishing, USA.
European Search Report dated Apr. 21, 2004 (5 pgs.).

Affiliated with

Also associated with

Rating

Method and apparatus for cycle-based computation 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 and apparatus for cycle-based computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for cycle-based computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3525729