JPS6140674A - Route retrieval processing system - Google Patents

Abstract

PURPOSE:To obtain a system which shortens a route retrieval processing time greatly by providing route retrieval control which controls the execution of route retrieval from a lattice of X-directional and Y-directional linear arrays simultaneously in parallel. CONSTITUTION:Processors 7-1-7-8 for X-directional route retrieval read information used for retrieval on a lattice point adjacent to a lattice point as a starting point in the X direction from a lattice map storage part 21 through an X-directional lattice map input/output control part 18. The used information is checked and when the adjacent lattice point is already used, retrieval in the direction is finished and retrieval in the -X direction from the starting point is started newly. When the retrieval is not performed, lattice point attribute information showing the origin of the retrieval is the starting point and retrieval direction information showing that the retrieval is performed from left are written at corresponding lattice point positions of a storage part 21 through a control part 18. Then the retrieval is continued to an adjacent lattice point in the X direction. When the lattice point of the retrieval reaches a peripheral position of a wiring board, the following retrieval in the direction is finished. The retrieval in the Y direction is the same.

Description

DETAILED DESCRIPTION OF THE INVENTION (Technical Field) The present invention relates to a route search processing system for designing wiring in printed boards, LSIs, etc. - (Prior Art) Conventional searching for wiring routes is realized by running a route searching program on a general-purpose computer having a large capacity memory.

A general-purpose computer sequentially checks the presence or absence of a route in four directions in one route search, which requires a large amount of computer time. The disadvantage is that it takes a considerable amount of computer time to generate a large number of lines.

(Object of the Invention) An object of the present invention is to provide a route search processing system that can perform route searches from a one-dimensional array grid in the X direction and Y direction simultaneously in parallel, thereby significantly shortening the route search processing time. It's about doing.

(Structure of the Invention) The device of the present invention includes a section data storage unit that stores section data consisting of pairs of grid points to be connected in a wiring board in which grids are provided in orthogonal directions of X and Y, and a lattice map storage unit that stores lattice search usage information; and a lattice map storage unit that is provided for each of the lattices arranged in a one-dimensional array in the Y direction, and searches for a route in the X direction based on the section data or intermediate route data. an X-direction route search processor; a Y-direction route search processor that is provided in each of the grids arranged in a one-dimensional array in the X direction and searches for a route in the Y direction based on the section data or intermediate route data; a route search control unit that controls the execution of route searches of each processor at least simultaneously and in parallel;
an intermediate route data storage unit that stores intermediate route data searched in the direction and the Y direction; and a route searched from the grid searched by both the X direction route search processor and the Y direction route search processor. a route tracing unit that determines route data by reverse tracing; a route data storage unit that stores the determined route data; and a route data output unit that outputs route data to the route data storage unit and the grid map storage unit. The present invention will now be described in detail with reference to the drawings.

FIG. 1 is a grid map diagram for explaining a wiring grid. As an example, the grid is shown as having 10 rows and 8 columns. The origin is the lower left of the diagram, with the following properties being in the Y direction and columns being in the X direction. Use coordinates to indicate each grid, and the bottom left grid is (1,1)
shall be. On the grid map 1 in FIG.
), there are Y-direction lines 5 and wiring prohibited areas 6. The X-direction line 4 consists of grid points (1
,7), (2,7) to (10,7), and the Y direction line 5 is a one-dimensional array of lattice points (9,:t), (g,
2)～(Government.

4).

FIG. 2 is a diagram explaining the basic operation of the present invention. X
A one-dimensional array of grid points (1, 7) on the direction line 4,
Y-direction path search processors 8-1. ), (Miya,
2) - (Miya, 4) X-direction route search processor 7-1
．． Assign 7-2 to 7-4.゛Processor 8-
1. 8-2 to 8-10 simultaneously search for routes in the ~-5-Y direction in parallel, and the results are expressed as the found route 9 in the Y direction and stored in the grid map 1. Similarly, the processors 7-1, 7-2 to 7-4 simultaneously search for paths in the X direction, and the results are expressed as paths 10 in the X direction and stored in the grid map 1.

At this time, processors 8-1.8-2 to 8-10 and processors 7-1.7-2 to 7-4 operate simultaneously in parallel,
Explore routes.

Lattice point 11 (61
When reaching 4), the route search ends.

