Fully scalable computer architecture

Data processing: structural design – modeling – simulation – and em – Structural design

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S011000, C712S015000, C712S016000

Reexamination Certificate

active

06996504

ABSTRACT:
A scalable computer architecture capable of performing fully scalable simulations includes a plurality of processing elements (PEs) and a plurality of interconnections between the PEs. In this regard, the interconnections can interconnect each processing element to each neighboring processing element located adjacent the respective processing element, and further interconnect at least one processing element to at least one other processing element located remote from the respective at least one processing element. For example, the interconnections can interconnect the plurality of processing elements according to a fractal-type method or a quenched random method. Further, the plurality of interconnections can include at least one interconnection at each length scale of the plurality of processing elements.

REFERENCES:
patent: 4805091 (1989-02-01), Thiel et al.
patent: 5598408 (1997-01-01), Nickolls et al.
patent: 5603044 (1997-02-01), Annapareddy et al.
patent: 5675743 (1997-10-01), Mavity
patent: 5689677 (1997-11-01), MacMillan
patent: 5737628 (1998-04-01), Birrittella et al.
patent: 5794005 (1998-08-01), Steinman
patent: 5801938 (1998-09-01), Kalantery
patent: 5832272 (1998-11-01), Kalantery
patent: 5859983 (1999-01-01), Heller et al.
patent: 5903771 (1999-05-01), Sgro et al.
patent: 5920714 (1999-07-01), Schiffleger
patent: 6134514 (2000-10-01), Liu et al.
patent: 6138166 (2000-10-01), Heller et al.
patent: 6138167 (2000-10-01), Heller et al.
patent: 6167502 (2000-12-01), Pechanek et al.
patent: 6230252 (2001-05-01), Passint et al.
Yi-Bing Lin, Paul A Fishwick;Asynchronous Parallel Discrete Event Simulation; IEEE Transactions on Systems, Man and Cybernetics; 1995; pp. 1-33; vol. XX, No. Y.
G. Korniss, Z. Toroszkai, M.A. Novotny, P.A. Rikvold;From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth; Feb. 2000; pp. 1-4; arXiv:cond-mat/9909114v2 Feb. 1, 2000.
G. Korniss, M.A. Novotny, Z. Toroczkai, P.A. Rikvold;Non-equilibrium Surface Growth and Scalability of Parallel Algorithms for Large Asynchronous Systems; Feb. 29, 2000; pp. 1-5.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Fully scalable computer architecture does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fully scalable computer architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fully scalable computer architecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3674425

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.