JPH02118760A - Multi-processor system and utilization thereof - Google Patents

Abstract

PURPOSE: To simultaneously operate plural processors and to surely execute an unequivocal operation without fuzziness by permitting a network to collectively inspect all readiness states on a prescribed task or event and selecting one most preferential message. CONSTITUTION: The network 50 and plural micro-processors can be used as address locators locating transaction numbers to a part allocated for storing the status of a transaction in a memory 26. When an inquiry is received from the network 50, the status of the processor is communicated and priority on it is judged in the network 50. At that time, priority is given to the readiness state whose completion degree is the lowest. Thus, speedy responses in terms of hardware from all the processors for one inquiry can be obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a multiprocessor system and a method of using the same.

(Prior Art) Ever since the emergence of highly reliable electronic computers, those working in this technical field have repeatedly considered systems that use multiple computers. There is a system in which a single given task is executed as a whole by having these computers operate in a manner that maintains a relationship with each other. In some such multiprocessor systems, one large computer takes advantage of its own superior speed and capacity to execute complex parts of a program and also perform less complex tasks. (delegating less urgent tasks to smaller, slower satellite processors), thereby reducing the burden on the large computer and the amount of requests made to the large computer. In this case, the large computer is responsible for allocating subtasks, for keeping the small processors (=satellite processors mentioned above) always operational, for checking the availability and operating efficiency of these small processors, and for unifying them. The organization must be responsible for ensuring that the results obtained are achieved.

Another type of multiprocessor system that uses a different approach is one that uses multiple processors and a common bus system, where the processors are essentially identical to each other. There are systems that have this functionality. These types of systems often use a control computer or system that is independent of the rest of the system to monitor the availability and processing power of individual processors for a given subtask, and to The task and information transfer route are controlled. Additionally, each processor may be configured and operated such that it can itself monitor the status and availability of other processors and route messages and programs. . A significant drawback common to the various systems described above is that software is required and operating time is consumed to perform overhead and maintenance functions, thereby preventing the performance of the intended purpose. will be affected. The amount of work involved in determining and monitoring forwarding paths increases quadratically with the total number of processors involved in those tasks, until an inappropriate amount of effort is expended on overhead functions. There is also.

The following several patent publications are illustrative of prior art.

U.S. Patent Publication No. 3,962,685 - Belle 15le, No. 1, 9
1i2,706 - Dennis Chima No. 4
．． Q'16,566 - Jorie Ground No. 4,096,567 - Millard
) and others No. 4,130,8 [i5-Hear
t) Chima No. 4,136,386 1 Annunziata Chima No. 4
．． No. 145.739 - Dunning No. 4.151,592 - Suzuki
Already around the time when Hatsuhitomo's Binac (using two processors connected in parallel) and various similar systems were used, multiprocessor systems were known to provide redundant execution capabilities. It was recognized that this could significantly improve the overall reliability of the operating system. To date, there have been considerable limitations, primarily due to the sheer size of the software. downtime (outage time)
Since multiprocessor operation is particularly advantageous in various situations where the However, overhead required a significant amount of software and operating time. Such a conventional system is described in U.S. Patent Publication No. 3.445,82.
No. 2, No. 3,566.363, and i:l, 59
A specific example is given in No. 3,300. These patent publications all relate to systems in which multiple combinators access a single main memory that is shared among them, and in which they further distribute tasks to individual processors. In order to make an allocation, processing capacity and processing demand are compared.

Yet another example of prior art is U.S. Pat.
There is No. 99,233. In the system of this publication, multiple processors share one bus, and a control unit with built-in buffer registers is used to transfer data blocks between the sending and receiving miniprocessors. transfer is performed. This system concept is used in Europe for a decentralized mail sorting system.

U.S. Pat. No. 4,228,496 relates to a commercially successful multiprocessor system,
In this system, multiple buses provided between multiple processors are connected to a bus controller, and this bus controller monitors the data transmission status and prioritizes multiple data transfers between processors. Ranking is being determined. Furthermore, each processor can be connected to control one of the plurality of peripheral devices.

"Ethernet" system jointly promoted by Xerox, Hewlett-Paracard, and Intel (U.S. Pat. No. 4,083.220 and U.S. Pat. No. 4.099)
No. 024) presents yet another approach to addressing the problem of intercommunication between multiple processors as well as peripheral bags. All units (+=processors, peripherals, etc.) are connected to a multiple access network that is shared among them, and the units will compete with each other for priority.

Collision detection is performed in a time-first manner, which makes global processing power difficult to control, coordinate, and articulate.

In order to fully understand the various systems described above in their details, it is necessary to analyze in detail the patent publications mentioned above and other related references. However, when task sharing is used, these systems all require a significant amount of intercommunication and administrative control to determine priority and select processors for data transfers. This can be understood from a simple overview. The problems encountered when expanding a system to include more processors vary from system to system, but all of the above systems Such expansions add complexity to the system software, application programming, hardware, or all three. Also, as will be appreciated with some consideration, the use of one or two logically passive ohmic buses imposes inherent limitations on the size and power of multiprocessor systems. is imposed on. There are a variety of techniques that can be employed to make intercommunication easier; an example is shown in recently issued U.S. Pat. No. 4,240,143. However, there are techniques such as grouping subsystems into global resources, but when a large number of processors are used, the amount of traffic that can be used naturally reaches its limit. Sisters,
Also, since the delay time takes various values,
An insurmountable problem has arisen. Situations may occur where one or more processors become locked out or deadlocked, and handling such situations requires additional circuitry and software to resolve the problem. Needed. From the above, it is clear that conventionally it was not practical to significantly expand the number of processors to, for example, 1024 processors.

In many different applications, it is desirable to escape the limitations of existing techniques described above and take full advantage of the latest techniques. The lowest-cost techniques currently available are those based on mass-produced microprocessors and large-capacity rotating disk storage devices, such as teeth,
There is a device manufactured by Winchiesta Technology that has a very small gap between the head and the disk inside a closed case. When expanding a multiprocessor system, it is desirable to be able to expand the system without unduly complicating the software, and furthermore, to ensure that the software does not become complicated at all as the expansion occurs. There is even a demand for the ability to expand in this way. Furthermore, there is a need for the ability to process computer problems characterized by a distributed structure in which the overall functionality can be dynamically subdivided into multiple processing tasks that are performed in a limited or iterative manner. . Almost all database machines belong to such problem areas, and this problem area also includes sorting, pattern recognition and correlation calculations, digital filtering, and large-scale matrix calculations. , simulation of physical systems, and other typical problem examples are also included. In any situation where any of these processes is performed, it is necessary to keep the multiple tasks to be processed individually relatively simple and to distribute these tasks over a wide range, which results in a large instantaneous task load. Become something. Such a situation has been very difficult for traditional multiprocessor systems because it increases the amount of time spent on overhead and the amount of software for overhead. This is due to the fact that it has a tendency to cause problems, and that it causes practical problems in configuring the system. For example, when a passive shared bus is employed, propagation speed and data transfer time are absolute barriers to the possible processing speed of processing transactions.

Database machines are therefore a good example of the need for improvements in multiprocessor systems.

Three basic methods for configuring large-scale database machines have been proposed so far: a hierarchical method, a network method, and a relational method. Among these, relational database machines allow users to easily access given data in a complex system by using tables that show relationships. machines are recognized as having powerful potential. Representative publications describing this prior art include, for example, IEEE Computer Magazine, March 1979 issue, page 28, by D.C.P. Smith and J.M. Smith's article entitled "Relational Database Machines"
e1ationalData Ba5e Machine
e, published by D, C, l'Sm1
th and J, M, Sm1th, in the
March 1979 issue of TEE
E Computer magazine, p.
, 28), U.S. Patent Publication No. 4,221,0
No. 03, as well as various papers cited in the same publication.

The sorting machine is also a computing
This is a great example of the need for architectural improvements. An overview of sorting machine theory can be found in D., E.
"Searching and Sorting" by Knuth, pages 220-246.
and Sorting″by D, E, Knuth
.

pp, 220-246. published (19
73) by Addison-Wesley Pub
lishingCo,, Reading, Mass
achu-setts). Various networks and algorithms are disclosed in this literature, and in order to understand the constraints attached to each of them one must consider them in detail, or if one can say about them numerically. The thing is, they are all
It is a characteristically complex method that is aimed only at the specific purpose of sorting. Yet another example is that presented by L.A. Mollar, which
・Transaximin on Computer J, C-28
vol., No. 6 (June 1979), pages 406-413.
led”A Design for a Li
5t Merging Network'', 1
nthe IEEE Transactions
on Computers, Vol.

C-28No, 8. June 1979 at p
p., 406-413). In the network proposed in this paper, the merge elements of the network are controlled externally, and the network requires programming to perform special functions.

Functions that a general-purpose multiprocessor system must be able to perform include the ability to distribute subtasks in various ways, the ability to determine the status of processors executing subtasks, and the ability to merge and sort messages. functions to perform, correct and change data;
Additionally, there is the ability to see when and how resources change (eg, when a processor goes off-line and comes back on-line), and so on. In order to perform the functions described above, it has heretofore been necessary to use excessive software and hardware for overhead.

- For example, in a multiprocessor system such as a database machine, when specifying a message transfer route between processors, a specific
Rather than selecting one processor as the transfer destination, or selecting multiple processors belonging to one class, or even specifying the processor itself, parts of the database that are distributed to the processors by hashing etc. It is often necessary to select a destination processor by specifying the destination processor. Some known systems utilize pre-communication sequences to establish a linkage between a transmitting processor and one or more particular receiving processors. Establishing this linkage requires sending requests and acknowledgments many times over, and additional hardware and software must be used to overcome possible deadlock conditions. . In systems that do not utilize prefix communication sequences, control is provided by a single processor or by a bus controller, and this control is performed by ensuring that the transmitting processor is ready to transmit and that the receiving processor is ready to receive the signal. This is to ensure that they are ready, that other processors are locked out of the linkage between them, and that no extraneous transmissions are occurring. In this case, too, the dependence on overhead and the complexity required to avoid deadlocks make the system larger (more than 16 processors in a row). As a result, the maintenance function becomes inappropriately expanded.

Yet another example of the requirements placed on modern multiprocessor systems concerns how the system reliably determines the status of subtasks being executed by one or more processors. be. The basic requirement is that it must be possible to query a given processor about its status, and that the status must not be affected by the query. This means that the inquiry must be made in such a way that no errors occur and no ambiguity arises in the content of the response. The term "semaphore" is currently used in the industry to characteristically express the function of testing and setting status displays as a series of uninterrupted operations. However, it is desirable to incorporate this feature without reducing execution efficiency or increasing overhead. Determining such status is Furthermore, which is extremely important when performing sort/merge operations in multiprocessor systems, it is necessary to combine the processing results of multiple subtasks contained within a larger task. This is because the subtasks can only be combined into one after they have been properly completed.A further requirement is that the processor must be able to report its "current" status, and that the execution of the subtasks It may be necessary to ensure that interruptions and changes to the multiprocessor operating sequence occur only once, even if they are repeated.

Most existing systems present a significant problem in this regard because the processor's execution routines are interruptible. In other words, as is easily understood, when multiple processors are executing multiple subtasks that are related to each other, the degree of readiness (=what kind of operation) of each processor is The sequence of operations involved in querying and responding to queries regarding the extent to which It has finally grown to an inappropriate level.

(Problem to be Solved by the Invention) A typical shortcoming in conventional multiprocessor systems, such as those described above, is related to the so-called "distributed update" problem, in which multiple This means that the information, a copy of which is stored on each of the processing units, needs to be updated. The information referred to here may be information consisting of data records;
It may also be information used to control the operation of the system. Controlling the operation of this system means, for example, that processes are started, stopped, restarted, and interrupted, so that necessary steps are not inadvertently executed twice or not at all. Or roll
This refers to control such as making it move backward or roll forward. In conventional systems, the various solutions to the distributed update problem all have significant limitations. Some of these solutions target only two processors at a time. Still other solutions have been developed using intercommunication protocols, but these protocols are so complex that even today their suitability cannot be tested using mathematical rigor. It is extremely difficult to prove this.

The complexity of these protocols is due to the uninterruptible
There is a need to provide a control bit that has the external property of being ``tested and set'' in all processors by a single operation. Because such control bits are located within multiple separate processors, and because of the varying delay times associated with communication between those processors, noise is introduced by the communication channel, which can inevitably be imperfect. will be generated, and the error rate will also increase. Therefore, “
The characteristic of "a single uninterrupted operation" means that the multiple parts that make up one operation are diverse and can be interrupted, and that they can be performed at the same time. It will be readily appreciated by those skilled in the art that difficulties arise when access is not possible and, moreover, they are prone to problems between accesses. .

(Means for Solving the Problems) In summary, the present invention allows a plurality of processors to operate simultaneously to ensure unambiguous and unambiguous operation, and furthermore, the present invention is capable of reliably performing unambiguous and unambiguous operations by causing a plurality of processors to operate simultaneously.
The present invention provides a system and method for externally displaying the readiness status of a single task or event in an unambiguous and unambiguous manner. The network determines global readiness by its own ability to collectively examine all readiness states for a given task or event and select a single highest priority message. .

(Operation) The above is made possible by the interaction between the network and local processor interfaces and message configurations, since multiple simultaneous responses are sorted to minimize readiness. This is because the state is specified. By using the acid-resistant test-and-set concept, the system is able to have synchronized time, so that variables in different parts of a program can be kept in sync with each other. It is now forced to assume an unambiguous, unambiguous state at the same time.

(Margin below) (Example) Embodiments of the present invention will be described below with reference to the drawings.

(Database Management System) The system generally shown in FIG. 1 is a concrete example of the application of the concept of the present invention to database management. More specifically, the system includes one or more host computer systems 10.
．． 12, the host computer systems being, for example, computer systems belonging to the 18M370 family or the DEC-PDP-11 family, for the purposes of this example. It is designed to work with existing common operating systems and application software. According to IBM nomenclature, the main intercommunication network between a host computer and a database computer is called a channel, and the same thing is called a ``unibus'' or ``unibus'' under DEC nomenclature. The term ``mass bus'' or a slightly modified version of these terms is widely used.

Whether one of the above computer systems is used, or another manufacturer's mainframe
Regardless of the computer used, this channel or bus is an ohmic or logically passive transfer path to which database tasks and subtasks are sent.

The example of FIG. 1 shows a backend processor complex associated with host system 1o112. The system in this figure accepts tasks and subtasks from a host system, refers to the appropriate portions of a vast database of stored information, and returns appropriate processed or response messages. Regardless of the configuration of this back-end processor complex, it is intended to be performed in a manner that requires no other than less sophisticated software management from the host system. Therefore,
It is possible to configure the user's database as a multiprocessor system using the ``s'' method, and in this multiprocessor system, data can be stored in relational databases that can greatly expand capacity. Can be organized as files,
Furthermore, this expansion can be done without the need to change the operating system or existing application software provided within the user's host system. A specific example configured as an independent system (stand-alone system) will be described below with reference to FIG. 20.

As will be understood by those skilled in the art, operational functions related to relational database management can be divided into multiple processing tasks that can be processed independently, at least temporarily. It is an operational function that allows you to This is because, in a relational database, multiple stored data entries are not interdependently linked by address pointers. Furthermore, as will be understood by those skilled in the art, there are other applications in addition to relational database management that can be used to dynamically subdivide limited or recurring tasks into smaller pieces for independent processing. Many data processing environments exist. Accordingly, the detailed description of the present invention will be described in relation to processing problems in database management, which are particularly desirable and frequently discussed, but the novel methods and structures disclosed herein will be discussed in detail. has a wide range of other uses as well.

Large data management systems will have both the potential benefits and the inevitable attendant difficulties when using multiple processors. A huge number of entries (descriptions) reaching hundreds of millions,
It must be kept in storage and easily and quickly accessible. On the other hand, a relational database format allows a wide range of data entry and information retrieval operations to be performed concurrently.

However, in the vast majority of database systems, maintaining the integrity of the database is just as important as processing transactional data quickly. Data integrity is
It must be maintained before and after hardware failures, power outages, and other disasters related to system operation. Furthermore, the database system
The ability to restore the database to a previous known state must be provided to clean up user errors, including bugs in application software code. Moreover, it must not be possible for data to be lost or entered incorrectly, and whether the event relates to new data or correction of past errors. Or, depending on whether it concerns the calibration of a portion of the database, all portions of the database that are related to a particular entry must be changed.

Therefore, for integrity, in addition to data rollback and recovery operations, error detection and correction operations, and detection of changes in the status of individual parts of the system and their compensation, in addition, to some extent Redundancy is also necessary for database systems. To achieve these goals, the system may have to be used in many different specialized modes.

Furthermore, in recent systems, queries of arbitrary content (discretion), which tend to have complex formats, are
ary queries) and the ability to respond in an interactive manner if necessary. People attempting to access the system should not be required to be experts in the system, even if the query is complex.

Examples of arbitrary inquiries that may arise in connection with large-scale production operations include:

A. The manager in charge of production management not only requests a list of one item in inventory, but also requests the monthly production of parts whose production has decreased by at least 10% compared to the same month of the previous year. You may request an inventory list specifying all parts in stock that may be exceeded.

B. Not only does a marketing manager inquire whether a particular account is 90 days past due, but also a customer who has a history of exceeding 120 days, especially in a depressed area. may require 90 days of receivables.

C1 The human resources executive not only requires a list of all employees who have taken more than two weeks of sick leave in a given year, but also for two or more of the immediately preceding five years.
You might require a list of all long-term employees with 10 years or more of sick leave during the fishing season.

In each of the above examples, the user attempts to determine the real problem facing the business by relating information stored on the computer in a way that has not been done before. A database system that allows experts without computer training to process complex queries, provided that the user has experience in the field in question, and therefore has intuition and imagination. can be used freely.

Modern multiprocessor systems address these multiple and often conflicting requirements by using specifically designed overhead and maintenance software systems. I am trying to do this, but
These software systems inherently prevent the system from being easily expanded. However, the concept of scalability is a highly sought-after concept because as a business or business grows, it is desirable to extend and continue using existing database management systems. In this case, they don't want to be forced to adopt new systems and software.

Multiprocessor Array Referring to FIG. 1, a typical embodiment system of the present invention includes a number of microprocessors, of which there are two important types. will be referred to herein as an interface processor (IFP) and an access module processor (AMP), respectively. Two IFPs 14.16 are shown in the figure, each connected to a separate host computer io to 12 input/output devices. Numerous access modules
Processors 18 to 23 are also part of this multiprocessor system.
It is included in what can be called an array. The term "array" here refers to a set of processors arranged in a generally ordered linear or matrix arrangement.
unit, referring to a set of processor units or processor units - used in a numerical sense, hence the recent term ``array processor''
It does not mean what it has come to be called. In the figure, only eight microprocessors are shown to provide a simplified example of the concept of this system.
Many more IFPs and AMPs can and typically will be used.

IFP 14.16'EL and AMP 18-23 are Intel 8
It has a built-in 086 type 16-bit microprocessor. Any of a wide variety of microprocessor and microprocessor system products from a variety of manufacturers are available.