In the route search, the first step is to allocate processors to line 4, which includes the starting point 2, and line 5, which includes the ending point 3. However, if the route becomes more complex, the processors are allocated to line 4, which includes the starting point 2, and line 5, which includes the ending point 3. Route searches are performed in multiple stages by saving intermediate stages of the search from the end point side.

Referring to FIG. 3, the operation of the multi-stage search described above will be explained.゛Y direction line 12 searched from 2 in 4 including starting point 2, and X searching from line 5 including end point 3
By saving the direction line 13 and assigning processors for searching in the X and Y directions to lines 12 and 13 in the next stage 6, multi-route search is performed to find a grid in which the routes in the X direction and the route in the Y direction are the same. Point 14 (6,5)
It continues until it reaches. In this way, a route search can be performed in multiple stages by sequentially repeating a series of operations in which a line at an intermediate stage is saved, a processor is assigned to this line in the next stage, and a route is searched.

FIG. 4 is a block diagram showing one embodiment of the present invention.

The route search processing system shown in FIG. 4 includes a section data storage section 15 that stores grid point data (coordinate data) at the beginning and end of sections to be connected, and a route search control section 16 that controls each section of this embodiment. and a grid map storage unit 2 that stores search usage information for each wiring grid corresponding to the wiring grid of the wiring board.
1, and an A Y-direction route search processor 19 includes Y-direction route search processors 8-1 to 8-10 provided in each row (Y direction) of the map storage unit 21 to search for a route in the Y-direction, and a lattice map storage unit 21. an X-direction grid map input/output control unit 1B that controls data input/output to and from the X-direction route search processing unit 17; A directional grid map input/output control unit 20, an intermediate route storage unit 22 that stores intermediate routes that have been searched and have not yet connected the starting point and the ending point, and when a route that connects the starting point and the ending point is discovered, the route is stored. a route tracing section 23 that controls tracing in the reverse direction from the starting point to the end point; a route data output section 24 that outputs coordinate data of each grid point traced by the route tracing section 23; and a route data output section. and a route data storage section 25 that stores route data from 24.

The search usage information stored in the lattice map storage unit 21 includes usage information (for example, 1 bit) indicating whether or not the corresponding lattice point has already been used as a wiring route, and usage information (for example, 1 bit) indicating the direction in which the lattice point was searched. search direction information (for example, 2 bits) indicating whether the search was performed from the upper grid point, the lower grid point, the right grid point, or the left grid point;
Grid point attribute information indicating whether the grid point that served as the origin of the search was the starting point or the ending point, whether the grid point was the starting point or the ending point, or whether the grid point was not searched in red.

including.

As for the route search operation of each route search processor, first, the processor is given grid point data that becomes the starting point of the search (
When starting the search from the end point, the end point is given)
, the search is sequentially started in the specified direction (for the X-direction route search processor, the X direction) with this grid point as the starting point. The X-direction route search processor will be explained below.

That is, the X-direction route search processor transfers the search usage information of grid points adjacent to the starting grid point in the X direction from the grid map storage unit 21 to the X-direction grid map input/output control unit 1.
8, the use information is checked first, and if the adjacent grid point is already used, the search in that direction is ended and a new search is started in the -X direction from the starting point. When the usage information indicates unused, the grid point attribute information is checked, and unless the information indicates unused, the search in that direction is terminated. If the search has not been performed yet, the grid point attribute information is set to indicate that the origin of the search is the starting point (or the ending point when the search is performed from the end point), and the search direction information is set to indicate that the search was performed from the left (first to third points).
In the figure, the data is written to the corresponding grid point position in the grid map storage unit 21 via the X-direction grid map input/output control unit 18, as shown by →. Then, the search is further continued to adjacent grid points in the X direction. Of course, when the grid point reaches the peripheral position of the wiring board, the subsequent search in that direction ends. As mentioned above, once the search in the X direction is completed, the search in the -X direction is started.

The operation of this embodiment will be explained.

The route search control unit 16 inputs the section data of section 1 from the section data storage section 15, and selects
The X-direction line 4, First, find the Y direction line 5. This means that the X direction route search processor 7-7 moves from the starting point (2, 7) to the Y direction.
The direction route search processor 8-3 searches from the end point (8, 2). The result is stored in the intermediate route storage section 22.

