System for partitioning a massively parallel computer

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 3642282, 364229, 364230, 3642321, 364239, 364240, 3642419, G06F 1300

Patent

active

051290774

ABSTRACT:
A method and apparatus are described for improving the utilization of a parallel computer by allocating the resources of the parallel computer among a large number of users. A parallel computer is subdivided among a large number of users to meet the requirements of a multiplicity of databases and programs that are run simultaneously on the computer. This is accomplished by dividing the parallel computer into a plurality of processor arrays, each of which can be used independently of the others. This division is made dynamically in the sense that the division can readily be altered and indeed in a time sharing environment may be altered between two successive time slots of the frame. Further, the parallel computer is organized so as to permit the simulation of additional parallel processors by each physical processor in the array and to provide for communication among the simulated parallel processors. These simulated processors may also be stored, in virtual memory. As a result of this design, it is possible to build a parallel computer with a number of physical processors on the order of 1,000,000 and a number of simulated processors on the order of 1,000,000,000,000. Moreover, since the computer can be dynamically reconfigured into a plurality of independent processor arrays, a device this size can be shared by a large number of users with each user operating on only a portion of the entire computer having a capacity appropriate for the problem then being addressed.

REFERENCES:
patent: 4247892 (1981-01-01), Lawrence
patent: 4523273 (1985-06-01), Adams, III et al.
patent: 4598400 (1986-07-01), Hillis
patent: 4639857 (1987-01-01), McCanny et al.
patent: 4644496 (1987-02-01), Andrews
patent: 4722084 (1988-01-01), Morton
patent: 4733353 (1988-03-01), Jaswa
patent: 4748585 (1988-05-01), Chiarulli et al.
Ian R. Greenshields, "Dynamically Reconfigurable, Yector-Slice Processor", IEEE Proceedings, vol. 129, Pt. E, No. 5 (Sep. 1982), pp. 207-215.
Lin et al."Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor." IEEE Transactions on Computers, vol. C-35, No. 10 (Oct. 1986), pp. 910-915.
Tsutomu Hoshino "An Invitation to the World of PAX." IEEE Computer, (May 1986), pp. 68-80, 0018-9162/86/0500-0068$01.00.
Charles L. Seitz, "The Cosmic Cube", Communications of the ACM, vol. 28, No. 1 (Jan. 1985), pp. 22-33.
Preparata et al. "The Cube-Connected Cycles: A Versatile Network for Parallel Computation." Communications of the ACM, vol. 24, No. 5 (May 1981), pp. 300-309.
Hillis W. D. "Chapter 4 The Prototype." In: The Connection Machine (Massachusetts, MIT, 1985), pp. 71-90, 145-172.
NCR45CG72 GAPP Application Note No. 3, Ohio, NCR Corporation, 1985, pp. 1-23.
NCR45CG72, Ohio, NCR Corporation, 1984, pp. 1-12.
Hillis, W. D. "The Connection Machine", Massachusetts, MIT (1981), pp. 1-21, 23-29. A.I. Memo No. 646.
Kenneth E. Batcher "Design of a Massively Parallel Processor." IEEE Transactions on Computers, vol. C-29, No. 9 (Sep. 1980), pp. 836-840.
Asbury et al. "Concurrent Computers Ideal for Inherently Parallel Problems." Computer Design, (Sep. 1, 1985), pp. 99-102, 104, 106-107.

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

System for partitioning a massively parallel computer does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for partitioning a massively parallel computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for partitioning a massively parallel computer will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1836810

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