The "microprocessor" is just one specific example of a type of computer or processor that can be used in the array, since the concept of the system is
This is because if the computing power required for the application is that of a minicomputer or a large computer, it can be used to advantage. This 16-bit microprocessor provides significant data processing power and is a low cost, standard replaceable configuration that can be replaced with a wide variety of available hardware and software options. This is an advantageous example of a device.

IFPs and AMPs employ similar circuitry, including active logic and control logic, interfaces, microprocessors, memory, and internal buses, as shown in FIGS. 1 and 8, respectively. I will explain later. However, these two processor types differ in the nature of the peripherals associated with each processor type and in the control logic for those peripherals.

As will be readily understood by those skilled in the art, other processor types with different peripheral controllers and assigned different functional tasks may easily be incorporated into the present invention.

Each microprocessor is equipped with a high speed random access memory 26 (described in connection with FIG. 8) which, in addition to buffering input and output messages, It performs message management by collaborating in unique ways with other parts of the system. In layman's terms, this high speed random access memory 26 acts as a circular buffer for variable length input messages (this input is referred to as ``receive'') and for sequentially outputting messages (this output It functions as a memory (referred to as "sending"), incorporates a table index portion for use in hash mapping mode and other modes, and stores control information for handling received and transmitted messages in an orderly manner. do. The memory 26 also stores data when selecting multiprocessor mode, as well as
It is used to play a unique role in handling status, control, and response message traffic. As will be explained in more detail below, these memories further enable local and global status determination and control functions to be processed and communicated in a highly efficient manner based on transaction identities in messages. It is said to be composed of IFP14.16 and AMP18
control logic 28 (first
3) are used to transfer data and perform overhead functions within the module.

IFP14, 16 are each interface control circuit 30
This interface control circuit 30 is equipped with an I
The FP is connected to a channel or bus of a host computer 10-12 associated with the IFP. On the other hand, in AMPs 18 to 23, the device corresponding to this interface control circuit is the disk controller 32;
may have a general structure, and AMP18-2
3, and the magnetic disks individually combined with them.
These are used to interface with the drives 38-43, respectively.

Magnetic disk drives 38-43 provide secondary or mass storage for the database management system. In this embodiment, the magnetic disk drives are constructed from proven commercially available products, such as those manufactured by Winchestar Technology, which provide extremely low cost per byte, large capacity, and high performance. A reliable memory device is obtained.

These disk drives 38-43 store a relational database in a distributed storage manner, which is shown in simplified form in FIG. Each processor and its associated disk drive is assigned a plurality of records that form a subset of the database; this subset is a "-order" subset, and The sub-sets are disjoint subsets and together constitute a complete database. Therefore, each of the n storage devices will hold - of this database. Each processor is further assigned a subset of data for backup, which backup subsets are also disjoint subsets, each forming a part of this database. As can be seen from Figure 22,
Each of the secondary files is replicated by a backup file housed on a different processor than the one on which it is housed, and is therefore distributed differently from each other. Complete databases have been obtained for each of the two. In this way, the integrity of the database is protected by arranging secondary data subsets and backup data subsets with redundancy. This is because, in the event of a failure, it is unlikely that it will have a substantial effect on multiple pieces of data spanning several large-scale blocks or multiple radio controllers forming multiple groups.

Database distribution is also associated with hashing operations for various files, as also shown in FIG. 22, and with the incorporation of hash mapping data into messages. ing. The files contained in each processor are organized into simple hash packets represented as groups of binary sequences.
i bucket). Therefore, based on the table of relationships specified by those packets, it is possible to determine where relationships and tuples should be placed in the relational database system. A passing algorithm is used to determine packet assignments from keys within this relational database system, which allows for easy expansion and modification of this database system.

The storage capacity selected depends on the database management needs, the amount of transactions, and the processing power of the microprocessor associated with the storage device. You can connect multiple disk drives to one AMP or
Although it is possible to connect a file device to multiple AMPs, such modifications would typically be limited to specialized applications. Database expansion is typically accomplished by expanding the number of processors (and the number of disk drives associated with the processors) in a multiprocessor array.

Active Logic Network The purpose of providing an orderly flow of message packets and facilitating the execution of tasks requires a unique system architecture centered around a novel active logic network construct 50 and This is achieved by employing a message structure. The active logic network structure 50 includes a plurality of bi-directional active logic nodes (bi+Hrectional) forming an ascending hierarchy that converges the outputs of the plurality of microprocessors while climbing the hierarchy.
active logic node) 54. These nodes 54 consist of bidirectional circuits with three boats, which are connected to a tree network.
: a network with a dendritic structure), in which case the microprocessors 14.16 and 18 to 23 are connected at the base of the tree structure.
connected to.

As will be understood by those skilled in the art, nodes can be provided when the number of logic sources exceeds 2, for example 4 or 8, in which case it also increases the number of source inputs. This problem can also be converted into a problem of adding more combinatorial logic.

To make it easier to refer to the diagram, among all nodes (N), those belonging to the first hierarchy are represented by the prefix "■", and those belonging to the second hierarchy are represented by the prefix "■". Fix r II J, and the same shall apply hereinafter. Individual nodes belonging to the same hierarchy are represented by subscripts "1.2...", so that, for example, the first
If it is the fourth node in the hierarchy, it can be expressed as rlN4J. On the up-tree side (i.e., upstream side) of the node is “
There is one boat named "C-Boat" which is connected to one of the two down-tree boats of the nodes belonging to the adjacent higher hierarchy and whose down-tree boats are・The tree boat is
They are named ``A Boat'' and ``B Port.'' These multiple hierarchies converge to the top node, ie, the apex node 54a, which reverses the direction of the flow of messages directed upstream (up-tree messages) and reverses the flow direction of messages directed upstream (up-tree messages) to the downstream direction (up-tree messages). It functions as a means of convergence and turning, directing the tree in one direction (down the tree). Two sets of tree networks 50a, 50b are used, and the nodes and interconnections in the two sets of networks are placed in parallel with each other, thereby providing the redundancy desired in large systems. I am getting . Since the nodes 54 and their networks are identical to each other, it is sufficient to describe only one of the networks.

For the sake of clarity, it must first be understood that a large number of message packets in the form of a serial signal train are connected to an active logic network 50 by the connection of many microprocessors. This means that it is possible to simultaneously send out the information to the Yahoo! A plurality of active logic nodes 54 each operate on a binary basis to determine priority between two mutually conflicting message packets; This is done using its own data content. Furthermore, all nodes 54 in one network are under the control of one clock source 56;
This clock source 56 is coupled to the nodes 54 in such a manner as to enable the synchronized progression of a train of message packets towards the apex node 54a. In this way, each successive byte etc. in the serial signal stream is advanced to the next level, and the progression of this byte is such that its corresponding byte in another message is This is done at the same time as a similar proceeding along another route within this network 50.

Sorting to give priority to competing signal sequences is performed on the message packets traveling in one direction up the tree, which ultimately results in
A message string of a vehicle to be turned downstream from the vertex node 54a is selected. Because the system is configured as described above, it is no longer necessary to make a final priority determination at one specific point within a message packet, and therefore the two Message transfer is now possible without requiring anything more than a binary-based determination between two mutually exclusive packets. As a result, the system selects messages and transfers data spatially and temporally, but does not gain control of the bus or identify the transmitting or receiving processor. Message transmission is not delayed for the purpose of processing or performing handshaking operations between processors.

Additionally, it is important to be aware that if several processors send identical packets at the same time, if the transmission is successful, it is the same as if all of the sending processors were successful. That means it will happen. This property saves time and overhead and is extremely useful in providing effective control of large multiprocessor complexes.

Node 54 also operates in a bidirectional manner, thereby allowing unimpeded downstream distribution of message packets. For a given node 54, a downstream message received by boat C on its up-tree side is distributed to both boat A and boat B on its down-tree side;
Furthermore, it is transferred to both of two nodes connected to this node that belong to adjacent lower layers. Under the control of common clock circuit 56, message packets are synchronously advanced down the tree in one direction and broadcast simultaneously to all microprocessors.
(st knee broadcast), thereby enabling one or more processors to perform a desired processing task or accept a response.

Network 50 has a data transfer rate that is faster than that of a microprocessor, typically more than twice as fast. In this embodiment, network 50 has a byte clock interval of 120 nanoseconds, and its data transfer rate is five times faster than a microprocessor. Each node 54 has three boats, each of which is a boat of a node belonging to an adjacent hierarchy connected to the node;
Alternatively, the connection is connected to a microprocessor through a set of data lines (10 in this example).
and control lines (two in this embodiment), and the two control lines are respectively assigned to a clock signal and a collision signal. The data line and the clock line are wired in pairs, with separate lines in one direction up the tree and in the direction down the tree. The collision line propagates only in one direction down the tree.

The above connection structure forms a full-duplex data path such that no delay is required to "reverse" the drive direction of any line.

Referring now to FIG. 3, the 10 data lines contain 8-bit bytes, represented by bits 0 through 7, which make up 8 of the 10 data lines. is occupying.

Another line, designated C, is a control line, which carries control sequences used to specify different parts of the message packet in a particular way. The 10th bit is used for odd parity in this embodiment. As will be understood by those skilled in the art, the system may have more or less bits in the above data path and can easily operate with such changes.

A sequence of bytes is arranged to form a series of fields, essentially divided into a command field, a key field, a destination selection field, and a data field. . As explained in more detail below, a message may use only one field and may also have a detectable
It ends with the "End of Message" code. “Idols” intervening between messages
The 1dle field is represented by an unbroken series of 1's on the C line as well as on lines O to 7, and is transmitted whenever no message packets are available. There is. Parity lines are also used to convey changes in the status of individual processors in a unique manner.

“Idle state (j+Ne 5tate: idle state)
'' is a state that exists between messages and is not part of a message packet. Message packets typically begin with a two-byte command word containing a tag, which if the message is a data message contains a transaction number (T
If the message is a response message, it is in the form of an originating processor ID (OPID). Transaction numbers have various levels of significance within the system and serve as the basis for many types of functional communication and control. The packet is
The word is followed by a variable length key field and a fixed length destination selection word (des!, 1nation 5el
(DSW) and/or both, which form the beginning of a variable length data field. The key field serves the purpose of providing a criterion for sorting messages when the messages are identical except for the key field. DSW
provides the basis for a number of special features and, along with TN, deserves special attention.

The system is designed to work with a word-synchronized interface, in which all processors attempting to send packets
The first byte of the word is sent to the network 50 simultaneously with each other.
It is designed to be sent to. The network uses the data content of the following fields to perform a sorting on a binary basis at each node, with priority given to the lowest numerical value. If bit C is considered to be the largest amount among consecutive data bits, and bit O is considered to be the smallest amount, then the sorting priority is as follows.

1. The first sent to the network 50; 2. The command code (command word) is the lowest value; 3. The key field is the lowest value; 4. The key field is the lowest value.
5. The field is the shortest. 5. The data field (including the destination selection word) is the minimum value. 6. The one with the shortest data field.

In view of the purpose of explaining the overview here, it is particularly important to note that once the priority is determined at the node 54, a collision indication (=collision indication, hereinafter referred to as A cal or Bcol) ) is returned to the route of the party that received the transmission of the party that lost in this priority 4-te determination. This collision indication tells the transmitting microprocessor that its transmission has been aborted because the network 50 is being used for a higher priority transmission, and that it should try to transmit again at a later time. be able to recognize that.

Simplified examples are shown in various diagrams in FIG. In this embodiment, network 50 operates in conjunction with high-speed random access memory arranged in a tree structure using four separate microprocessors. To explain in more detail, IFP14 and three AMPlB
, 19 and 20. A total of 10 sub-causes 2A, 2B,
...2J each corresponds to one of ten consecutive time samples from 1=0 to t=9,
and at each of those times, the serial number (simplified four-character sequence) sent out by each microprocessor in this network.
The manner of distribution of messages and the state of communication between the boat and the microprocessor at their various times are shown. The drawing, simply labeled FIG. 2, shows the state of the system before the start of signal transmission. In each of the above figures, the null state (null 5
tate: zero state), that is, in order to be in the idle state, transmission indicated by "mouth" must be occurring. Since there is an agreement that the data content that takes the minimum value has priority, the AM in Figure 2A
Message packet rEDDV sent from P19
J will be the first message packet transmitted through the system. Each message in the figure is associated with a high speed random access memory (H.

(sometimes referred to as RAM). The H, S, RAM 26 has an input area and an output area, which are schematically shown in FIG. 2, and the packet is stored in this output area when 1=0. They are arranged vertically in a FIFO (first-in-first-out) manner, so that when transferring, H, S,
It can be taken out as directed by the cursor arrow written in the RAM 26. At this point, all transmissions within network 50 are in a null or idle state (b).

On the other hand, at time t=1, shown in FIG. 2B, the first byte of each message packet is sent onto network 50 at the same time as all nodes 54 are still displaying idle state indications. All transmission states above the first layer are also in the idle state. During the first clock interval, the first byte of each message is set inside the lowest nodes IN and IN2, the contention is resolved at t=2 (Figure 2C), and the upstream Both forward and downstream transmissions are performed sequentially. Node IN receives rE on both of its input ports and forwards it upstream to the next layer, and downstream to both sending processors in an undetermined state. is displayed. However, the node IN, which belongs to the same hierarchy as this, has processor 1
In the case of a conflict between "E" from 9 and "rp" from processor 20, it is determined that rEJ has priority, and boat A is moved up.
While connecting to boat C on the tree side, it returns a B_cal signal to the microprocessor 2o. When the B_cal signal is returned to microprocessor 20, the IN2 note has effectively locked its A port to the C output port, thereby causing microprocessor 1
A serial signal stream from 9 is transmitted to the vertex node II N 1.

IN, the first two characters in the node are either r
EDJ, and therefore, as shown in FIG. 2C, it is impossible for this node to make a decision at time t=2. Furthermore, three microprocessors 14,
! The common leading letter "E" sent from 5 and 19 reaches the II N 1 vertex node at time t=3 (Fig. 2D), and this letter r E J is also sent to all those messages. When the second common character "D" is transferred to this vertex node II N 1, the direction of its transfer is reversed and directed downstream. At this point, node IN is still in a state where it cannot make a decision, but at this time, the series of microprocessors 1
4.3rd letter rF from 18 and 19, respectively.
"E" and "D" are being sent to this node IN. Receipt of the B_cal signal by microprocessor 20 means that this processor 20 has lost the competition for priority, and therefore, if this processor 20 receives the B_cal signal, it will display an idle indication ( (b) is transmitted, and thereafter only this idle display (b) is transmitted. Each cursor arrow being written to a respective output buffer indicates that microprocessor 20 has been returned to its initial state while the other microprocessors continue to send successive sequences of characters. Therefore, the important events at time t=4 (Figure 2E) are that a decision is made regarding the boat NoF I N , and that the first letter ('
EJ) is invertedly transmitted through all lines toward the first layer node layer.

At time t=5 (Figure 2F), the second ? An Ii conflict is displayed, in which case the B vote of node II N , wins the contention and A cot is generated.

During the next several clock times, the serial signal train continues to be broadcast downstream, and t
At time 6 (FIG. 2G), the first character of the message is set in all the H, S, and input areas of the RAM 26. Another thing to note here is that the priority determination previously made at node IN is invalidated at this point, and the reason is that the priority determination made earlier at node IN is invalidated at this point. As soon as the third character ('E') sent out by the microprocessor 19 loses the competition with the third character ('DJ) sent by the microprocessor 19, the higher hierarchy notes II N 1 to A c
This is because ot is displayed. As indicated by the cursor arrows in FIG. Already completed at time 4.2nd H
As can be seen from Fig. 2, Fig. 2, and Fig. 2J, the priority message
will be loaded. At t:8 (Fig. 2I), this message has already flowed out from the first layer, and the vertex node II N is already in the reset state at t=7, but it is This is because by the time the last downstream character is transferred to the processor, only the idle signals are already competing with each other. At time t=9 (Fig. 2J), the nodes INI and IN2 belonging to the first hierarchy have been reset, and all of the defeated microprocessors 14, 18 and 20 are activated once the network becomes idle again. By sending the first character of the message when it is being directed, it will once again compete for priority on the network. In practice, as will be explained later, an acknowledgment signal is transmitted to the winning microprocessor, but this is not essential to the fullest generalization of the invention.

After the message has been broadcast to all microprocessors in this way, the message is
It may be utilized by any or all of Sowara's microprocessors as needed. How many microprocessors are used depends on the mode of operation and the functions performed, and there are many variations in the operating modes and functions of the microprocessor.

(GLOBAL INTERCOMMUNICATION AND CONTROL) The example described above of how a network can give priority to one message among competing messages in 41f is an example regarding the transfer of a primary data message. be. However, complex multiprocessor systems must utilize many other types of communications and commands in order to provide the efficiency and versatility currently required. The main functions that must be provided include, in addition to primary data transfer, what can broadly be called a multiprocessor mode, acknowledgment of messages, status indication, and control signals. There is. The following sections provide a global perspective on how the various modes and messages work with a sorting communication network to perform sorting and communication for prioritization, i.e., multiprocessor It presents an overview described from a systems perspective. For a more detailed understanding, reference is made to FIGS. 8 and 13 and the description thereof below.

In broadcast mode, messages are delivered simultaneously to all processors without specifying a particular receiving processor or processors. This mode is typically used. Examples include responses, status inquiries, commands, and control functions.

If the receiving processor needs to be specified,
Destination selection information contained within the message packet itself now provides criteria for determining whether to accept or reject the packet locally (at each individual processor). There is. For example, interface logic within a receiving processor module may, according to map information stored in high speed RAM 26, route the data in the packet to a range that is relevant to the particular processor in which the interface logic is embedded. Identify whether something is included or not. By setting the map bits in the fast RAM in different ways, the criteria for different selection schemes can be easily established, including, for example, the selection of a particular receive processor ("hashing"). by selecting a portion of a database stored in a logical process
There is a selection of types ("classes"), etc.

Using broadcast with local access control (= access control performed on individual processors) is particularly beneficial for database management systems, which can be widely distributed while requiring little overhead software. It is possible to access distributed local copies of any part of a relational database or any of a plurality of globally known logical processes. Therefore, this system is capable of identifying and selecting one destination processor to which a message is forwarded, and is also capable of identifying and selecting multiple resources belonging to one class. Level database queries often require cross-references between separate parts of the database and consistent references for a given task.

Transaction number (T
N) has various characteristics, among other things, it provides the identity and reference of such global transactions. A large number of tasks can be processed in parallel by local processor modules that operate asynchronously with each other, and each task or subtask has an appropriate TN. It is designed to have. TN and DSW (
By using various combinations of destination selection words) and commands, virtually unlimited flexibility is achieved. Extensive sort/merge operations are required for a large number of tasks whose allocation and processing are done asynchronously.
ion) can now be applied. T
N can be allocated and abandoned, and a merge operation can be started and stopped. some kind of message,
For example, a continuation message or the like can be given priority over transmission of other messages. By utilizing a TN and a local processor that updates the status for that TH, it is possible to determine the global resource status for a given TH with just one query. Distributed updates can also be achieved with a single communication. The system of the present invention has all the above functions.
This is done without extending the software or significantly increasing the overhead burden.

The result of using the present invention is that multiprocessor systems with a number of microprocessors far greater than those typically found in the prior art can operate very effectively on problem tasks. becomes possible. Microprocessors are now so cheap that it is possible to create systems with high performance in the problem domain, even if they are simply "low" power ("raw").
It is possible to realize a system that not only has high performance (power) but also high performance.

A consistent priority protocol that encompasses all message types and various subtypes is defined to encompass all of the different types of messages that are fed into the network. Although response messages, status messages, and control messages are different types of messages than primary data messages, they are similarly subject to network contention/merging behavior (
content/merge operation
n) and thereby receive priority while being transferred. The response message in this system is an acknowledgment (ACK) or a negative acknowledgment (NAK).
or an indication that the processor does not have the resources to perform meaningful processing on the message (“not appli”).
cable processor) J-NAP
). NAK response indicates lock status,
error condition or overrun
) can be any of several different types of status indications. There may be only one originating processor or there may be multiple originating processors, but the originating processor requires a response like this after it has finished sending the message, so the response message contains the primary data. It is given higher priority than messages.