Next, the line search control unit 16 selects the X direction line 4 based on the search results stored in the intermediate route storage unit 22. Y
The Y-direction route search processing unit 19.starts the search from the direction line 5, respectively. An instruction is given to the X-direction route search processing section 17. Processors 8-1 to 8-10 process grid points (1, 7), (2, 7) to 1-dimensional array included in line 4.
(10,7) as the starting point, processor 7-1.7-2
~7-4 are grid points (8,1), (8,2)~ of line 5
The search begins with (8, 4) as the end point.

The processors 8-1, 8-2 to 8-10 input grid search usage information from the grid map storage unit 21 via the Y-direction grid map input/output control unit 20 and search for a route. Similarly, the processors 7-1, 7-2 to 7-4 input grid search usage information from the grid map storage unit 21 via the X-direction grid map input/output control unit 18 and search for a route. At this time, processors 7-1゜7-2 to 7-4 and 8-1.8
-2 to 8-10 all operate simultaneously and in parallel.

The direction of the found route is stored at the corresponding lattice point in the lattice map storage section 21 as search direction information.

Grid point 11 (6, 4) where searches in the X and Y directions are the same
The route search continues until reaching . It can be determined that the same grid point has been reached by checking the grid point attribute information. If the same lattice point cannot be reached in one step of the search, the line at the intermediate step is stored again in the intermediate route storage section 22, and the route search is performed by the above-described multi-step process.

When the route reaches the same grid point 11, the line search control unit 16 instructs the line tracing unit 23 to backtrace. The route tracing unit 23 backtraces from the starting point 2 to the ending point 3 based on the grid point coordinates and search direction information stored in the lattice map storage unit 21, determines one final route, and outputs the route data. Route data is output to 24. The route data output unit 24 stores the determined route data in the route data storage unit 25, and at the same time sets the used status for the grid of the route in the grid map storage unit 21, and stores the determined route data in the route data storage unit 25. Clear direction information.

The above operation is repeatedly executed for all section data.

As described above, in this embodiment, the wiring route of the wiring board can be quickly determined.

Note that multilayer printed boards, LSIs, etc. having two or more wiring layers can be easily handled by providing through holes at lattice points where the search direction changes in each wiring layer.

(Effects of the Invention) The present invention has the effect that the computer time for island route searching can be significantly reduced by simultaneously performing route searching from a one-dimensional array grid in the X and Y directions.

[Brief explanation of the drawing]

Figure 1 is a grid map diagram for explaining the wiring grid, Figure 2 is a grid map diagram for explaining the wiring grid.
3 is a diagram for explaining the basic operation of the present invention, FIG. 3 is a diagram for explaining multi-step route searching, and FIG. 4 is a block diagram showing an embodiment of the present invention. 1... Lattice map, 2... Starting point of the wiring section, 3'... End point of the wiring section, 4...
...X direction line, 5...Y direction 247%6.
...Prohibited area for wiring, 7-1゜7-2~7-8・
...X-direction route search processor, 8-1.8-
2 to 8-10... Y-direction route search processor, 9... Arrow indicating the Y-direction route, 10...
...Arrow indicating the route in the X direction, 11...Grid at the end of the search, 12...Line in the Y direction, 13...
...X-direction line, 14...Search end grid, 15...Section data storage section, 16...
...Route search control unit, 17. Old...X-direction route search processing unit, 18...X-direction grid map input/output control unit,
19... Y direction route search processing unit, 20...
・Y-direction grid map input/output control unit, 21... Lattice map storage unit, 22... Intermediate route storage unit, 2
3...Route tracing unit, 24...Route data output unit, 25...Route data storage unit. Ward. Elm

Claims (1)

[Scope of Claims] A section data storage section that stores section data consisting of pairs of grid points to be connected on a wiring board having a grid provided in the X and Y orthogonal directions, and search usage information for the grid on the entire wiring board. an X-direction route search processor that is provided in each of the grids arranged in a one-dimensional array in the Y direction and searches for a route in the X direction based on the section data or intermediate route data; , a Y-direction route search processor that is provided in each of the grids arranged in a one-dimensional array in the X direction and searches for a route in the Y direction based on the section data or intermediate route data; a route search control unit that controls execution at least simultaneously in parallel; an intermediate route data storage unit that stores intermediate route data searched in the X direction and the Y direction; the X direction route search processor and the Y direction route search. a route tracing unit that determines route data by back tracing the route searched from the grid searched by both the processor; a route data storage unit that stores the determined route data; the route data storage unit; A route search processing system comprising: a route data output unit that outputs route data to the grid map storage unit.