Data processing: software development – installation – and managem – Software program development tool – Code generation
Reexamination Certificate
2005-08-16
2005-08-16
Das, Chameli C. (Department: 2122)
Data processing: software development, installation, and managem
Software program development tool
Code generation
C717S116000, C717S107000, C717S104000, C715S252000, C715S252000
Reexamination Certificate
active
06931624
ABSTRACT:
In a programming model, a machine is represented in an object-oriented language by extending a Machine base class representing a state machine, to form a first class representing a first state machine. Each class extending the base class, includes at least one variable reflecting a state of the machine it represents. Also included are a method for receiving zero or more input parameters and advancing a state of the machine; a method for returning data reflecting a state of the machine; and an optional method that connects an output of one state machine to an input of another state machine. The state machines can be nested (as the classes extending the base class can be nested). A parallel program can be a single instance of a class extending the base class. All machine instances execute concurrently, regardless of where they are declared.
REFERENCES:
patent: 5652714 (1997-07-01), Peterson et al.
patent: 5801687 (1998-09-01), Peterson et al.
patent: 5907704 (1999-05-01), Gudmundson et al.
patent: 5920718 (1999-07-01), Uczekaj et al.
patent: 6038590 (2000-03-01), Gish
patent: 6222537 (2001-04-01), Smith et al.
patent: 6289252 (2001-09-01), Wilson et al.
patent: 6397355 (2002-05-01), Curtis et al.
patent: 6463565 (2002-10-01), Kelly et al.
patent: 6477439 (2002-11-01), Bernaden et al.
patent: 6505342 (2003-01-01), Hartmann et al.
patent: 6665648 (2003-12-01), Brodersen et al.
patent: 6691299 (2004-02-01), Hart et al.
patent: 6754786 (2004-06-01), Suzuki et al.
TITLE: Object-Oriented State Machines: Subclassing, Composition, Delegation, and Genericity, author: Sane et al, ACM, 1995.
B, Ramakrishna Rau, “Iterative Modulo Scheduling”, Nov. 1995, pp. 1-67.
S. E. Mitchell and A.J. Wellings, “TAO: A Model For Concurrency in Object-Oriented Programming”, Dec. 13, 1993, pp. 1-29.
Matt Bowen, Embedded Solutions Application Note 002, “Handel-C and the Alex APAC509”, Feb. 6, 1998, pp. 1-4.
Peter Clarke and Richard Goering, EE Times, “C Level Fields C + + Class Library”, Aug. 30, 2000, pp. 1-4.
Chris Edwards, Electronics Times, “Panel Weight Hardware, Software Design Options”, Aug. 30, 2000, pp. 1-4.
Whitepaper: Forge-J. Lavalogic, “Forge-J”, Aug. 30, 2000, pp. 1-8.
Brass Research Group, “Automatic C Compilation to SW + Reconfigurable HW”, Aug. 30, 2000, pp. 1-3.
Maya Gokhale and Brian Schott, “Data-Parallel C on Revonfigurable Logic Array”, 1995, pp. 291-313.
Peter L. Flake, Simon J. Davidmann and David J. Kelf, Co-Design Automation, “Superlog Evolving Verilog and C For System-on-Chip Design”, Mar. 8, 2000, pp. 1-7.
Don Davis, Lavalogic“Java For Digital Circuit Design”, Aug. 30, 2000, pp. 1-5.
David Galloway, “The Transmogrifier C Hardware Description Language and Compiler For FPGAs”, 1995, pp. 136-144.
Walter Lee, Rajeev Barua, Matthew Frank, Devabhaktuni Srikrishna, Jonathan Babb, Vivek Sarkar, and Saman Amarasinghe, “Space-Time Scheduling of Instruction-Level Parallelism on a Raw Machine”, Oct. 1998, pp. 1-11.
Jonathan Babb, Matthew Frank, Victor Lee, Elliot Waingold, Rahee Barua, Michael Taylor, Jang Kim, Srikrishna Devabhaktuni, and Anant Agarwal, “The Raw Benchmark Suite: Computation Structure For General Purpose Computing”, 1997, pp. 1-10.
Rajeev Barua, Walter Lee, Saman Amarasinghe, Anant Agarwal, “Maps: A Complier-Managed Memory System For Raw Machines”, Jun. 1999, pp. 1-22.
Joao M.P. Cardoso and Horacio C. Neto, “Fast Hardware Compilation of Behaviors into an FPGA-Based Dynamic Reconfigurable Computing System”, 1999, pp. 150-153.
Lars E. Thon, Ken Rimey and Lars Svensson, “From C To Silicon”, Feb. 8, 2000, pp. 1-14.
Christian Iseli and Eduardo Sanchez, “A C + + Complier For FPGA Custom Execution Units Syntheses”, 1995, pp. 173-179.
Xiaohan Zhu and Bill Lin, “Hardware Compilation for FPGA-based Configurable Computing Machines”, 1999, pp. 1-6.
Niklaus Wirth, “Hardware Compilation: Translating Programs into Circuits”, Jun. 1998, pp. 25-31.
Jonathan Babb, Martin Rinard, Csaba Andras Moritz, Walter Lee, Matthew Frank, Rajeev Barua, and Saman Amarasinghe, “Parallelizing Applications into Silicon”, 1999, pp. 70-80.
Timothy J. Callahan and John Wawrzynek, “Instruction-Level Parallelism For Reconfigurable Computing”, 1998, pp. 1-6.
D. Ku and G. DeMicheli, “HardwareC-A Language For Hardware Design (Version 2.0)”, Technical Report SCSL/CSL/TR-90-419, Computer Systems Laboratory, Stanford University, Stanford, LA, Aug. 1990, pp. 1-50.
S. Vernalde, P. Schaumont and I. Bolsens, “An Object Oriented Programming Approach For Hardware Design”, 1999, pp. 1-6.
Robert Schreiber, Shail Aditya, B. Ramakrishna Rau, Vinod Kathail, Scott Mahlke, Santosh Abraham, Greg Snider, and Sadun Anik, “High-Level Synthesis of Nonprogrammable Hardware Accelerators”, May 2000, pp. 1-5.
Das Chameli C.
Hewlett--Packard Development Company, L.P.
LandOfFree
Programming method and model for expressing synchronous,... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Programming method and model for expressing synchronous,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Programming method and model for expressing synchronous,... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3501434