The system also sends a 5ACK message (status acknowledged message: 5tatus acknowledged).
g-IIIent message), and this 5ACK message indicates the readiness state (state of what kind of operation is possible: readiness 5tate) of a certain local processor regarding a specific task or transaction. It is something. The contents of this 5ACK response are updated locally (=in each processor, i.e., at the local processor) and kept accessible from the network.Such a 5ACK response is combined with a network merge operation. This allows a single query to provide global status reporting for a given task or transaction. Status responses follow a priority protocol, so the data content of a response for a given transaction number The response with the lowest response automatically receives priority, thereby establishing the lowest readiness state, deafness, as the global system state, and this is done in a single, uninterrupted operation. Furthermore, such a 5ACK indication may be used in conjunction with certain primary messages, thereby establishing various protocols such as system initialization and lockout operations, among others.

The priority protocol for the various message types is first defined for the command code, which is the command code for the command word that precedes each message and response, as shown in Figure 11. ,
The first 6 bits are used. This makes it possible to make a sufficient distinction between message types and subtypes, but it is also possible to make a more multi-level distinction.

As can be seen from FIG. 11, in this embodiment, the 5ACK response is used to distinguish between seven different status levels (and also provide a criterion for determining priority). ing.

In the case of a response message, after the above 6 bits, 1
A tag in the form of 0-bit 0PID follows (see Figure 3). Both TN and 0PID can serve as criteria for further sorting, since they have different data content inside the tag area.

After each primary message is transmitted over the network, every processor interface, whether it is the NAP or not, generates a response message. Their response messages also compete with each other on the network, whereby a common or winning response message is broadcast to all processors. The lost message packets will be attempted to transmit simultaneously again at a later time, but this re-simultaneous transmission will occur after a very short delay, thereby ensuring that the network is in virtually continuous use. There is. If multiple processors send ACK responses, the ACK responses will be sorted based on 0PID.

As a result of the present invention, starting, stopping, and controlling tasks, as well as interrogating tasks, can be performed by a large number of physical processors and with little overhead. This is due to the low power of many processors.
) can be used effectively to handle problem situations, because out of this low power, system coordination
This is because the amount of time spent on control and control can be extremely small.

Co-operation and control overhead constitute a fundamental constraint on the efficiency of any distributed/architecture system.

For purposes of global control (ie, network control), various types of control communications are used.

Therefore, "stop merge", "request status", and "
Messages for ``start merge'', messages for assigning a task, and messages for abandoning a task are in the same format as data messages, and therefore these messages are also treated as primary messages here.・We will call it Message.

Their control messages also contain TNs and are placed in their place in the priority protocol. This will be discussed later in Figure 10 and 1.
Let us explain with reference to Figure 1.

The term "global semaphore buffer system" was originally used because the high speed random access memory 26 and control logic 28 shown in FIG. This is due to the fact that it plays an important role in both two-way communication of instructions. This global semaphore buffer system provides access duality in that both the fast-running network structure 50 and the slower-running microprocessor can access the memory 26. messages, responses, controls, or status indications within the microprocessor can be viewed without delay and without the need for direct communication between the network and the microprocessor. To accomplish this, control logic 28 connects memory 26 to an
interleaved cycle
time multiplexing to the network 50 and the microprocessor, resulting in separate boats having common access to the memory 26. The same thing is happening. Global resources, ie, network 50 and multiple microprocessors, utilize the transaction number as an address locator to locate the portion of memory 26 that is allocated to store the status of the transaction. be able to. At the local level (=level of the individual processor), the status of the subtasks for a given transaction, including all kinds of available states, is updated inside the memory 26 under the control of the microprocessor and the control A lock on the buffer system is provided by logic 28. , one of seven different ready states allows entries to be advantageously retrieved from different dedicated portions of memory 26. Once a query is received from the network, the status of the processor is communicated (i.e., the ``semaphore'' is read) and a priority determination is made within the network, with the degree of completion being determined. The lowest readiness status gets priority. With the above configuration, a quick hardware response from all processors to one inquiry can be obtained. Therefore, it is possible to know without delay and without using software whether or not all of the distributed subtasks related to a given task have been completed. Furthermore, in this system, any of the communicating processor modules can allocate a transaction number, and this transaction number assignment uses an available transaction number for a message. The operation of allocating or allocating for use within each global semaphore buffer system.

Preferred embodiments of the integrated use of transaction identity and status display include that each of the plurality of processors sends out all messages related to a given criterion in an orderly manner. There is a complex merge operation that requires .

If a prior art system were used, each processor would first receive its own task and complete its processing, and then use the results of that processing as some kind of "mask" to perform the final merging operation. You will have to use a method of transferring it to the processor. Therefore, the mask processor becomes a serious bottleneck to the efficiency of the system.

Once the global readiness state has established that all of the affected processors are in a ready state, the messages with the highest priority in the memory 26 provided in each processor are sent to the network at the same time as each other. and priority determinations are made for those messages during merging, as described above. Attempts are made to retransmit several groups of messages one after another, resulting in the messages being ordered from highest to lowest priority for that transaction number, with the lowest priority being the last. A serial message sequence is generated as if something were coming. Depending on special command messages, the system is capable of stopping and resuming a merge operation mid-way, allowing multiple merge operations that are in the middle of execution at the same time to A situation may exist in which merge operations share this network 50, thereby making it possible to utilize the resources of the system very efficiently.

Therefore, at any time, this network 5
All of the active processors connected to 0 are enabled to perform operations on multiple messages related to various transaction numbers asynchronously with each other.

If a single status query references the same transaction number, i.e. the "current" transaction number, then all processors must be synchronized with each other with one of the following status levels: and respond.

For example, "START MERGE"
) J Message is a transaction
Test of global semaphore specified by number (=
If the global state resulting from this test is a "ready" state (i.e. "SEND READY" or "RECEIVE READY") current transaction number (pr
esent transact,ion number
: P T N ) is set equal to the value of TN transmitted in this ``Start Merge'' message. (If the global state obtained as a result of the test is not the "ready" state, the value of PTN is rTNO (which means that the transaction number (TN) is "0"). (will be returned to the value)
.

Furthermore, the "STOP MERGE" J message also resets the current transaction number to "0". In this way, rTNOJ sends messages (
It is used as the ``default'' value transaction number used for point-to-point messages. In other words, this rT
“Non-mer3e” was created by NOJ.
) J mode operation is specified.

This global intercommunication system includes those shown in FIGS. 3A, 3B, 3C, and 11 for the message configuration and FIG. 8 for the high speed random access memory 26 configuration. and those shown in FIG. 10 are adopted. A more detailed explanation will be given later in the fifth section.
This will be done in conjunction with FIGS. 7, 9, and 13.

As can be seen from Figures 3A to 3C and Figure 11, the command codes used for responses range from 00 to 0F (hexadecimal), and the command codes used for primary messages are 10 (16 (base numbers) to larger values. Therefore, the response is made to the primary message first, and in the order shown in FIG. 11, the smallest value comes first.

One dedicated storage area (the area written as "transaction number" in the figure) inside the high-speed RAM memory 26" (Figure 8) stores data in the word format of Figure 12 (the seven types of readiness described above). TN status, TN assigned status, and TN unassigned status).

Among the other dedicated portions of this memory 26'' are a circular buffer for input (received messages) and a storage space for output messages. A separate area is used as the message completion vector area, which allows you to place a pointer on the output message that has been sent, thereby making efficient use of the output message storage space. It has become.

As understood from the above, the memory 26 and the control logic 28 are queued.
ng ) functions and data buffering functions are certainly important, but with them comes the unique importance of multiple collaborative operations in which global transactions are distributed and processed with respect to individual processors. ing.

(Active Logic Nodes) In either of the two networks arranged with redundancy, multiple active logic nodes 8 in FIG.
54 have the same configuration as each other, with the exception of the direction-reversing notebook 54 at the top of each network, which does not have an upstream boat, but instead:
A simple signal direction reversal path is provided for direction reversal in the downstream direction. As shown in FIG. 4, one notebook 54
can be broadly divided into two groups based on functionality. One of these functional groups is concerned with the transmission of messages as well as collision signals (collision numbers), the other with the generation and retransmission of common lock signals. The clock signals are synchronized such that there is no skew between the respective clock signals at different nodes, ie, zero skew. The above two functional groups are not independent of each other, and the reason is that zero and
This is because skew clock circuits form an important part of signal transmission systems. Both a word clock (consisting of two serial bytes) and a byte clock are used. It is noted here that, both when setting or resetting the state of this active logic node 54 and when setting different modes of operation,
There is no need to externally control active logic node 54, and no such control is actually provided. Furthermore, because each notebook 54 is identical in structure to the other, it is possible to mass produce them using modern IC technology, thereby increasing reliability while reducing significant cost. It is possible to achieve a reduction in

Each of the A, B, and C "boats" mentioned above each have 10 input data lines and 10 output data lines.

For example, on the A boat, the input line is represented by AI and the output line is represented by AO. For each boat,
Along with an upstream clock line and a downstream clock line, there is one "collision" line (i.e.
line) is used (for example, Aco line) is used for A boat.
l is used). The data lines of each of the A and B boats are connected to a multiplexer 60 which selects which of the two conflicting words has priority, or which of the conflicting words are identical to each other. ) that common word,
The data signal CO is switched and connected to the up register 62 connected to the upstream boat (C boat). At the same time, downstream data sent from higher hierarchy nodes and received on the C boat is shifted into and out of the down register 64 and sent to the A and B boats. occurs as output in both.

One of the serial upstream streams of bytes may be blocked, however, without any additional upstream or downstream delay, and the words may be blocked. It is advanced through up register 62 and down register 64 in a continuous line under the control of the word clock and byte clock.

The mutually conflicting bytes supplied simultaneously to the A and B boats are detected by the first and second parity detectors 66.
．． 67 and also to a comparator 70, which prioritizes the data content based on the eight data bits and one control bit in such a way that the data content with the lowest value gets priority. Determine rights. In this priority determination protocol, the ``idle'' signal, ie, the signal when no message is present, is an uninterrupted string of ``1''s. Parity error is
This can be caused by typical causes such as the presence of excessive noise, or any other factor that contributes to FA3'JI in signal transmission or circuit operation. However, in the system of this embodiment, the parity error indication is also used for another important purpose. That is, each time a microprocessor transitions to an inoperable state, the transition is marked, and this marking indicates that all output lines, including the parity line, go high (i.e., their value is ``1''). ), thereby causing an odd parity error condition. This parity
If one error occurs, the error display is transmitted as a "marker" within the network.
This marker allows the system to identify when a change has occurred in a global resource and to initiate a blogging process to determine what that change is.

A pair of parity detectors 66,67 and a comparator 70 provide signals to a control circuit 72 which includes a priority message switching circuit 74 and which also performs priority determination. If so, the multiplexer 60 is configured to lock into one of two states in response to the output of the comparator 70, and is further configured to generate and propagate a collision signal in the downstream direction. It is configured. The transitional parity error propagation circuit 76 is so named because it forces into the network the previously described parity error condition in which all lines are ``1'' at the same time. The reset circuit 78 is for returning this node to its initial state, and sends an end participation message (end
of IIlessageEOM) detector 80.

In order to perform the functions described above, as well as those described below, a microprocessor chip may be used in each active logic node to perform those functions. However, by having those functions performed according to the state diagram of FIG. 5 and the logical expressions described below, they can be performed more easily. In the state diagram of FIG. 5, state SO represents an idle state, and also a state in which conflicting messages are the same and a decision has not been made to give priority to one port over the other port. It represents. S1 state and S
The two states are a state where the A boat is given priority and a state where the B boat is given priority, respectively. Therefore, if the data content of Bl is larger than the data content of AI and there is no parity error in AI, or if there is a parity error in Bl (if there is a parity error in these AIs), The condition that there is no parity error and the condition that there is a parity error in Bl are, respectively.
The A boat has priority (denoted AlPE and BIPE and represented by the states of the flip-flops).

Logical state g (logical condition) opposite to the above regarding AI and Bl
exists as a state (condition) for this device to transition to state 52. From higher level notes,
If an indication that a collision has occurred at that level is issued, that indication is included in the downstream signal and C
It is sent back as 0LIN. The device transitions to the S3 state wherever it is in the SO, S1, and S2 states, and sends this collision signal downstream to Acol and Bca.
Transfer as l. When in the S1 state or S2 state, this node has already made a decision, so a collision signal is sent downstream in the same way to the (two) nodes in the lower hierarchy. At this time, the priority message switching circuit 74 selects A according to the situation.
Locked to boat or B port.

Reset circuit 78 includes an EOM detector 80, which is used to reset the node from S3 to SO (FIG. 5).

The first reset mode utilizes the End of Message (EOM) field, which terminates the data field in the primary message, as shown in FIG.

Using a group of flip-flops and gates, the following logic state is created:

URINC-URC-URCDLY where URC represents the control bit in the up register, URINC represents the value of the control bit in the input signal input to this up register, and
RCD_LY represents the C value (=value of control bit) in the up register delay flip-flop.

As shown in Figure 6, a bit pair (bit bear), which is a set of two consecutive bits in a string of control bits, specifies a certain type of field and also This is to make the transition to the field explicit. For example, the transition from the control bit state, which is used when idle and is followed by only a 1, to the ro, IJ bit sequence (=bit pair) marks the start of a field. This sequence of "0.1" is used to identify the start of a data field. This is followed by a string of control bits (
The columns (columns) indicate internal fields or subfields, and the end of message (EOM) is identified by the ro, OJ control bit pair. “1.
A string of bit pairs of ``0'' followed by a bit pair of ``Olo'' is a unique condition and can be easily identified. The URINC, URC, and URCDLY signals are ANDed together, and each of these signals is delayed by one byte clock from each other. The waveform of the signal obtained as a result of taking these ANDs is at a high level until the start of a message packet, at which point it changes to a low level, and while this data (=message packet) continues "C". , a waveform that remains low. This waveform returns to a high level two byte clocks after EOM is generated. This waveform U
EOM is detected by a transition where RINC-URC-URCDLY goes positive. As noted in FIG. 5, this positive transition triggers a return operation from Sl or S2 to SO.

When a higher hierarchy node is reset, it enters the C0LIN state, which indicates that the conflict condition has disappeared. This logic state initiates a return operation from S3 to the base state SO. Note that this C0LIN condition propagates downward through successive layers of network 50 as the end-of-message "runs through" each layer. As described above, each node can reset itself regardless of the length of the message. It should also be noted that regardless of the initial state of the network, all nodes will be reset to the SO state once the idle signal is provided.

Collision signals are routed back to multiple processor modules. The modules memorize this collision state information and return to sending idle sequences while the winning processor continues to send. There is. The processor is C0LIN to C0L
As soon as a transition to IN is detected, a new transmission can be started. Furthermore, in addition to this, the processor has 2
It is arranged that a new transmission can be started if the idle signal continues to be received for a period of N byte clocks, since this situation is also similar to the former situation. This is because it indicates that the previous transmission does not remain within this network. According to the latter of the schemes for making these new transmissions possible, a processor joining the network for the first time can enter a message synchronization state with the network, even if the traffic is small, so that this initial Participating processors do not have to wait for polls from other processors to initiate intercommunication with other processors on the network.

The parity error state, shown in the state diagram of FIG. 5, is set according to the following logical equation.

PE5IG -AlPE・ 8IPEDLY +
BIPE-BIPEDLY If the logic state of this PE5IG is true, the input signal UR to the up register
IN is (IJRIN O...UItIN 7, C%
P=1...1,! , is ri. In order to satisfy the above logical formula, the transition parity error propagation circuit 76
It includes a flip-flop for E, that is, an eight-input parity error flip-flop, and a delay flip-flop (AIPEDLY). The latter flip-flop is made of AlPE
The state is set one byte clock later according to the setting state of . Therefore, for the eight inputs, when the AlPE flip-flop is set due to a parity error, the PES I G value will be high for one byte clock; is propagated only once, upon the first indication of a parity error. This same condition occurs when multiple data bits, control bits, and parity bits all have a value of ``1'', but the transition described above for the state of the global resource occurs. This is the state that occurs when This causes all lines to go high, forcing an all-1 state and establishing a total even state (odd parity state), resulting in the AlPE flip to the previously described state. Flop and AIPEDL
Y flip-flop is set to indicate a parity error. The above arrangement operates in a similar manner if the message bucket received on the B boat contains a forced parity indication to indicate a parity error or change in status.

Parity errors caused by noise effects and other variables usually do not affect processor operation because of the use of a redundant dual network. It is. For monitoring and maintenance purposes, an indicator light (not shown) is used to indicate the occurrence of a parity error. However, for a one-time propagating parity error that indicates a change in status, it initiates a routine to evaluate the significance of the change.

The clocking system used in this node 54, as shown in FIG. ) to zero, that is, to maintain a zero skew condition. Clock circuit 86 includes first and second exclusive OR gates 8
8.89, and the outputs of those exclusive OR gates, denoted A and B, respectively, are such that a subtraction (i.e., an operation of rB-AJ) is performed between them by an adder circuit 92. The output of the summing circuit 92 controls the phase of the output from a phase locked loop oscillator (PLO) 96 after being passed through a low pass filter 94. First exclusive OR gate 88
The inputs to the PLO 96 are the output of this PLO 96 and a downstream clock supplied from an adjacent node element of a higher hierarchy via an isolated drive circuit 97. This clock line is labeled "Word Clock," and this word clock is obtained after a known delay from an adjacent higher hierarchy, and this same clock signal is no longer available. It is returned via one isolated drive circuit 98 to that node in an adjacent higher hierarchy. The inputs to the second exclusive-OR gate 89 consist of this word clock and clock feedback from an adjacent lower hierarchy, which also receives signals from this PLO 96. .

The above word clock line is connected to the third exclusive OR
It is connected to two inputs of gate 100, both of which are connected directly and via a τC delay line 101. This provides a byte clock signal that has twice the frequency of the word clock and is timed with respect to the word clock.

The operation of the clock circuit 86 described above can be better understood by referring to the timing diagram of FIG. The clock out signal (clock output signal) is the PLO9
This is the output of 6. Naturally, since the primary goal of this clocking system is to maintain zero time skew between the clock output signals for all nodes in the network,
The clock output signals must also have the same nominal frequency. The delay due to the transmission line between nodes is set to be approximately constant, but
The value of this delay itself can also be set to a long time. If the method disclosed herein is adopted, the byte clock speed of the network and nodes will be set to the speed adopted in the actual system (nominally 120ns
), it can be as long as 28 feet (8.53 m). As will be readily understood by those skilled in the art, networks that are not packed with the maximum possible number of processor modules at the same time may be constructed with additional layers that are integer multiples of this 28-foot length. can be easily obtained. In that case, the latency, ie the transmission time of the transmission carried out over the network, increases correspondingly.

As shown by the waveform immediately below the CLOCK OUT signal in Figure 7, the word clock derived from an adjacent higher hierarchy has a similar waveform to the CLOCK OUT signal, but I'm just behind. Although this word clock forms the fundamental timing reference common to all nodes, it is possible to do so by controlling the leading edge of each clock out signal internally within the circuit. , and by leading their leading edges to the word clock, all nodes can be kept in sync. As can be seen with reference to waveforms A and B, pulse A generated by the first OR gate 88 ends at the leading edge of the word clock, while the second
Pulse B generated by OR gate 89 has its leading edge coincident with the leading edge of the word clock. The trailing edge of this B-pulse is positioned at the start of the feedback pulse from the adjacent lower hierarchy module, which is delayed by a long time so that the B-pulse remains constant in duration. It becomes. The clock circuit 86 acts to keep the duration of pulse A the same as the duration of pulse B, but the reason it does so is to advance the phase of the PLO 96 so that synchronization is established. As the output signal of the adder circuit 92 (subtraction r
This is because the signal after B-AJ approaches zero. In practice, adjustments are made to the leading edge of the A signal, which may lead or lag the preferred position, as shown by the dashed line, so that the leading edge of the A signal It should be placed in a position that precedes the leading edge of the clock by the amount of time. Once the leading edge of the clock out signal is in this preferred nominal position at all nodes,
There will be a zero skew condition between the word clocks. Each processor connected to the network is thus freed from constraints on the total length of the path from one processor to another, which means that delays do not accumulate;
This is due to the fact that there is no difference in propagation time.

To generate a double frequency byte clock, a word signal delayed by a delay time τC is provided by delay line 101.
The clock is duplicated and this delay line 101 also feeds the gate 100. Therefore, as can be seen from the waveform labeled Byte Clock in Figure 7, byte clock pulses with duration C occur at both the leading and trailing edges of the word clock. be done. This pulse occurs twice during each word clock interval, and occurs synchronously with the word clock at all nodes. In the above description, the delay introduced by the transmission lines between nodes is almost the same regardless of the direction of transmission from layer to layer, so that virtually all The obvious assumption is that the word clock as well as the byte clock are kept in a stable phase relationship with each other. Therefore, locally (−
A byte clock generated internally within each node provides the clocking function for each byte of a 2-byte word of a message at each node. are doing.

These active logic nodes have potential advantages whenever they are intended to resolve conflicts between simultaneously transmitted message packets based on their data content. On the other hand, for example, 1
U.S. Patent No. 4251, issued February 17, 981.
No. 879 “Speed Independent Arbiter Switch for Digital Communication Networks (5peed Indep
endArbiter 5w1tch for
Digital (:ommunicajionNbi
works), including those shown in
Most known systems rely on determining which signal was received first in time;
It uses an external processing circuit or control circuit.

Processor Modules The individual processors illustrated in the overall system schematic diagram of FIG. ~23 are shown as examples, and these processors are roughly subdivided into several major elements. A more detailed example of the configuration of these processor modules (IFP and AMP) will correspond to, but is not limited to, the general functional subdivision of FIG. , which also represents a number of further subdivisions.

As used herein, the term "processor module" refers to the entire assembly illustrated in FIG. 8, which may include the optional elements described below. This allows it to function as either an IFF or an AMP. Additionally, the term "microprocessor system" refers to a system 1 that includes 5 microprocessors 105.
03, where microprocessor 10
5 is, for example, an Intel 8086 type (Intel 80
88) 16-bit microprocessor, etc. The address and data paths of microprocessor 105 are connected within microprocessor system 103 to common peripheral systems, such as main RAM 107, as well as peripheral controller 109. Peripheral controller 109 is shown as an example of one that may be used when the processor module is an AMP and the peripheral is disk drive 111. On the other hand, if the processor module were to function as an IFP, the controller or interface could be replaced by, for example, a channel interface, as shown in the dashed rectangle. The IFF in such an embodiment would provide communication to and from a host system channel or bus.

Since the microprocessor system 103 can use conventional common controllers and interfaces, there is no need to describe these controllers and interfaces in further detail.

It should be noted that using one disk drive per microprocessor can prove advantageous in terms of both cost and performance. Although such an approach is advantageous in general for databases, it is sometimes useful to configure microprocessors so that a single microprocessor can access multiple secondary storage devices. may be beneficial. In the schematic drawings, other commonly used subsystems are not shown for the sake of clarity.

This omitted subsystem is, for example, an interrupt controller, which is supplied by semiconductor manufacturers for use in combination with their own systems. Those skilled in the art will also appreciate the importance of taking appropriate measures to provide power to the processor module to maximize the redundancy and reliability that the present invention can provide. be understood.

Peripheral controller 109 and channel interface, shown as optional elements in microprocessor system 103, correspond to the IFP interface and disk controller in FIG. On the other hand, the high-speed RAM 28 in FIG.
Actually, the first H, S, RAM 26° and the second H, S
, RAM 26'', and each of them is effectively a 3-boat device from a functional point of view due to time multiplexing. The microprocessor's bus
connected to the system. H, S, RAM26° 2
6" each has a first to a second network.
interfaces 120, 120°, thereby connecting the first and second networks 50a and 50b, respectively (these networks are not shown in FIG. 8), the input (receiving) port A and the output (Transmission) Communication is performed via boat B. Since these are two systems with mutual redundancy, the second network interface 120'
and the second H, S, RAM 26''.Network interface 120.120
Although these are shown and explained in more detail with reference to FIG. 13, they can be roughly subdivided into the following four main parts.

An input register array/control circuit connecting ten input lines from the second network 50b to the A-boat of the H, S, RAM 26' via an interface data bus as well as an interface address bus. 122° Output register array/connecting the output lines to the second network 50b to the interface data bus as well as the interface address bus and the B port of the second H, S, RAM 26'. Microprocessor bus interface/control circuit 126° network to word data bus connected to the control circuit 124° interface address bus and interface data bus and to the A and B ports of the H, S, RAM 26”. receive the clock, and
a clock generation circuit 128° that generates a plurality of clocks that are synchronized with each other and in proper phase relationship for controlling the interface 120°; second network interface 120°;
S, RAM 26'' cooperates with the microprocessor system 103 to coordinate data transfer between a network operating at high speed and a processor operating at a slower speed in comparison; It also performs the function of queuing messages exchanged between these different systems (= network system and processor system). 1 function (read/write function + R/W function), and this microprocessor system is at least compatible with Intel 8086
If it is of the type H,S, RAM 26'', it has the ability to write data directly to the RAM 26'' and the ability to receive data from the H,S RAM 26''.

The structure of IFP and the structure of AMP are similar to each other in terms of their functions, however, H, S,
Regarding the size of the input message storage area and the size of the output message storage area inside the RAM 26,
There may be considerable differences between P and AMP.

In relational database systems,
The IFP uses the H,S,
Internal RAM 28'' has a large input message storage space for receiving new messages from the high speed network.The opposite is true for AMP, which stores processed messages sent to the high speed network. This is because more storage space must be available for the packets.Ho
S, RAM26” is the microprocessor system 10
It also operates in conjunction with the main RAM 107 in the network 3, which contains message buffer sections for each network.

The manner in which the system address space within main RAM 107 is allocated for microprocessor system 103 is illustrated in FIG. 9 and will be briefly described. - an address allocated to the system random access function according to a numerical scheme, leaving space for expansion to be used if the storage capacity for random access is increased, and the I10 address space; and an address space allocated for the functions of ROM and FROM (including EPROM). Furthermore, some portions of the system address space are allocated to the first and second high speed RAMs 26° and 26°, respectively.
It is allocated for message packets sent from 6' and message packets sent to those high-speed RAMs. This provides great flexibility in the operation of the system, since the main RAM 107 is responsible for the software and hardware, even though the microprocessor 105 can address the This is because the software can be hardly constrained by interdependence with software.

I will explain the old figure 8, but as already mentioned, 2
H, S, RAM that can be accessed from two directions
26" is configured to perform core functions in controlling multiprocessor modes, distributed updates, and managing the flow of message packets. To achieve these and further objectives For, H, S, R
AM26" is partitioned into a number of different internal sectors. The relative placement of the various sectors shown in FIG. The specific addresses that are used and specify the boundaries of these sectors indicate the addresses that are actually used in a certain system.Please note that This means that the sizes of these memory sectors and their relative placement can vary widely depending on the particular system situation. In the illustrated example, 16-bit memory words are employed. There is.

The selection map and response directory are dedicated lookup tables of the kind that only need to be written once during initialization, whereas the transaction number section is dynamically revisable. It provides a lookup table (which allows you to change its contents as many times as you like).

The memory section for the one-choice map starts at location controller 0, but in this specific example, basically four different maps are used within this memory section, and their Maps are used in an interrelated manner. The destination selection word (dest) included in the message packet
ination selection word: D
S W ) is used in conjunction with a dedicated selection map in H,S,RAMz6''. This destination selection word consists of a total of 16 bits, of which 12 bit positions are It contains a map address that occupies 4 bits and map selection data that occupies the other 4 bits.
024 16-bit memory words, each containing four map address values. A single memory access to H, S, RAM according to the address value specified in the DSW provides the map bits for all four maps, while the D
A map selection bit included in SW determines which map is to be used.

FIG. 15 shows the conceptual structure of the map section described above, and in the figure, each map is illustrated as if it were composed of physically separate 4096x1-bit RAMs. ing. Taking into account the convenience of implementation, as shown in Figure 8,
It is convenient to have all map data stored in a single portion of H,S,RAM. A DSW management section 190 (FIG. 13) controls multiplexing operations for the four bits from each of the four maps of FIG. 15 derived from one 16-bit word of H, S, RAM. are doing. As will be appreciated by those skilled in the art, the advantage of this scheme is that the processor does not initialize the map using the same means used to access other parts of the H,S, RAM. It is in.

Furthermore, three different classes of forwarding light selection words are used and correspondingly the storage location of the selection map, the hash selection part, the class selection part, and the destination processor identification information.
on processor 1dentifjcati
onDPID) is divided into selected parts. This DPI
D specifies whether the processor 105 is the particular processor to which the message packet is intended. On the other hand, the class selection part determines whether the processor in question is one of a plurality of processors belonging to a specific processing class that should receive the message packet;
This clearly indicates whether a person is a member of a group or not. The hash value is stored according to the distribution method when the database is distributed within the relational database system, and this distribution method is determined by the algorithm for a particular relation adopted in that system, This also follows the distributed storage method. The hash value in this specific example is that when specifying a processor, the processor can be specified as having either primary responsibility or backup responsibility for the data. ing.

Therefore, with the above multiple selection maps, H, S, R
AM 26'' can be directly addressed to determine whether the processor is the destination. This feature allows prioritized messages to be forwarded to all network interfaces 120. It is a complementary and complementary feature to the broadcasting method, and also allows localized access to the status of the microprocessor 105 without interrupts.

One section of the RAM 26, independent of the rest, serves as a central means for checking and controlling globally distributed activities. As mentioned above, and as shown in FIG. 3, each of the various transactions sent to and received from network 50b is assigned a transaction number (TN). The reason why the TN is included in the message is to use it as a global transaction identity (transaction identification information) when each processor system 103 independently executes the subtasks it has received. A block dedicated to storing the addresses of multiple available transaction numbers in the RAM 26 is locally controlled and updated by the microprocessor system 103 as it executes its subtasks. Contains status entries (descriptions about status). T
N is used in a variety of different ways, both locally and globally, when intercommunication functions are performed. The transaction number identifies the subtask, so
It is used to retrieve data, give commands, control the flow of messages, and specify the types of global processing dynamics. Transaction numbers can be assigned during global communication,
It can be abandoned or changed. These features are explained in more detail in the notes below.

The most complex, but perhaps most effective, feature of the TN is that it works with a sorting network (a network with sorting functionality) to help local processors (= Its ability to enable distributed updates of the status of individual processor modules). Each control process (i.e. task or multiprocessor activity)
has its own TN.

The value of the readiness state (the state in which the processor is ready for what kind of operation) is
The readiness state value is held in the transaction number section of the microprocessor system 103 and is changed locally (within each processor module) under the control of the microprocessor system 103. Microprocessor system 103 selects the appropriate entry (e.g., 5) in the response directory of FIG.
ACK/Busy) (address r050D (hexadecimal)") and thereby transfer the image as it is replicated.
Input this S ACK / Busy status to H, S, RAM 26''. A certain TN address (= storage location corresponding to transaction number)
Entries entered in can be accessed from the network 50b via the H, S, A and B ports of the RAM 28'' and via the interface 120''.・Request (status request) command code (
This is done using a "status request" message containing a TN (see FIG. 11) and a TN. Interface 1
20° uses the contents stored at the TN address of the specified TN to refer to the response directory containing the response message written in the appropriate format. A second global status query for a given TN
network interface 120', it elicits a direct response that is only under hardware control. No front-end communication is required, and microprocessor system 103 is not interrupted or shadowed.

However, if the status is set by transferring the lock J indication to the interface 120°, the microprocessor
System 103 disables interrupts and interface 120 continues to communicate the lock word obtained from address rosot (ts base) until its removal occurs at a later time.

The word format of the readiness state is shown in seven states from "busy" to "initial" in FIG. 12. A useful example employed in an actual system is illustrated. It is possible to change the readiness state into more types or fewer types, but by using the seven types of states shown in the figure, it is suitable for many uses. Extensive control can be exercised. Continuously updates the state level of each TH (=readiness state level represented by the entry stored in each TN address) in "H, S, RAM2B", thereby increasing the availability of subtasks. It is the responsibility of the microprocessor system to ensure that the progress of processing of subtasks and subtasks is reflected.Such updates are performed using the format shown in Figure 12. This can be easily executed by writing to the TN address in the RAM 26''.

In Figure 10, each status response (state response)
For ro 5J to rODJ (hexadecimal), the first part is the status acknowledge command code (statusacknowl).
edgment command code: S
ACK). Those 5ACK responses sent to the network actually consist of the command code of Figure 10, the numeric portion in word format of Figure 12, and the originating processor ID (OPID). This is as shown in FIG. Therefore, those 5 ACK responses form a collective priority subgroup within the overall priority convention shown in FIG. The reason why 0PID has meaning in terms of priority conventions is that, for example, if you have multiple processors working on one TN, but none of them are "busy", then the broadcast This is because the highest priority message will be determined based on this 0PID. Transfers as well as system co-operation can also take place on the basis of this data (opID).

5 Priority conventions are established for ACK messages (=SACK responses), and multiple microprocessor systems! , 03 simultaneously, and the priority is determined dynamically (while transmitting) in the NESA1 work 50b. Determining the status of global resources for a given task is now performed in a significantly improved manner compared to the system. The resulting response is - reliable, never exhibits unspecified conditions, and, furthermore, does not require software or consume time on the local processor (=individual processor module). . Thus, for example, deadlocks can never occur due to frequent status requests that prevent the execution of a task. Many optional operations of the multiprocessor are available at various status levels. Never before have local processors been able to continue operating independently of each other, yet a single query elicited a single, global, prioritized response. .

It may be helpful to explain the series of conditions shown in FIG. 12 in some detail here. "
The "busy" state and the "waiting" state are states in which an assigned or delegated subtask will gradually progress to a stage closer to completion;
The state represents a state that requires further processing or events. These “bizui” and r
The ``Waiting'' state represents an example of an escalation in which a TN's status increases to a higher level until it reaches a status level at which it can send or receive message packets for that TN. It is.

On the other hand, when transmitting or receiving message packets, the ability of the TN in message control, which is another feature of the TH, is demonstrated. When microprocessor system 103 has a message to send, the status display changes to ``5endready''. In addition to updating the status display, microprocessor system 103 also updates the status display in FIG. using the word format of
"Next Message Vector" value to HoS, RAM
26''. This input entry specifies from which location in the H, S, RAM 26'' the corresponding output message should be retrieved. This vector connects multiple output messages related to a specific TN into one (=chain).
network interface 120
This is used internally.

Functions related to the above functions are
eive ready ) is executed during the J state.

In this “ready to receive” state, the microprocessor is stored at the TN storage location (=TN address).
An input message count value obtained from system 103 is maintained, the input message count value being a value related to the number of messages that can be received in association with a given TN. . This count value is decremented as input messages are transferred one after another, and may eventually reach zero. Once it reaches zero, no more messages can be received and an overrun condition will be displayed. As described above, the speed of transmission between the network 50b and the microprocessor system 103 can be adjusted using the TN.

To explain the local (= individual processor) aspect, while processing is being executed in an individual processor, TN is a constant and unchanging standard that applies throughout the system in transmitted messages and received messages. is maintained as. The rTNOJ state, the default state, also serves as a local command to indicate the fact that the message should be used in non-merge mode.

To explain from a more global perspective, rTNOJ and rT
By distinguishing various values where N>J as having different properties, one command function among a plurality of command functions using TN is defined. That is, by distinguishing TN in this way,
A characterization indicating either ``merge'' or ``non-merge'' is attached to each message packet, and priority determination and sorting of multiple messages is thereby performed. , a powerful system operating method has been obtained. Similarly, "Assigned (assigned state)" and "Unassigned (state where assignment has been made)"
signed: unassigned status)", "
Non-Participant Processor
) J and the status ``initial'' are used to perform global intercommunication and control functions. The "unassigned" state is a state where the processor previously abandoned the TN, and therefore it is a state where it is necessary to receive a new primary message that reactivates the TN. If the status display is “
If the processor is displaying "Unassigned" when it should be "Assigned", this indicates that the TN was not entered properly.
Corrective action must be taken. If a TN is ``assigned'' when it should be ``unassigned,'' this indicates either an incomplete transfer or a conflict between two processors for a new TN. It may be an indication that something is being done. Neither of these "assigned" and "unassigned" states are treated as readiness states, because at the stage when they are displayed, the processor has not yet started working on that TN. It is.

Furthermore, the "initial" state and the "non-participating processor" state are also important in terms of global resources.

A processor that is about to come online, that is, a processor that must go through the process of joining the system, is in an "initial" state, which means that administrative steps must be taken to bring it online. This indicates that you need to step on the A processor in the "uninvolved processor" state with respect to a given task does not need to perform any processing locally; however, by tracking and monitoring this TN, it is possible to prevent this TN from being inadvertently used inappropriately. It is necessary to make sure that this does not happen.

Referring again to FIG. 10, H, S, RAM26
In addition to the types described above, the dedicated directory or reference section of `` also contains a number of other types of messages, given priority, that are used to generate responses in hardware. .N A (
The entry "not assigned" (meaning "not assigned") is prepared for future use and is maintained in a usable state. Three different types of NAK responses! (NAK responses for Overrun and TN Error Locked) have the smallest data content and therefore have the highest priority, because these NAK responses indicate error conditions. It is. A plurality of 5 ACK responses are followed by ACK responses and then NAP responses (non-applicable processor responses), which are arranged in order of decreasing priority. In the configuration of this specific example, two response command codes are not assigned a function (that is, they are set to NA) and are kept available for future use. The directories described above can be initialized by software and utilized by hardware, allowing for rapid and flexible generation of any of a wide variety of response message texts. Can be done.

Use one independent part of the above directories that is independent of the other parts to perform TOP, GET, P
The respective addresses of UT, as well as BOTTOM, ie, a pointer to the function of the circular buffer for input messages and a pointer to the completed output message, are stored therein. These pointers are used to manage input messages and output messages, respectively.
, S, and dedicated sectors of the RAM 26''. A circular buffer scheme is used for input messages; in this case, H, S,
, rTOPJ stored in the directory section of RAM 26" is a variable address that specifies the upper limit address position for the input message. The PUT address stored in the same directory section is the next received address. This specifies the address location where the circuit should store the message.GET
The address is set and continually updated by the software so that the hardware knows the address location where the software is blanking the buffer.

Management of the input message buffer is done by setting PUT to the bottom address of the buffer and starting with the GET address equal to TOP. The operational rule established by the software is that GET must not be set equal to PUT;
If so set, an ambiguous condition will occur. When an incoming message is entered into the large message buffer in RAM 26'', the message length value contained within the message itself determines the starting point of the next incoming message. , the PUT address stored in the directory is then modified to indicate the storage location in the buffer that will accept the next incoming message. 103
is capable of retrieving input messages when his/her working capacity allows.

The data stored in the output message storage space in the H,S, RAM 26'' includes the output message completion vector held inside a circular buffer independent from other parts, as well as the output message storage space in the H,S, RAM 26''. Used with Next Message Vector. Individual messages can be edited (assembled) and stored at any location, and multiple messages that are related to each other can be chained together to send them over the network. It is now possible to do so. H,S.

In the directory section of “RAM26”, TOP
, 80770M% PUT, sequence 1. The address of each :GET is entered and updated as previously described, thereby maintaining a dynamic current indication of the location in the output message completion buffer. The message completion vector constitutes an indexing address for pointing to a message stored in the output message storage space that is indicated by a received response to have already been properly forwarded. ing. As will be explained later, this system facilitates input of output messages by microprocessor system 103;
The microprocessor system 103 allows complex concatenated vector sequences to be handled in an orderly manner, thereby ensuring efficient use of output message storage space and forwarding of message chains.

The protocol of FIG. 11 described above in connection with the response is as follows:
Following the response, a primary message is also specified. A plurality of types of response messages are arranged one after the other, and the hexadecimal command codes are illustrated in ascending order. Among the group of primary messages, the merge stop message (this message is also a non-merge control message, which is a basic control message) has the smallest data content.
Therefore it is of the highest priority. This message constitutes a control communication that terminates the merge mode in the network as well as in the processor module.

A large number of different types of primary data messages are available with ascending priorities, and they can be assigned priorities based on application and system requirements. You can add classification. As mentioned above, continuation messages that follow other messages should be given a high priority in order to maintain continuity from the previous message packet regarding fidgets. Can be done.

The bottom group in Figure 11, which consists of four types of primary messages, is the only type of status message that requires a status response from highest to lowest priority. status·
request messages, control messages requesting "rTN relinquishment" and "rTN assignment", respectively, and a lower priority "merge initiation" control message.

The above configuration enables operations that can be used for many purposes, as will be clear from more detailed examples described later. The processor module has a current transaction number (presenttransaction).
n number : P T N ), in which case the PTN may be externally specified by commands from the network, and may perform consecutive operations. The same is true even if it is generated internally during the process.

When a merge operation is being executed, the processor module is performing the operation using a global reference, that is, a transaction identity (= information for identifying a transaction), and this transaction identity is Defined by TN. Starting, stopping, and restarting a merge operation is accomplished using simple message changes. When a subtask does not need to merge messages, or when message packets are generated that have no particular relationship with other messages, these messages are output to rTNOJ. are arranged in a queue, and are currently in the basic state or default state (0) determined by the transaction number.
The transfer takes place while the true state remains true. This r
The TNOJ state allows messages to be queued for forwarding when merge mode is not used.

(Network Interface System) Reference will now be made to FIG. 13, which shows in more detail one specific example of an interface circuit suitable for use in the system of the present invention. This “network”
The description of "interface system" includes a number of detailed features that are not necessarily necessary to understand the invention, but which are incorporated into the actual system. , therefore, it has been included in the description to clarify the position of the various specific examples with respect to the gist of the invention. Regarding specific configurations and detailed structures for gating, which are not the subject matter of the present invention and are related to well-known means, a wide variety of alternative configurations can be adopted, so explanations will be omitted. Or I decided to simplify it. FIG. 13 shows the second network interface 1 shown in FIG.
20°, H, S, and RAM 26''.2
12 interfaces for each network
0.120'' function in a similar manner to each other, so it is sufficient to discuss only one.

In FIG. 13A, the input from the active logic network 50 connected to the illustrated interface is provided to the network message management circuit 140 via a multiplexer 142 and a conventional parity check circuit 144. ing. multiplexer 142
is further connected to the data bus of the microprocessor system, thereby allowing access to the message management circuit 140 via the data bus. This feature allows the microprocessor system to operate the interface in step-by-step test mode, and to test the interface as if it were connected online to the network. Data transfer is performed in this manner. Input from the network is provided to the receive network data register 146, with the byte data input directly to the first section of this register 146 and the byte data input via the receive byte buffer 148 to the receive network data register 146. There is a byte data input to the register 146, and the receiving byte buffer 148 stores its own byte data after inputting the byte data to the first section.
Data is input into another section of this register 146. This causes both of the two bytes that make up each received word to be input to the receiving network data register 146 and remain available there.

The output message transmitted from this is input to the transmitting network data register 150, and is also input to the parity generating circuit 132.
Bits are added. Messages are sent from network message management circuit 140 to a network connected to it, or (if test mode is used) to a microprocessor system.
Sent onto the data bus. For the purpose of message management within this interface, the format of the transmitted message stored in random access memory 168 is such that it includes identification data as well as message data. As can be seen in Figure 21A, commands, tags, keys, and DSWs can all be combined with the primary data to be transmitted.

The configuration shown in FIG. 13A is essentially the same as the configuration shown in FIG. 8, except that in FIG. The microprocessor system 103 is shown as having an address bus and a data bus connected to an independent C port. However, in reality, the 13th
As can be seen from Figure A, such access from two mutually independent directions is achieved by time division multiplexing of the input address function and output address function in the H, S, RAM 26'', which is performed inside this interface. The data bus and address bus of the microprocessor are connected to gates 145 and 1, respectively.
49 to each bus of the interface, thereby allowing the microprocessor to operate asynchronously and based on its own internal clock.

The timing scheme employed is based on clock pulses, phase control waveforms, and phase subdivision waveforms, which are generated by interface clock circuit 156 (FIG. 13). , and has the timing relationship shown in FIG. 14 (FIG. 14 will also be explained later). Interface clock circuit 156 receives the network one word clock from the nearest node, and phase lock clock source 157 receives the zero time clock as described above in connection with FIG. Includes means for maintaining skew.

The nominal network word clock rate in the network of 240 ns is subdivided in time within the interface clock circuit 156, which is done by a frequency multiplier (detailed ), but the duration is 40ns
A high-speed clock (PLCL in Figure 14) that determines the cardinal period of
(denoted as K). The basic word period is determined by the total period of 240n.
This is a periodic signal labeled CLKSRA in the figure that is inverted every half cycle. There are two other signals with the same frequency and duration as this CLKSRA, PLCL
These signals are generated by a frequency divider 158 based on CLKSRA and are generated at times delayed from CLKSRA by one and two PLCLK cycles, respectively, and are designated CLKSRB and CLKSRC, respectively. is given.

Based on the above various signals, the control logic 159
It generates timing waveforms called rIo GATEJ, rRECV GATEJ, and rSEND GATEJ (hereinafter also referred to as gate signals), and these timing waveforms display each interval divided into three consecutive intervals of the word period. It is something to do.

These intervals are given appropriate names: "IO Phase", "Receive Phase", "Transmit Phase". These phases defined by the gate signals are each further defined by the "IOCLKJ signal,"
rRECV CLKJ signal and rsEND C
The LKJ signal is subdivided into two equal half-intervals, which define the second half of each phase. The byte clocking function uses the rBYTE CTRLJ signal and the rBYTE C
LK” signal.

The above IO phase, RECV phase (reception phase), and 5END phase (transmission phase) are operations in which the random access memory 168 and the microprocessor system bus are time-division multiplexed. It provides the foundation for being able to do so. The interface can only receive or transmit one word per word period to or from the high speed network, and obviously it never receives and transmits at the same time. Transfer rates to and from the microprocessor system are considerably lower than transfer rates to and from this network, but even if they were equal, it would be too much for the capabilities of the interface circuitry. It will not be a burden. The system configuration of this interface is such that most operations are performed by direct access to random access memory 168, so that little internal processing or software is required. It has become. Thus, as the system cyclically passes through successive phases within each word period, the words successively and without colliding with each other will receive the predetermined multiples for those words. The signal path is advanced along the signal path, thereby performing various functions. For example, sending messages to the bus may occur in between receiving messages from the microprocessor, each of which may be performed in an alternating manner using different portions of memory 168. Can be done.

Intercommunication between the data bus and network interface of a microprocessor system is
Management circuit 160 (reads/writes this IO)
(sometimes referred to as "ead/write"). a write gate 162 for gating words coming from the microprocessor system;
A system read register 164 for sending words to the microprocessor system provides a connection between the microprocessor's bus and the bus interface to the network interface.

Also included in the network interface subsystem are a memory address register 165 and a parity generator/check circuit 166. In this example, the high-speed memory (=H, S, RAM) consists of a 4 word x 17 bit random access memory 168, and the internal repartitioning of this memory and the The usage of the plurality of dedicated memory areas is as described above.

The size (-capacity) of this random access memory can be easily reduced or expanded to suit the needs of a specific individual application.

A receive message buffer management circuit 170 is connected to the microprocessor data bus and also to the memory 168 address bus. "Received messages"
The term J is sometimes used to refer to a message that comes in from the network and is input into a storage location called rPUTJ in a circular buffer, and after this input is sent as such into a circular buffer. Transfers an input message to a microprocessor, and is sometimes used to refer to such transfer. When this transfer to the microprocessor occurs, the value of rGETJ specifies from which location the system should perform successive retrieval operations in performing retrievals of received messages to be transferred to the microprocessor system. A plurality of address values used for accessing the random access memory 168 are stored in the GET register 172 and the TOP register 17.
4, PUT counter 175 and BOTTM register 1
76 respectively. The PUT counter 175 is
It is updated by incrementing by one from the initial position specified by the BOTTOM register 176. TOP register 174 provides an index of the other side boundary. TOP value and BOTTM
Both values can be manipulated by software control, allowing both the size of the receive message buffer and the absolute storage location in H, S, RAM to be changed. PUT
Once the contents of the register are equal to the contents of the TOP register, the PIJT register is reset and the 80770M
It is made equal to the contents of the register, thereby allowing this buffer to be used as a circular buffer.

GET register, TOP register, 80770M
Registers and PLIT counters are used to manage both the input message circular buffer and the output message completion circular buffer.

The input to the GET register 172 is under software control, since the next address is determined depending on the length of the message currently being handled in the buffer. . Comparison circuits 178 and 179 connected to the respective outputs of GET register 172, PUT counter 175, and TOP register 174 are used to detect and indicate overrun conditions. Overrun status is GET
When the value of G and the value of PUT are set to the same value,
This is the condition that occurs when an attempt is made to set the value of ET to a value greater than the value of TOP. In either of these cases, an overrun status indication will be sent and will continue to be sent until the overrun condition is corrected.

This sequential manner of configuring and operating the ``receive message'' circular buffer is particularly suited to this system. By allowing mutual checks to avoid conflicts, rP
It is now possible to manage UTJ with hardware and dynamically manage rGETJ. However, it is also possible to employ other types of buffer systems. However, this would probably add some extra burden in terms of circuitry and software. Here, referring to the 5zsB diagram, the format of the received message stored inside the memory 168 further includes the map result, data length,
and identification data in the form of a key length, and how these data are obtained will be explained later.

Internal DSW9 section 1 of this interface
90 includes a destination selection word register 192, into which a destination selection word (D
SW) is input. Using the DSW to address the dedicated DSW section of memory 168, this memory 1
68 on the data bus returns data that is used by the DSW management section 190.
However, it is now possible to determine whether the message packet is destined for the processor in question. As seen in FIG. 13A, the destination selection word consists of a 2-bit map nibble (nybl) address, a 10-bit map word address, and 4 bits for map selection. These "nibble" addresses are used to describe subsections of words from memory 168. The four bits for map selection are provided to a map result comparator 194 which receives the associated map data from memory 168 via multiplexer 196. Multiplexer 196 receives 16 bits of data, and these 16 bits are assigned to four different maps stored at the address specified by the 10 bits of the map word address contained in the DSW. - Represents a data nibble. memory 1
68 has its dedicated map section arranged in a form particularly suitable for comparison to facilitate the comparisons made here. The remaining two bits in DSW are provided to multiplexer 196 for its control.
Corresponding one of the four map nibbles
Nibble is selected. A comparison is made and the map code obtained as a result of the comparison is stored in the map result register 197.
and is inserted into the input message being input to memory 168.

If, as a result of this comparison, it is found that there is no "1" bit in any of the selected maps, a "reject" signal is generated and the processor
It is indicated that the module is not intended to receive the message packet.

Referring to FIG. 15, the memory 168 is shown in FIG.
A preferred method for subdividing a dedicated destination selection section and for performing a comparison of map results is schematically illustrated. Each map has 4
It consists of 096 words x 1 bit, and is further subdivided into an individual processor ID sector, a class ID sector, and a hashing sector (see FIG. 8).

A common map address is selected using 12 address bits (10 bits of map address and 2 bits of nibble), which allows one map address from each map to be selected.
Bit output is obtained.

(The multiplexer and its nibble of FIG. 13 are not shown in FIG. 15 for clarity).

These four parallel bit outputs can be compared with the four bits for map selection in an AND gate T198 consisting of four AND gates, and as a result, one or more matches are obtained. If so, the output of OR gate 199 will be in the "true" state. This map result is stored in the map result register 197 of the zt3A diagram.
, thereby causing the message to be accepted into memory 168. Otherwise, the message will be rejected and a NAK will be sent.

Command word management section 200 includes command word management section 200.
It includes a command register 202 that receives words. The TN field of the command word can be used to access the address bus, which examines the indexed receiver (KTN) to determine the appropriate response message (see Figure 18). reference).

Furthermore, when the "Start Merge" command is being executed, a data transfer path from the TN field to the PTNR (current transaction number register) 206 is secured; This is to enable the value of PTN (current transaction number) to be changed.

Input messages entered into memory 168 are stored in memory 168, including the length of data and key fields, if used, in order to make address vectors available, as described with reference to FIG. There are also things that contain values. These length values are calculated by the received data length counter 210 and the received key length counter 21.
1, and each of these counters counts the number of consecutive words contained in those fields when provided with the fields corresponding to the respective counter from an input source. ing.

Additionally, an outgoing message management section 220 is used, which includes the ability to accept processed packets for storage in memory 168 and send those stored packets out to the network at a later time. are doing. This section 220 includes a transmit transaction vector counter 222, a transmit data length counter 224, and a transmit key length counter 226, which are bidirectionally connected to the data bus. A transmit transaction vector counter 222 is connected to the address bus, while a transmit data length counter 224 is connected to the address generator 22.
8, and this address generator 228 is further connected to the address bus. Message transmission is accomplished using both the output buffer section and the circular buffer that constitutes the output message completion vector section of FIG. However, in this particular example, after a plurality of message packets have been input sequentially, they are now retrieved into v in the order determined by the vector.

Within this interface, each independent operation phase is executed at mutually exclusive times, and by employing this time-sharing scheme, memory 168 is configured to operate at mutually exclusive times. a microprocessor system running asynchronously at its own slow clock speed, receiving and distributing message packets from a network, and performing internal operations at an efficient high speed. It is possible to communicate between. To control the gating of messages to the various counters and registers, a phase control circuit operates in response to control bits that control the command, DSW,
It generates data as well as other signals indicating the individual fields within the message. Transmit state control circuit 250, receive state control circuit 260, and R/W (read/write) state control circuit 270 receive clock pulses, identify fields within the data, and perform transmission, reception, and processor processing. It controls the sequencing of data flow during clock operations.

Control of this interface is controlled by three finite state machines (
FSM), each of which has a transmit phase, a receive phase, and a processor (R/
W) It is for the phase. Those FSMs are
It is constructed in a -numerical manner using a programmable logic array (PLA), state registers, and action ROM. Each FSM is advanced to the next state for each network clock cycle. Due to the large number of control signals to be generated, the output of the PLA is further encoded by the action ROM.

As will be readily understood by those skilled in the art, the translation of control sequences written for FSM mode, and therefore with numerical detail structure and operation, which is necessarily necessary for the operation of the network, is , is a simple task, although it requires a lot of work.

The inclusion of the state diadams of FIGS. 17 and 19 and the seven-trix diadarum of FIG. 18 in the accompanying drawings provides a comprehensive overview of the internal structural design features that can be employed in fairly complex systems. This is to present the details.

Figure 17 is a diagram relating to the reception phase, and Figure 19 is a diagram relating to the transmission phase, and the notation used in these figures corresponds to the notation used elsewhere in this specification and the drawings. It's working. For example, the following terms are:

RKLC= Receive Key Length
th Counter (receive key length counter) RDLΔ= Receive Data Length
Counter (receive data length counter) RNDR= Receive Network Dat
a Word Register (receiving network/
Data word register) PUTC = Put Counter (PUT counter) GETR = Get Register (GET register) Therefore, the state diagram can be understood almost without explanation if it is referred to in comparison with FIG. 13 and the specification. can. The state diagrams detail the various sequences and conditionals involved in complex message management and interprocessor communications. Figure 17 (1st
In Figure 7A), the states labeled "Generate response" and "Decode response" and the conditional statements indicated by dashed rectangles are shown in Figure 18. It follows the specified responses and actions described in the matrix diagram. FIG. 18 shows both the response generated and the action taken for any combination of primary message and readiness state for a given TN. Of course, when the system is operating normally,
Although there is some message rejection, error conditions occur infrequently.

In both Fig. 17 and Fig. 19, most of the conditional judgments can execute multiple judgments at the same time, but in contrast, the state step It is gradually being changed. In either case, the sending and receiving operations are operations that proceed at a predetermined speed without requiring external control, and this is because the message structure and network operation method have already been explained. This is because it has become like that.

Many features employed in typical processor and multiprocessor systems are not germane to the present invention and therefore will not be specifically described. Among those characteristics are
There are parity error circuits, interrupt circuits, and various means for monitoring activity such as watchdog timers and a wide variety of implementation functions.

(Specific example of system operation) What will be explained below is a system that integrates Figures 1, 8, and 13.
These are some specific examples showing how it works internally in various modes of operation in conjunction with. Specific examples of these are:
Demonstrates how the interrelationship between priority specification, the addressing scheme employed here, and transaction identity provides the functionality of both local control and global intercommunication. It is.

Receiving the Primary Data Message We will now discuss Figure 16 in addition to the other figures;
FIG. 16 is a simplified state diagram of the chain states involved in the final acceptance of the primary message. Even if the message is received in a buffer or memory,
Acceptance is not achieved until the illustrated logical conditions are met. Although it is shown as a serial sequence of events in the diagram,
Originally, multiple judgments were to be made in parallel, that is, at the same time, and this was because the respective conditions were not related to each other, or because the circuit had to skip intermediate steps to reach a certain operating step. This is because it is carried out by

Messages on the network of FIG. 1 pass through the receiving network data register 146 of FIG. 13A.
It is passed through until an EOM condition is identified, at which point the message is recognized as complete. "If the LOCK J state exists, the system
NAK/LOCK
Send a rejection message.

If not, ie, a "lock" condition does not exist, the system moves to a map comparison check, which is performed within the DSW management section 190 in the interface shown in FIG. 13A. If a suitable comparison result exists, indicated by ``map output = 1'', the system can continue to receive the message. If no such comparison exists, the message is rejected and a NAP is sent.

Once the appropriate map has been determined, the system is then ready to check the TN status, which is done by referencing the TH directory shown in Figure 8. (here, TN status strictly refers to the status of the processor for a given TN, so H, S
, the readiness state represented by the entry stored at the TN address in RAM).

To explain in more detail, this TN status check is as follows:
This is done to determine whether the local status (=status of each processor module) is "ready to receive."

Here, it is assumed that the TN has already been assigned by a certain preceding primary message.

As a result of this check, the TN is in the "done" state, the "non-participating processor" state, or the "initial" state.
If the status is found to be one of the following, an rNAPJ rejection message is sent (here, TN is strictly speaking H, S, and T in RAM).
This refers to the entry stored at the N address.
Hereinafter, unless there is a risk of confusion, this entry will also be simply referred to as TN.) If this found status is any other unspecified condition, the rejection message sent is an rNAK/TN error, and the above two types of rejection messages are also included in the response directory of Figure 8. taken from. If the status is "ready to receive", yet another determination will be made.

This other determination is related to "input overrun," and as described above, this determination is made when the GET address and PUT address are This is done by comparing the Additionally, the transaction number is also checked to see if the value of the received message count is non-zero; if this count value is zero, it is also indicative of an input overrun. If an overrun condition exists, r
The message is rejected with a NAK/input overrun.

If all the above conditions are satisfied, H, S, R
The rACKl message (acknowledgement message) is retrieved from the response directory in AM26'' and sent out on the network, where it will be contested for priority with other processor modules. Some may have similarly sent out acknowledgments of received messages.

At this point, if the common response message received from the network (where "common" means merged) is an rACKJ message, then "all" processor modules selected as receiving processor modules However, if it is specified that the message received earlier can be accepted, the received message is accepted. If this response is rA
If it is in any form other than CKJ, the previously received message will be rejected by ALL processors.

In this specific example of reception and response, after a primary message is received, all processors are focused on generating one of an ACK response, a NAK response, and a NAP response. I want to be Once the processor receives any one of these response messages, it can immediately attempt to transmit the primary message. (The processor may also make this transmission attempt after a delay equal to or greater than the total latency to traverse the network, which was already discussed in the Active Logic Nodes chapter. (as I did). Another thing to note is that if several processors send "identical" messages to each other,
Consequential? , τ It is also possible that all of those messages have survived the competition on the network. In that case, "all" of those transmitting processors will receive an ACK response. This is explained in detail in the specific example below.
- simultaneous transmission) and global semaphore mode operation.

Implementations of the invention in actual use include many more types of responses and perform a variety of operations in addition to those described above. FIG. 18 shows these responses and operations for the separate states of LOCK, TN error, and overrun, nine different pre-identified status levels, and acknowledgment (AC).
K) and non-applicable processor responses are shown in columns.

When a processor module is ready to send a message, the PTN value stored in the PTN register 206 of FIG. 13 is ready for use.
Therefore, all that is required is confirmation that the TN status is in the "ready to send" state. As can be seen from Figure 12, the entry (description) for "Ready to send" is
Contains the next message vector address for the output message. Once assembled, the output message is sent out on the network, and if it loses the contention, unless the PTN is changed midway through.
This sending operation is repeated until the transmission is successful, in which case a response will be received. If the transmission is successful and an acknowledgment is received, the address vector is modified. The next message vector is taken from the second word in the current message (FIG. 21A) and this word is transferred from transmit transaction vector counter 222 to random access memory 168. If the output message section is not in overrun, the PUT counter 175 is incremented by one, and this overrun condition is indicated by PUT equaling GET. Note that the next message vector transferred from the transmit transaction vector counter 222 is input to the transaction number address currently specified by the transaction number register 206 in the H, S, RAM. If this new TN is in the "ready to send" state, the value of this input vector is again the storage location of the next message related to this transaction identity. pointing to. See FIG. 21 for the format of the output message stored in the H, S, RAM.

However, message management when sending messages can include many different types of actions, including changes internal to the PTN or external to the PTN. An error condition, overrun condition, or lock condition causes the system to change the transaction number to
TNOJ, which returns the system to non-merge mode and then checks the status at rTNOJ.
``Ready to Send'' status is identified or a new TH
This will continue until the allocation is made. Please refer to the flowchart of FIG. 19 (FIG. 19A) for an illustration of conditions and conditions that may be employed in a fairly complex implementation.

Example of Output Message Completion Buffer Once the completion of a message transmission is indicated by any other response message except LOCK, a pointer to the newly completed output message buffer is set to H,S. , is stored in the output message completion circular buffer section of RAM (see FIG. 8). This pointer is simply a 16 bit word representing the address of the output message buffer. (
The format of the output message buffer is shown in FIG. Note that the output message buffer contains a place to record response messages received from the network).

The output message completion circular buffer provides communication between the network interface hardware 120 and the supervisory program located on the microprocessor 105. A program included in this microprocessor stores messages to be output in the H, S, RAM. As will be explained in more detail in the following example, it is also possible to chain multiple output messages together (in a chain) so that TN acts as a pointer to the beginning of this 1i1 (chain). This allows complex sequences of operations to be formed. Another feature is that the network can be multiplexed, or time-division (multiplexed), between multiple THs (this will also be explained in detail later), so it can be Messages can be output in various orders.

Furthermore, it is possible to quickly recover the storage space in the H,S,RAM occupied by the successfully transmitted packet, thereby reusing it for another output packet to be output. It is important to The output message completion circular buffer performs this function.

Once the transmission of a data message has been successfully completed and a response other than a "lock" response is received, the network interface sends a "0510
(hexadecimal number)" PUT pointer (first
0) is advanced by 1, and the address of the first word of the output message that has just been sent is stored in the address in the PUT register. (When the value of the PUT pointer becomes larger than the value of the TOP pointer stored in r0512 (hexadecimal), the PUT pointer becomes the same as the BOT pointer (=BOTTOM pointer) stored in r0513 (hexadecimal). first reset). If the PUT pointer becomes larger than the GET pointer (storage location r0511 (hex)), the circular buffer has overrun and an "error interrupt" is generated to the microprocessor.

Software executing within the microprocessor asynchronously examines the output message buffer pointed to by the GET pointer. Once the processor has completed some processing that it was requested to perform, G
Advance the ET pointer by 1 (the value of this GET is
If it becomes larger than the TOP value, it will be reset to the BOT value). If GET=PUT, there are no more output messages to process. Otherwise, further output messages have been successfully transmitted and must be processed. This process includes H, S, RA
It involves returning the storage space of M's output buffer to free space, so that this space can be reused for other packets.

An important thing to note here is that the output message completion circular buffer and the input message circular buffer are separate from each other, so these two circular buffers each handle separate PUT, GET, TOP, and B
OT17) It is managed by each pointer. In some configurations, both circular buffers can share circular buffer management hardware 170, as shown in FIG. 13, but this is not required.

Each processor module has the ability to access the TN within its own high-speed random access memory 168 (FIG. 13); Multiple Ts that can be used
N, its directories are included. However, unallocated TNs are clearly indicated as unallocated by the transaction number value stored in the storage location associated with the TN. Therefore, microprocessor system 103:
identifying unassigned transaction numbers and selecting one of them for use in initiating communications with other processor modules regarding a given transaction identity; can.

Transaction numbers are assigned and updated locally under the control of the local microprocessor (= microprocessor in the processor module), but global control throughout the network is
This is done using the primary control messages ``TN Abandonment Command'' and ``rTN Assignment Command''. A deadlock condition never occurs between competing processor modules that may request the same TN, because the network This is because priority is given to The remaining processors that did not get priority among the processors that tried to get that TN are rNAK/T
N Error" response indicating that those processors should try to reserve another TN. Therefore,
There is complete flexibility in securing and verifying these transaction identities within and locally within the system.

It should also be noted that repeated use of TN
This is done by shifting between the basic transmission mode, which is NOJ, and the merge mode, where TN is greater than zero. Therefore, the system can change not only the focus of its operation but also the nature of its operation by a single broadcast transmission of TH.

Yet another, and particularly useful, scheme for communicating changes in global status is the forced parity error propagation described above with respect to FIG. This unique display method, when transmitted between other transmissions,
The aborted system resources will be investigated and appropriate action taken.

There are two special types of processor-to-processor communication: one is communication directed to one specific destination processor, and the other is communication directed to multiple processors belonging to one class. This is a communication performed with the destination as the forwarding destination. Both of these types of transmission utilize DSW, and both of these transmissions are non-merging
Performed by mode broadcast.

In particular, when communicating between one source processor and one destination processor, destination processor identification information (destination process) is stored in the DSW.
ssor 1dentification: DP
ID) and use it. Referring to FIG. 8, when the selection map portion of the H, S, RAM 26'' of each receiving processor module is addressed using this DPID value, the specific processor intended as the transfer destination is addressed. Only a module can generate a positive response and accept the message.A positive response is sent and
And if it is finally successfully received, both processors will be ready to perform any future operations requested.

When a message is to be received by multiple processors belonging to a class that are related to a control process, the map nibble and map nibble in the DSW are
The address specifies the corresponding section in the selection map portion of the HoS and RAM. All receiving processors then send respective acknowledgments that continue competing to reach the originating processor module until the round trip for this communication is finally completed. become.

A global broadcast mode of processor communication may be used to communicate primary data messages, status messages, control messages, and response messages. A priority protocol and a network with the ability to give priority.
The inherent capabilities of both allow such messages to be easily inserted into sequences of other types of messages.

Hashing mode processor selection is by far the most commonly used processor selection method when performing data processing tasks in relational database systems.

- A number of disjoint (=not sharing the same elements) data subsets of secondary data (=main data not for backup) and multiple disjoint data subsets of backup data are distributed among different secondary storage devices according to a suitable algorithm. If one processor is responsible for a subset of the primary data and another processor is responsible for a subset of the backup data, and the two processors respond simultaneously, the message for the secondary data Priority will be given to those who In order to compensate for this condition, a command code with a higher priority (see FIG. 12) may be selected.

Maintenance of database reliability and integrity is also achieved by utilizing the various multiprocessor modes described above, which are then applied in the most advantageous manner to the particular situation encountered. . For example, if a secondary storage device that is responsible for a certain subset of secondary data fails, special processor-to-processor communications can be utilized to update it. Correcting errors or rolling back portions of the database can also be done in a similar manner or by operating in class mode.

Transaction Number Example The concept of transaction numbers provides a new and powerful hardware mechanism for controlling multiprocessor systems.

In the tree system, the transaction number is r
It constitutes a ``global semaphore'' and plays an important role in sending and receiving messages to and from the network and in checking the readiness status of a given task distributed among multiple processors. .

Transaction number (TN) is H2S, RAM
It is physically implemented as 16-bit words in 26 bits. This word can perform various functions,
The format is shown in FIG. 12). T
Since N is stored in H, S, RAM, it can be accessed from both microprocessor 105 and network interface 120.

The term ``semaphore'' is used in computer science literature to indicate a variable used to control multiple processes that are executed asynchronously with each other.
It is used numerically. A semaphore has the property that it can be "tested and set" in a single non-disruptive operation.

- For example, “UNASSIGNED
: Unassigned state)" and "Assigned (ASS[NED: WjJ assigned state,
9) Let's consider a semaphore variable that can take two states with J. In this case, the test-and-set operation is defined as follows: if the semaphore was in the "unassigned" state, set the semaphore to the "assigned" state and indicate success; Conversely, if the semaphore was already in the ``assigned'' state, leave the semaphore in the ``assigned'' state and display ``failed.'' Therefore, according to this semaphore, a process that successfully tests and sets the semaphore can continue with its task, while
A failing operation may either wait for the semaphore to be reset to the "unassigned" state, or attempt to test and set another semaphore controlling another equivalent resource. be forced to do one or the other. It is easy to understand that if a test-and-set operation could be interrupted, it would be possible for two processes to access the same resource at the same time, which would cause the prediction There is a risk that incorrect results may occur that cannot be corrected.

Any multiprocessor system actually implements in hardware a concept that can be equated with a semaphore to control access to the system's resources. However, conventional systems are only able to maintain one copy of a semaphore (a semaphore with one copy, that is, a semaphore provided at only one location). Therefore, if a multi-copy semaphore (a semaphore with multiple copies, i.e., a semaphore provided in multiple locations) is provided and maintained in each processor, one copy will be maintained.
This is desirable both for the purpose of reducing the number of times contention occurs for semaphore accesses that are merely for testing purposes, and for the purpose of utilizing multi-valued semaphore variables for other uses described below. The problem is that operations must be performed on multiple copies of the semaphore in a completely synchronized manner, and if this is not followed, then the , the integrity of access to resources will be lost.

Multiple copy semaphores, or "global" semaphores, are provided by the system. The following table compares the behavior for global semaphores to single semaphores (one copy semaphores).

(Left below) In the system of this embodiment, r T N ;';I
J command (ASSIGN TN) J command and rTN abandonment (RELINq+Hsu TN) J command are used as global semaphs.
They each have a test and set function and a reset function for the number. Referring to FIG. 12, the rNAK/TN Error" response indicates failure, while the rSACK/Assign" response indicates success.

The characteristics of this network include the synchronous clocking method used to clock multiple nodes synchronously, and the broadcast operation that transmits fk priority packets to all processors simultaneously. It forms the basis of the first floor that actually embodies the concept of a semaphore. Because this concept is implemented, the system controls the allocation, deallocation, and access of multiple copies of a desired system resource by simply
This can be done by adding N.

The most important thing here is that the control of distributed resources can be executed with approximately the same small software overhead as in the case of a single semaphore. This is a huge improvement over traditional systems because they
This is because either distributed resources cannot be managed, or complex software protocols are required and create hardware bottlenecks.

Readiness status “BIISY (BIISY) J,” “Waiting (W)”
AITING), [READY]
JC sending (preparation completed for M and receiving), ``Complete'' (D
ONE) J, and [non-participating processor (NUN-1')
A set of values (see FIG. 12) consisting of "ARTICIPAN END)" provides the ability to quickly determine the readiness state of a task given a certain TN. In this system, the meaning of each of the above states is shown in the table below.

Using the "rTN assignment" command, a TN is dynamically assigned to a task. Success display (rT
"/Assign to rSAC for N-assigned J message"
response), all operational processors successfully T
What should be noticed at t1 regarding FIG. 11, which indicates that the assignment of N to the task has been completed, is the rNAK/TN error.
The response has a high priority (small value) so that if any processor's network interface 120 detects a conflict regarding the use of the TN, all processors will receive a failure response.

Furthermore, the op of this failure response transmitted over the network
The +o (originating ternary processor ID) field will display the first processor (the one with the lowest assigned number) among the processors that have had a conflict. This fact is utilized in diagnostic routines.

Each processor manages the task and assigns the TN to ``busy'', ``waiting'', ``ready to send'', ``ready to receive'', ``terminated'', or ``non-participating processor'' through the action of software. ” to the appropriate one. Any processor, including the processor that issued the "initial rTN assignment", can check to what extent a task (TN) has been completed by issuing a "status request" command or "merge start" command at any time. This condition can be easily confirmed.

A "status request" is equivalent to a single test of a multivalued global semaphore. As can be seen in FIG. 11, the status response (SACK) message with the highest priority will win out the competition on the network, resulting in the lowest readiness status being displayed. Further, the 0PID field will display the identity of the first (lowest numbered) processor among the processors in the lowest readiness state.

Using this latter characteristic, a form of "non-bysy J" has been defined for "waiting" for the completion of tasks distributed to multiple processors. First, rTN allocation is performed. The processor that issued the command is said to be the first-generation "wait master." This processor then designates some other processor as the new "wait master" based on arbitrary criteria. This new “
Once the Wait Master has reached the desired state of readiness, it issues either a ``Start Merge'' or a ``Status Request.''
Query all processors. If all other processors were in the ready state, 5
ACK will indicate that. If some processors were still not ready, 5A
The PID field of the CK response will indicate the first of the processors with the lowest readiness state. The "weight master" instructs its processor to become the new "weight mask."

Eventually, all processors will be ready, but until then the system will query the status every time it is notified that at least one processor has reached the Ready, or Deaf, state. Just try. The system is thus not burdened with periodic status queries that consume resources without producing results. Additionally, this scheme ensures that the system knows that all processors have completed their work at the exact time the last completed process finishes. As will be understood by those skilled in the art, many other forms of "waiting" may be employed within the scope of the inventive concept.

The "start merge" command is one special type of test-and-set instruction. If the status of the global semaphore is ``Ready to Send'' or ``Ready to Receive,'' then the current transaction number register (
PTNR) 206 (see FIG. 13) is set to the value of the transaction number in the "Start Merge" message (see FIG. 3), thereby setting the PTNR register. If any of the active processors are in a lower readiness state, the value of PTNR is unchanged.

The "stop merge" command is a reset operation that corresponds to the above operation, and is a reset operation that
This unconditionally resets NR to rTNOJ.

As explained below, the current global task specified by PTNR
sk) are the only messages related to
It is designed to be output from the interface 120. Therefore, the ``Start Merge'' and ``Stop Merge'' commands provide the ability to time multiplex the network between multiple tasks, thus allowing them to Multiple tasks can be stopped and/or restarted at will.

An important detailed feature of the invention is that network interface 120 ensures that commands from the network and access to the TN by microprocessor 105 are never simultaneous. be. In this example,
This is read/1! from the reception state control circuit 260. This is accomplished by a signal being sent to the F-inclusive status control circuit 270, which is in the "affirm" state whenever a command from the network that may change the TN is being processed. There is.

During the short time that this signal is in the "affirmed" state, the processor restricts access to the H, S, RAM by the control circuit 27.
Forbidden by 0. As will be appreciated by those skilled in the art, a wide variety of alternative configurations may be employed in lieu of the above configurations without departing from the scope of the present invention.

reception control Yet another function of the TN is the control of incoming messages.

By using the ``rTN Assign'' command, input message streams on multiple processors can be associated for a given task. When the TN assigned to a given task in a given processor is set to "ready to receive," the TN also includes a count value representing the number of packets that the processor is prepared to accept. Displaying (i12
figure). Network interface 120 decrements this count value each time it successfully receives an individual packet (the decrement is done by arithmetically subtracting "1" from the word of TN).
This decrement continues until this count value reaches zero. As soon as the count value reaches zero, rNA
CK/Overrun" response is generated, thereby informing the processor sending the packet that this NACK
It is informed that it must wait until the processor issuing the response is ready to accept more input packets. Furthermore, as can be seen from Figure 18,
At this time, PTNR is also reset to rTNOJ.

The above operating mechanism allows direct control of the flow of packets flowing through the network. It also ensures that one processor is not loaded with too many unprocessed packets and that the processor does not become a bottleneck for the system.

To explain Meng 11 Raccoon Figure 21A, as you can see from the figure,
Each message stored in H, S, and RAM is
The N vector contains a field for accommodating the value of the next message vector. After sending a message and successfully receiving a response to it, the new TN vector contained in the message just sent is set to the address in H, S, RAM to store the current transaction number. (transferred from PTNR). Therefore, the TN is updated each time an individual message is sent, and it is possible to automatically set the TN to the desired state when a message is successfully transmitted. .

To explain Fig. 12, the TN of “Ready to send”
The format of contains a 14-bit HlS, address in RAM, which is the address for a given task (
This is used to indicate the next packet to be output regarding the TN).

Therefore, the TN stored in H, S, RAM is
First-in, first-out (F
It also functions as a head pointer pointing to the head of the IFO) queue. Therefore, given 1
As far as one task (TN) is concerned, each processor will attempt to send packets in the order determined by the chain of new TN vectors.

Combined with the previously described mechanism for rapidly multiplexing networks between multiple TNs (tasks), complex combinations of paper sheets distributed among many processors can be achieved. It is clear that many tasks can be managed with very little software overhead. The configuration provided by the network, interface, and processor collaboration allows copies to be distributed among hundreds of side processors, or even among dozens of processors. This is a suitable configuration for allocating and de-allocating resources, suspending and resuming tasks, and performing other controls for resources and tasks that can be controlled.

Example of DSW (Destination Selection Word) The Destination Selection Word (Figure 3) is the DSW logic 190.
(Fig. 13) and DS of H, S, RAM26 (Fig. 8)
By cooperating with the W section, t2 provides multiple modes that allow the following: That is,
These modes are those in which each receiving processor's network interface 120 determines whether a message being received is intended to be processed by the microprocessor 1o5 associated with that network interface. Multiple motes to help you get down quickly. As already explained, the DSW included in the received message is H, S, R.
A nibble stored in the DSW section of the AM is selected and compared to that nibble.

Processor Address As shown in Figure 8, H, S, RAM DSW
One portion of the section is devoted to storing processor address selection nibbles. In the tree system,
For each of the 1024 processors that can be installed, H
, S, is associated with one of the bit addresses contained in this portion of RAM. Bits associated with the ID (identity) of the processor
The address bit is set to ``1'', while
All other bits in this section are set to ``O'', so each processor has only one bit in this section set to ``1''.

B. Another portion of the DSW section of the RAM is devoted to storing hash maps. In this system, two of the map selection bits
bits have been applied to their hash maps, resulting in two complete sets containing all 4096 possible values. hashed mode (h
ashedmode ), the keys for records stored in secondary storage are set according to a hashing algorithm, whereby keys from 0 to 40
The allocation of "packets" up to 95 is performed.

The processor responsible for record 1 contained in a given "packet" sets a "1" bit in the map bit whose address corresponds to the packet number of that packet. ing. Other bits are set to "0". A given processor can be responsible for multiple packets by simply setting multiple map bits.

In the configuration of this embodiment, as is easily understood, the map bits can be set in the following manner. That is, for a given map selection bit, each bit address is set to ``1'' in only one processor, and any bit address is always set to ``1'' in one processor. This method is set to "1" at the time. A direct result of adopting this approach is that each processor (AMP) is responsible for a distinct and disjoint subset of the records in the database, yet the system as a whole is responsible for the complete There are now such sets.

Although the above examples are explained using relational database problems as an example, those skilled in the art will readily understand that disjoint subsets of the problem are The same method can be applied to any task area that does not require a processor to share the task.

Yet another thing worth noting is that by having two complete maps, the scheme described above can be used to transfer packets that are assigned to a given processor according to one map to the other map. This means that it can be configured so that it can be assigned to a different processor. Here, one map is "-next"
A direct consequence of making the other map ``backup'' is to ensure that records that are temporary on a given processor are backed up on another. It can be done. Furthermore, there are no restrictions on the number of processors that back up a given processor.

As will be understood by those skilled in the art, the number of distinct maps that can be implemented within the scope of the present invention can be greater than two, and the number of packets can be any number.

In both cases of processor address and hash map explained earlier, if we examine a given bit address for all processors, we can find that bit address.
It can be seen that the address is set to 'l' in only one processor and the corresponding bit addresses in all other processors are set to 'OJ'.

However, it is also possible and useful to have corresponding bit addresses set to rl in multiple processors. This method is called “class
This is a method called "address" mode.

A class address can be thought of as the name of a procedure or function, copies of which exist in multiple processors. All processors equipped with the corresponding processing procedure or function have a "1" bit set in the corresponding bit address.

To send a message to a class address, the appropriate class address in the OSW (Figure 3) is set. All operational processors that are indicated as ``belonging'' to the class by having the bit in the appropriate location in the H,S,RAM set to ``1'' It will respond with rAcKJ to the received message packet. Processors that do not belong to the class respond with a NAP.

DSW therefore allows the routing calculations necessary to control the flow of messages within a multiprocessor system to be performed by hardware. Also, the program can be made independent of knowledge of which processor contains the various functions of the system. Furthermore, the map is H, S, R
Being part of the AM and therefore accessible from the microprocessor 105, it is possible to dynamically relocate certain functionality from one processor to another.

Merging Example In complex multiprocessor systems, a task may require the performance of a series of interrelated operations. This is especially true for relational database systems that handle complex queries, where data is assembled to form files, and then stored in multiple formats in a specific way. References to multiple secondary storage devices may be required to create a file that can be redistributed to the processors of the computer. The following examples illustrate how the systems of Figures 1, 8, and 13 can easily perform such functions by operating on TNs, DSWs, and global semaphores. This is a simple explanation of what is happening.

First of all, each time a merge coordinator (typically, but not exclusively, a merge coordinator is an IFP 14-16) merges a single file to form ( A plurality of AMPs belonging to one class (that is, functioning as data sources) are identified (among AMPIs 8 to 23). One unassigned TN is selected,
and assigned to identify the data source function. The second major function of distributing or hashing this file to another set of AMPs (which may be processors of the original data source) has not been allocated until then. A different TN is assigned.

The coordinator for this merge function assigns the DSW
Identify using. The participating processors involved in this Mahlangu work increase the level of their TN status to "busy" or "waiting" status, and then control of the merge operation is controlled by the participating processors involved in the merge operation. (i.e., the coordinator's job is delegated).

Each of the above plurality of participating processors (all other processor modules are non-participating processors with respect to their transaction numbers) receives and processes the message packet regarding the merge task thus defined. After sending an acknowledgment to the processor, the processor proceeds with execution of its own subtasks, updating its status level accordingly. Then, once the processor to which the merge coordinator job has been delegated has completed its own task, it sends a status message to inform all other participating processors of the status regarding that transaction number. A request may be sent and a response may be received indicating the least readiness of the participating processors.

Control of the merge operation is passed to the processor with the lowest readiness state, which can then poll all of its participating processors when its work is finished. The above process can continue, if necessary, until a response is received indicating that all participating processors are ready. The processor acting as a coordinator at the time such a response is received then begins forwarding the message to the H,SRAM 26 while identifying participating processors belonging to the class using the DSW. , With the transfer of this message, the status level is updated to "ready for transmission" based on the corresponding output message vector information. A subsequent poll results in all participating AMs
Once P is found to be ready to send, the coordinator issues a merge start command for that particular TH.

While a merge operation is being performed, processed data packets are directed and forwarded to multiple processor modules belonging to a class for distributing the results to secondary storage according to a relational data hierarchy. It turns out. Regardless of whether or not these plurality of receiving processors are the same as the plurality of processors that are the source of this transfer, the participating processors (i.e., the above-mentioned receiving processors) belonging to the class that participates in this distribution, D
SW and the transaction is identified by a new TN. All participating processors involved in this new transaction will be assigned this new TN, and they will also increase their readiness level to "ready for work." I will do it. This DS
W can also be a passing selection specification rather than a class specification, but in either case, all participating processors are in a state where they can receive the broadcast message while the merge is being performed. is placed in When "start merge" is issued, a plurality of message packets are sent out onto the network simultaneously from each of the sending processors that should be involved in the sending operation, and the message packets are Priority is determined dynamically (during transmission). Each processor involved in sending out
Once f3 has completed sending its own set of messages,
Each of the sending processors in Sowara has an "End of file" defined in a certain format.
File ) J message, this "end of file" message has lower priority than various data messages. This ``end of file'' message continues to lose competition with data messages until all participating processors have sent out ``end of file'' messages, and all participating processors have sent out ``end of file'' messages. Only then, the transfer of the ``end of file'' message is achieved. Once this transfer has been accomplished, the Coordinator will call the “End of Merge”
rTNi relinquishment, which terminates the transaction. Overruns, error conditions, or lock conditions can be appropriately handled by merging or restarting the transmission from the beginning.

Once the merge operation regarding one TN is completed,
This system uses the next T in a sequence of TN.
It can be shifted to N.

Once each processor module has created a queue of message packets that correspond to this new TN, those processor modules begin again asking the network to perform the merge operation. In addition to the intra-processor merge operations performed individually, which enable ,
When employing the present invention, which is capable of performing extremely large-scale sort/merge tasks,
The time required to sort one file in the system can be expressed by the following equation, assuming that the number of records is n and the number of processors is m.

C, -log2- + C2n m m In this equation, C2 is a constant, estimated for this example to be approximately 10 microseconds if a 100-byte message is used, and C1 is typically This is a constant estimated to be approximately 1 millisecond if a typical 16-bit microprocessor is used. Approximate sort/merge times in seconds for various combinations of n and m are shown in the following table, assuming 100-byte records are used. be.

(Margin below).

It is not easy to evaluate the specific example numbers shown in the above table by comparing them with conventional systems. This is because the system involves network sorting (sorting by network), and also because there are almost no systems that have such a capability in the first place. Furthermore, in this system, messages whose lengths are long and variable are sorted and merged, whereas
- Many numerical sorting abilities are evaluated for several bytes or words.

Another important factor is that the present system is a multiprocessor itself, and is not a dedicated system for sort/merge processing.

The system allows for complete flexibility in shifting between merge and non-merge operations, both locally and globally, without any software penalty. Additionally, this can be done without any loss in system efficiency.

1. With respect to FIG. 1, each of the processors 14, 16, 18-23 connected to the network 50 is configured to cause one or more other processors to perform tasks. task requests in the appropriate format in the form of message packets. In relational database systems, most of these tasks are performed by the host computer 10.
．． 12 and enters into the system via an interface processor 14.16, although this is not a requirement, this message packet, formed in the appropriate format, is packets from this processor and, depending on the priority level of other tasks as well as the level of operational state on this processor, may sometimes get priority. .

A task may have its contents specified by a single message packet or by multiple continuation packets, but subsequent continuation packets may contain groups of data messages (!11
(see figure) is assigned a relatively high priority level, thereby ensuring that the delay in receiving subsequent parts is as short as possible.

A message packet includes transaction identity (=transaction identification information) in the form of a transaction number. This transaction number is divided into non-merge mode, that is, default mode (rTNOJ), which is a mode related to the method for extracting processing results, and merge -1-- mode (
It inherently has the property of distinguishing from all TNs other than rTNOJ according to selection. Additionally, the message packet includes a DSW. This DSW essentially specifies the transfer destination processor and the mode of multiprocessor operation, and this specification can be made by specifying a specific processor, a class consisting of multiple processors, or passing. In this example, the passing is to a portion of the relational database. A message packet broadcast to a target processor (designated destination processor) via network 50 is locally accepted at that processor (±
A determination is made by the processor itself that acceptance is appropriate) and acknowledgment of receipt is made by an acknowledgment (to the AC). Broset't 14.16 and 18-23 are all
Following the EOM (End of Message), responses are sent to the network 50 at the same time, however, the ACK sent from the designated destination processor
gets priority and will be received by the originating processor.

Next, the designated transfer destination processor transfers the sent message to the local H, S, RAM (=H, SRAM provided in each processor module) and the interface 120 (FIGS. 8 and 13). When the request packet (= sent message) is transferred to the local microprocessor via the )Execute. When tasks related to relational databases are performed,
Typically, a DSW specifies some portion of a disjoint data subset (this subset is stored on a disk drive for that subset), but sometimes There may be tasks to be performed that do not require referencing the existing database. Specific operations or algorithms may be executed by individual processors, and if multiple processors are designated as the designated destination processor, each of those processors may perform a disjoint subset of the total task. can be made to carry out work. The variable length message packet is configured such that the request message specifies the operation to be performed and the file to be referenced in the database system. It should be noted here that there may be a large number of message packets related to a given task, in which case the discrimination criteria for sorting done within the network In order to provide appropriate characteristics that will become , the key field (Figure 3) that can be adopted arbitrarily becomes important.

Task response packets generated by each processor attempting to respond are sent from the microprocessor to
Local H, S, RAM via control logic 28 of FIG.
26, where the task response packet is stored in the outgoing message format of FIG. 21A. If the task response requires the use of continuation packets, such continuation packets are sent following the initial packet, but given higher priority for continuation. Ru. If the system is operating in merge mode and each processor is generating a large number of packets related to one transaction number, the packets are first processed locally (=individual processors' It is possible to align the global sorts by chaining the sorts (internally) and then merging them on the network 5o.

The task result packet is sent to processors 14.16 and 18.
~ 23 to the network 50 in a group of simultaneous transmission packets, and one highest priority message
The packet is broadcast to all processors after a predetermined network delay. Depending on the nature of the task, the packet is forwarded to the source processor that originally issued the request message. 1.
The transfer may be performed with one or more other processors as the transfer destination, and furthermore, the transfer may be performed in any of the plurality of multiprocessor modes described above. The most common case in a relational database system is to use passing to select a transfer destination while merging and redistributing at the same time. Therefore, as can be understood from this, "task request/
During a "task response" cycle, each processor can act as a source processor, a coordinator processor, a responder processor, or all three. You can also do this. Many “tasks”
Since the "request/task response" cycle is involved, the processors 14, 16 and 18-23, and the network 50 are 2) multiplexed (multiplexed) between their tasks; This is done not only based on time but also based on priority order.

In relational database systems,
Utilizing the host computer 1O112, the relational database is also configured on a plurality of disk drives 38-43 according to an algorithm that defines tuples and disjoint data subsets of secondary and backup data. Using a distribution method that distributes complex queries from host computer 10 or 12 to IFP 14 or 16
input into the system via This input inquiry message packet is first analyzed in detail by the IFP 14 or 16, and this analysis is performed by the host
Messages from the computer are sent to multiple tasks for requesting AMPs 18 to 23 to execute tasks.
This is done to convert it into a request.

An IFP 14-16 begins its operation by sending a request packet to retrieve information from one or more particular AMPs, thereby
It may be necessary to obtain in-system data necessary for detailed analysis of messages from the host computer. Once the IFP 14-16 has obtained the data necessary to process the request from the host computer, the
Several times between P18 and P23, “Task Request/
It can perform "task-response" cycles and can actually process data to satisfy requests from the host computer. In the above processing sequence, the cycle of task requests and task responses listed above is used, and the cycles can be continued one after the other for any length of time. IFPs 14-16 then communicate with the host computer via the IFP interface. This response to the host computer may simply be to provide the data that host computer 10 or 12 needs to generate the next complex query.

(Independent Multiprocessor System) The basic embodiment of the system according to the invention described above in connection with FIG. 1 shows an example of a pack-end processor that can be used. However, as already mentioned, the present invention is useful in a wide variety of processing applications, and particularly in those types of processing applications where processing tasks can be easily subdivided and distributed without the need for large amounts of central processing power. , which has particular advantages. FIG. 20 illustrates an embodiment of a simple configuration of a stand-alone multiprocessor system according to the present invention. 20th
In the figure, a plurality of processors 300 are all connected via an interface 302 to an active logic network 304, which is a network similar to that previously described. An active logic network 304 with redundancy may be employed to enhance data integrity. In this embodiment, processor 300 may also be a 16-bit microprocessor chip;
A main RAM memory of sufficient capacity can be incorporated. This diagram shows nine processors 300
Only two processors are shown, and each of the processors has a different type of peripheral connected to it, to demonstrate the versatility of the system. In practice, the system becomes much more efficient by having more processors on the network; however, even with a relatively small number of processors, system reliability and data This provides particular advantages in terms of completeness.

In this embodiment, the plurality of processors 300 may be physically separated from each other by a sufficient distance without inconvenience that the nodes may The maximum interval between
A large array of multiple processors (as many as 5.5 ml) can be installed on one floor of a building, or on several adjacent floors, to avoid unnecessary crowding. This is because it can be used.

A stand-alone system uses a much greater variety of peripheral controllers, as well as the peripherals themselves, than in the post-processor embodiment described above. For convenience, the individual input/output devices are
Assume that each is connected to a separate processor.

For example, a high-output terminal device 310 equipped with a keyboard 312 and a display 314 is connected to a terminal controller 320.
The processor 300 for the terminal device 310 via
It is connected to the. However, in the case of terminal devices with relatively slow operating speeds, it is not impossible to control a fairly large network of terminal devices with a single 16-bit processor. ! I] It is preferable to show an example of how a manual operation input processing device such as an operation keyboard is connected to the system. The processing power of the processor 300 may be used to configure the terminal device 310 as a word processor, and the word processor can communicate with a database, other word processors, or various output devices via the network 304. You can also do it. For example, rigid disk drive 322
The disk controller 32 stores large-capacity secondary storage devices such as
4 can be connected to the processor for its storage. It will also be readily appreciated that larger systems may include a larger number of disk drives or different forms of mass storage. Printer 326 and plotter 330
The output devices such as
and plotter controller 332 to processor 300 for those output devices. Interaction with other systems (not shown) is via communication controller 338 and communication system 336
The communication system 336 may be, for example, a teletype network (TTY) or one of the larger networks (e.g., Ethernet (
Ethernet) etc. are used. processor 3
00 may simply be connected to network 304 without any peripherals attached (not shown).

Bidirectional data transfer may occur between tape drive 340 and tape drive 340.
If drive controller 342 is used,
Additionally, a floppy disk drive 344 to which a controller 346 is connected is used.

In addition to providing large storage capacity for online use, tape drives can also be used to back up disk drives. For this backup purpose, tape is used to save data stored up to a certain point in a sealed rigid disk device. Such backup operations are typically performed during periods of low load (eg, nights or weekends) so that network 304 can be used to perform long "streaming" transfers. Furthermore, for program input during initial system setup,
Since a floppy disk drive 344 may be used, some of the network usage time may be devoted to this "streaming" mode to transfer significant amounts of data. Optical character reader 35
0 serves as yet another source of input data, which is input into the system via its controller 352.

Note that the peripheral devices simply labeled as "other devices 354J" can be connected to the system via the controller 356 to provide other functions as needed.

Respective messages from separate processor modules
packets simultaneously with each other and a priority determination is made on the message packets so that one or a common highest priority message packet is sent simultaneously to all processor modules within a predetermined period of time. A broadcast scheme is used so that any individual processor that is online has equal access to other processor modules in the system. This global semaphore system, which utilizes prioritized transaction numbers and readiness status indicators and destination selection entries contained within messages, allows any processor to act as a controller. This allows the system to operate in a hierarchical or non-hierarchical manner. It is also very important that the system can be expanded or contracted without requiring any software review or modification.

If access is required to a message that is considerably longer than the message lengths already described, but is still relatively limited in length, here are six examples where such access can be performed: With respect to computer graphics equipment (not shown), it may be necessary to access only specific portions of a vast database in order to create elaborate two-dimensional and three-dimensional figures. Also, with word processing systems, the operator speed may be such that only a small sequence of data is required from the database at a time. In these and similar situations, the system's ability to handle messages of variable length, as well as its ability to give priority to continuation messages, is beneficial. Situations requiring intensive processing power or the transmission of extremely long messages limit the use of this system, but in other situations the system can be used to great advantage. do.

Dynamic situations involving manipulation of a variety of different data formats and associated sorting or merging functions are all situations in which the present invention would be advantageous. Business decision-making, which involves collecting, collating, and analyzing complex data, is an example of such a situation, as is the creation and editing of video and graphical input for periodicals. -This is an example.

(Conclusion) As will be apparent to those skilled in the art, the system of FIG. (up to a practical limit). Furthermore, as is also clear, the system shown in the figure has several functions for checking the status of each processing unit, setting priorities for tasks and processors, and ensuring efficient utilization of the processing power of the processors. Management and overhead software requirements are greatly reduced.

Obvious benefits are obtained for database systems and other systems where it is appropriate to subdivide a task into multiple subtasks that can be processed independently of each other. etc. For example, with respect to relational databases, even if the capacity of secondary storage increases significantly, additional databases can simply be appropriately integrated into a data structure consisting of primary and backup data. be. In other words, it is possible to expand the network without limit;
Because the standardized nodal points or nodes are connected in a binary evolving manner, the powers exercised by the individual nodes do not change with expansion. Furthermore, there is no need for a setting processing sequence or external control for the operation of the nodes. Therefore, the system according to the invention, as shown in FIG.
When connected to act as a back-end processor for one or more host computers, users of the system can freely modify the database without changing the operating system software or application software. It can be expanded (or reduced) to From the perspective of the host processor system (= host computer), this back-end processor is ``transparent'' regardless of its configuration.
This is because the configuration changes do not change the manner in which the back-end processor interacts with the host processor system. To switch this back-end processor to do the work of another host processor system, simply ensure that the IFP speaks appropriately to the new host processor system's channels or buses. Just that is fine.

The configuration of the network in one practical example shows that a single array can be configured without significant delays in message transfer within the network, or without unreasonable delays due to contention between processors. 10
It is possible to include and use up to 24 microprocessors. It will be apparent to those skilled in the art how the embodiments described herein may be extended to include more than 1024 processors. When using 1024 processors in a system, the maximum line length between active notes has been found to be 28 feet in a practical example; There will be no problems. The delay time due to the network is a constant time 2τN for any message, where the byte clock interval and N is the number of layers in the hierarchical structure. Clearly, doubling the number of processors by adding one more layer only slightly increases the delay time. Since a data message is almost inevitably a long message (about ζJ200 bytes long), priority determination for all competing messages requires the data to be transferred along the network. This makes the network much more efficient at transferring data messages than traditional systems.

Among the important economic and operational features of the system is the fact that standardized active logic circuits are used in place of software and even firmware in network systems. There are certain characteristics that have been achieved. That is, based on this fact, it is possible to use modern LSI and VLSI technology to incorporate a highly reliable circuit at a relatively low cost compared to the overall cost including the cost of the processor and the cost of peripheral devices. It is designed to straddle the road.

The amount of time and money that must be spent on software is limited to only the critical parts, such as those related to problem area tasks such as database management. For example, the configuration of this system allows all of the functions necessary to maintain the integrity of the database to be performed within the scope of the message packet configuration and network configuration. ing. polling,
Functions such as status changes and data recovery are performed within the system.

Yet another important consideration is that the network of the present invention is sufficiently superior in its high speed data transfer performance to conventional ohmic wired buses. Since multiple message packets are sent simultaneously and their priority is determined while they are being transmitted, in the conventional method, it is difficult to send a status request and its response, as well as to determine its priority. This is because the delays that would otherwise have occurred have been avoided.

Furthermore, even if the number of processors is enormous, it is possible to keep the length of the connection structure between nodes to a predetermined length or less, so the propagation time within the bus becomes a constraint on the data transfer rate. Never.

The present system has been found to be near optimal in terms of microprocessor and network usage efficiency. The important thing about these points is that
The two main objectives are to keep all microprocessors busy and to ensure that the network is fully utilized. IJ FP-Network-A
The construction of MPJ makes this possible in effect, because a microprocessor whose message packets it has sent lose in the competition for priority will have to try again at the earliest possible time. It only needs to attempt to transmit, thus keeping the bus duty cycle at a high level. High speed random
Access memory also contributes to this effect, since high-speed random access memory stores both input message packets to be processed and output message packets to be sent out. This is because each processor does not have to manually maintain a backlog of work at all times, and the network can also manually maintain a backlog of message packets. Once all the power buffers are full, the processor sends an indication over the network to indicate this fact.

Also, when the input buffer used by the IFP to receive messages from the host computer becomes full, an indication is sent out on the channel to notify this fact. The system is therefore self-paced both internally and externally.

By utilizing the architecture and message structure described above, the system is configured to perform many other functions required of a general-purpose multiprocessor system. For example, in the prior art, great attention has been paid to methods for evaluating and monitoring changes in the status of global resources.

In contrast, according to the present invention, only a parity channel is provided and used as a means for communicating both the occurrence of a parity error and the fact that processor availability has changed.

When one or more processors shuts down, the shutdown is propagated through the system at approximately the same time as it occurs, so that execution of the interrupt sequence can begin. There is.

Because the system uses a method that sorts multiple responses according to priority, it is much easier to understand the nature of changes in global capacity than before. The small circuit size and system overhead make it possible to specify.

The global response obtained through a single query and priority determination, which is achieved by employing global semaphores and active logic networks, has very deep systemic implications. By broadcasting queries in this manner, unambiguous, unambiguous global results are obtained, eliminating the need for complex software and overhead. Status setting operations such as distributed updates can be performed even when multiple simultaneous operations are being performed on multiple different processors.

Furthermore, by using the network, transaction number, and transfer destination selection word as described above, this system exhibits excellent ability to distribute work and collect processing results in a multiprocessor system. f! Various multiprocessor modes and control messages are available, and various levels of priority can be easily set and changed simply by manipulating the priority protocol. .

The ability to broadcast to all processors simultaneously, combined with the ability to sort messages across the network, allows any group of processors or any individual processor to be targeted. At the same time, it is also possible to extract the processing results in an appropriate order. Thus, once a complex query is entered into a relational database system, it initiates any processing sequence necessary for database operation.

A further advantage of this system is that it can be used in multiprocessor systems such as relational database systems.
The purpose is to be able to easily introduce redundancy. Having dual networks and dual interfaces provides redundancy that allows the system to continue operating even if one network fails for any reason. Since the database is distributed into disjoint temporary subsets and backup subsets,
- the probability of data loss is reduced to a minimum level.

A variety of versatile control functions are available to maintain the integrity of the database in the event of failures or changes.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a system according to the invention, including a novel bidirectional network. 2 and 2A to 2J are a series of sequential sequences over time illustrating the manner in which data and control signals are transmitted in the network of the simple embodiment shown in FIG. FIG. 2 is a diagram showing the state before the start of signal transmission, and FIGS. 2A to 2J are diagrams showing continuous IO from 1=0 to t=9, respectively.
FIG. 12 is a diagram corresponding to one of the time samples at point [)li. FIG. 3 is an explanatory diagram illustrating the structure of a message packet employed in the system shown in FIG. 1. FIG. 4 is a block diagram showing further details of the structure of the novel bidirectional network shown in FIG. 1, including the active logic nodes and clock circuits used. FIG. 5 is a state diagram illustrating various operating states within the active logic node. FIG. 6 is a timing diagram for explaining the end-of-message detection operation performed inside the active logic node. FIG. 7 is a diagram of timing waveforms for explaining the operation of the clock circuit shown in FIG. 4. FIG. 8 is a block diagram of a processor module including high speed random access memory that may be used in the system shown in FIG. FIG. 9 is a diagram showing the internal address allocation status of the main RAM of the microprocessor system shown in FIG. 8. FIG. 10 is a block diagram of the arrangement of data within one reference portion of the high speed random access memory shown in FIG. 8. FIG. 11 is a chart showing the message priority protocol used in the system. FIG. 12 is an explanatory diagram illustrating the word format of a transaction number. 13 and 13A are block diagrams of interface circuits used in each processor module included in the system shown in FIGS. 1 and 8, and are shown on the right side of FIG. 13. This is a diagram that can be combined into one sheet by placing FIG. 13A on . FIG. 14 is a timing diagram illustrating the various lock and phase waveforms used in the interface circuit of FIG. 13. The Its diagram is a block diagram illustrating further details of memory organization and one method of mapping for mapping based on destination selection words. FIG. 16 is a simplified flowchart showing the changes in status upon receiving an input data message. FIG. 17 and FIG. 17A are flowcharts showing changes in status when a message is being received. FIG. 17 is arranged in contact with the upper edge of FIG. 17A to form a single page. It is. FIG. 18 illustrates the relationship between various primary messages and the various responses generated to them, as well as the relationships between various primary messages and the actions performed in response to them. This is a table showing FIG. 19 and FIG. 19A are flowcharts showing changes in status when a message is being sent, and by arranging FIG. 19 in contact with the upper edge of FIG. 19A, the diagrams can be combined into one page. It is. FIG. 20 is a block diagram of a stand-alone system according to the present invention. FIG. 21, consisting of FIGS. 21A and 21B, is a diagram showing messages stored in the high speed random access memory. FIG. 22 is a simplified schematic diagram illustrating one possible distribution scheme for distributing respective portions of a database among a plurality of different processors within a database system. 18-23--access module processor, 24--one microprocessor, 2a--[4 random access memory, 28--one control logic, 32--disk controller, 38-43--disk drive, 50--one active logic network structure; 54--one node; 56--clock source; 120--one network interface; 103--one microprocessor system.

Claims (31)

[Claims] (1) A plurality of processor modules each comprising a processor and a semaphore providing means for providing an externally accessible semaphore representing a readiness state of the processor with respect to a plurality of different tasks. comprising network means connected to said plurality of processor modules, said network means performing a "test and set" operation on the readiness state of said plurality of said processors for a given task on all said processor modules; A multiprocessor system comprising: means for simultaneously performing operations in a processor; and means for selecting a lowest readiness state from among a plurality of readiness states obtained by the operations as an indication of global readiness. 2. The system of claim 1, wherein the semaphore providing means includes means for providing one of a series of values for each different discrete task. (3) the means for providing one value from a series of a plurality of values provides values whose data contents are variously different; and the means for selecting the lowest readiness state is 3. A system as claimed in claim 2, comprising means provided in the network means for merging a plurality of provided values according to their data content. (4) said network means is bidirectional, said network means comprising means for simultaneously broadcasting messages to all said processor modules and means for merging messages from said processor modules within a predetermined period of time; 4. The system of claim 3, comprising a network. (5) said plurality of processor modules including means for simultaneously sending messages to said network means, said messages including a primary data message, a semaphore inquiry, a semaphore response, a control message, and a primary data message; 5. The system of claim 4, wherein responses to the messages are included, and all of the messages differ in their data content according to a predetermined priority protocol. (6) All messages have a command field at the beginning whose data content varies according to the sorting priority according to the message type, and includes a primary data message, a semaphore inquiry, and a semaphore response. Status messages, control messages, and response messages include a tag following a command field that varies in data content and is constant in length;
6. The system of claim 5, wherein the system can include originating processor identification information for the response. (7) The combination of a command field and a tag makes the message a status inquiry, a transaction identity assignment control message, a transaction identity relinquish control message, a merge initiation control message that causes a processor module to initiate a merge operation, or a processor module. - The system of claim 6 characterized as a merge stop control message that causes the module to stop the merge operation. (8) each of said processor modules includes message/semaphore buffer means for messages and semaphores, said message/semaphore buffer means being capable of receiving messages from both said network means and said processor module; 2. The system of claim 1, including means for accessing. (9) The message/semaphore buffer means includes storage means for storing a plurality of semaphore status indications corresponding to each of a plurality of specified transactions, and
said processor module includes update means connected to said buffer means for locally updating said semaphore status indication in relation to a specified transaction; 9. The system of claim 8, further comprising semaphore reading means for reading the semaphore status indication in response to a status inquiry of the processor without reference to the current operating state of the processor. (10) the message comprises a serial sequence of bytes of data including parity bits, and the plurality of processor modules includes means for forcing a parity error upon a change in status; said network means includes propagation means for propagating this forced parity error through said network from its point of origin, thereby signaling that a change has occurred in the state of a global resource of said system; The system according to claim 7. (11) An intercommunicating microprocessor system capable of checking the global readiness state of the system for any one of a plurality of transactions within a predetermined period of time, the system comprising a plurality of processors, each of the processors includes a semaphore holding and updating means for maintaining and updating a plurality of test-and-settable local semaphores for different discrete transactions; network means for simultaneously sending a transaction query to all of the plurality of processors, the network means inquiring the state of a local semaphore for a given transaction; sort multiple responses within a given time,
network means, connecting each of said plurality of processors to said network means, for simultaneously sending a plurality of semaphore responses to said network means;
A system comprising setting means. (12) the local semaphore has various data contents determined according to a local readiness state;
12. The system of claim 11, wherein said network means includes means for sorting according to data content of said local semaphore. (13) the semaphore holding/updating means includes a random access storage means and an interface means connecting the storage means to a processor associated with the storage means and the network means; and,
12. The local semaphore is a digital entry selected from a series of values having different data content and stored in a storage location addressed by the transactional query.
The system described. (14) the global test and set means includes a storage device that maintains the local semaphore at an address specified by a transaction number;
12. The storage device of claim 11, wherein the storage device is accessible both by a processor associated with the storage device and by the network means, and further wherein the local semaphore is indicative of a local readiness state. system. (15) The processor includes means for sending the transaction query to the network means, the transaction query including a transaction number and sorting for transmission of a plurality of semaphore responses. 15. The system of claim 14, wherein the local readiness state is identified as having the lowest readiness state. 16. Each local semaphore comprises one of a set of values having different data contents, one for each transaction number address. system. (17) A system for determining the global state of a plurality of resources in a multiprocessor system in which the resources are associated with local semaphore means within each processor that owns the resources, comprising: interrogating said local semaphore means in each processor with a message containing a number identifying a given transaction;
interrogating means for obtaining a plurality of status responses sent simultaneously with each other having selected data content; and sorting the plurality of responses according to data content of said plurality of responses sent simultaneously; sorting means for obtaining a highest priority response indicating a global state for the transaction number according to the method. (18) the sorting means includes a network;
17. The network is interconnected throughout the multiprocessor system to sort the plurality of responses according to their data content.
The system described. (19) Each of the processors has a local semaphore storage means having a plurality of storage addresses for storing transaction numbers, and inputs status data regarding a plurality of different transaction numbers to the plurality of storage addresses. and input means for inputting information, and the network is interconnected to the local semaphore storage means of each of the processors, and the network is interconnected to the local semaphore storage means of each of the processors, and the network is configured to address the storage means using a transaction number included in the query. 19. The system of claim 18, wherein the network is configured to provide an indication of global state from the sorted responses. (20) A method for obtaining a global evaluation of the work status of a plurality of processors for a given task in a multiprocessor system, the method comprising: receiving a plurality of predetermined messages with various data contents in each processor; displaying the current local readiness state for the given task by locally selecting one message of all processors involved in the given task; , simultaneously extracting messages from , by an external operation, and determining the highest priority message by arbitrating between the messages based on the data content of the messages.
A method comprising an adjudication step. (21) The message is a message whose data content takes various values depending on a predetermined series of readiness states, and the minimum data content represents the lowest readiness state, and the determining step: 21. The method of claim 20, wherein priority is given to messages with minimal data content. (22) The identification of the given task is
local storage of the selected predetermined message according to the transaction number; and retrieval of the message by reading the messages stored for each transaction number. 22. The method of claim 21, further comprising: (23) A method of intercommunication between a plurality of processors in a multiprocessor system, the method comprising: maintaining in each processor a plurality of locally updated local semaphores regarding readiness status; simultaneously testing the local semaphore globally to obtain a plurality of mutually competing responses; and selecting a state representing the lowest readiness state from among the plurality of mutually competing responses as the global state. Steps and method including. (24) The selection of the state representing the lowest readiness state determines priority for the plurality of competing responses within a predetermined period of time while intercommunicating the plurality of competing responses among the processors. 24. The method of claim 23, wherein the method is carried out by performing. (25) The plurality of responses competing with each other have different data contents depending on the readiness state,
25. The method of claim 24, wherein priority determination of the plurality of responses is performed by a series of plural pairwise comparisons, each of which is a series of comparisons between two paired data contents. (26) maintaining for each of the processors a plurality of local semaphores that are locally updated regarding a plurality of transactions that are specified separately from each other; 26. The method of claim 25, further comprising the step of: performing the test via global status communication. (27) The readiness state includes a non-participating processor state whereby different subsets of processors can participate in a given transaction and responses from other processors are of lower priority. 27. The method of claim 26, wherein: (28) Performing a time-sharing operation of time-sharing the multiprocessor system among a plurality of tasks by identifying the plurality of tasks to be time-divided using a plurality of mutually different transaction numbers. and determining a global readiness state of said multiprocessor system for a given transaction number; and determining a global readiness state for a previous transaction number if the global readiness state has not reached a completed state and 28. The method of claim 27, including the step of transitioning to an appropriate transaction number. (29) maintaining a locally updated semaphore state for each of a plurality of transactions for each processor; and broadcasting a status query regarding a given transaction to all processors simultaneously to 29. The method of claim 28, further comprising obtaining simultaneously sent responses. (30) performing mutual communication among the processors of the plurality of simultaneous transmission responses, and performing pairwise comparison based on binary numbers multiple times for the plurality of simultaneous transmission responses; 30. The method of claim 29, wherein the determination of priority is performed within a fixed time period consisting of: (31) displaying the readiness status for a given number of transactions by providing a directory of transaction readiness status for each processor and inputting the transaction readiness status into an accessible file; 31. The method of claim 30, further comprising the steps of simultaneously globally interrogating the following steps: and simultaneously global readiness states without changing their local readiness states.