JPH0148585B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical field to which the invention pertains] The present invention relates to a route search processing system for designing wiring in printed boards, LSIs, etc.

[Prior art]

Conventional wiring route searching is accomplished by running a route searching program on a general-purpose computer having a large memory capacity. A general-purpose computer requires a large amount of computer time because it sequentially checks the presence or absence of a route in four directions in one route search.

Even if a relatively fast line search method is used, a considerable amount of computer time is required to sequentially and alternately generate a large number of lines in the X and Y directions.

Furthermore, in order to find the shortest route, it is necessary to exhaustively search the grid on the substrate, and therefore the flexibility of software is used to find an approximate shortest route.

[Purpose of the invention]

An object of the present invention is to solve the problem that a general-purpose computer requires a large amount of computer time, and to provide a route search processing system that can perform route searches between adjacent grids of adjacent slits simultaneously and in parallel.

[Structure of the invention]

The system of the present invention has a section data storage section that stores section data consisting of pairs of grid points to be connected, a grid map storage section that stores the usage status of the grids of the entire board, and a processor that connects routes. A route search processing unit arranged in a dimensional array; a route search control unit that controls execution of the processor; a route tracing unit that backtraces the searched route; and a route data storage unit that stores determined route information. a lattice map storage unit, and a route data output unit that outputs route information to the route data storage unit; the lattice map is sliced into a plurality of slits at regular intervals parallel to the X or Y axis; The present invention is characterized in that one processor is assigned to each lattice arranged in a one-dimensional array included in one slit, and the slit is sequentially shifted parallel to the X or Y axis.

Each processor has built-in software that checks the presence or absence of a route within one slit and between adjacent grids of adjacent slits, and routes are searched by executing this software.

Even for multilayer printed boards, LSIs, etc. with two or more wiring layers, the search direction for each wiring layer is regularized.
Expansion is possible by providing through holes at grid points where the search direction changes.

[Principle and operation of the invention]

The feature of the present invention is that a lattice map is sliced into a plurality of slits, one processor is assigned to each lattice arranged in a one-dimensional array included in one slit, and the slits are sequentially shifted. Path searches between adjacent grids of adjacent slits are performed simultaneously in parallel.

[Embodiments of the invention]

Next, the present invention will be explained in detail with reference to the drawings. Referring to FIG. 1, the lattice map 1 is
It is sliced into a plurality of vertically long slits 3 parallel to the Y-axis in units of coordinate grid width 2. One slit consists of a plurality of gratings 4 arranged in a one-dimensional array in the Y direction.

The basic operation of the present invention will be explained with reference to FIG. The grid map 5 is in a state before the route search, and shows the grid 8 that has already been used, and the starting point 6 and ending point 7 of the section data to be connected this time. First, a processor 9a,
9b, 9c, . That is, as shown in FIG. 2, the processor assigned to the starting point 6 (processor 9 _o-1 ) writes a starting point mark (S) at the position corresponding to the starting point 6 on the grid map 11. Next, processor 9 _o-1
checks whether the grid assigned to itself on the grid map 5 is empty (that is, whether it is an unsearched grid), and if it is empty, there is a path from the starting point 6 to the grid, so the grid map A route direction mark indicating the direction is written in the grid in 11.
If the slit 10a is not empty, further searching within the slit 10a is stopped. Thereafter, similar route search processing is performed for the processors 9o _-3 , _9o-4 , and so on. The search result is expressed by the direction 12 of the route found and is stored in the slit 10a' of the grid map 11 that stores the route search result. Next, processors 9a, 9b, 9c, ... 9n are assigned to each grid of adjacent slits 10b, and the path in the X direction from the grid to the slit 10b with the saved path within the slit 10b is Adjacent grids are searched simultaneously in parallel. For those gratings for which no route from the slit 10a has been found, a route in the Y direction within the slit 10b is searched. The search results are stored in slit 10b'. Like this
The route search is performed by sequentially shifting the slit in the direction until reaching the end point 7. When the end point 7 is reached, an end point mark (T) is written at the position corresponding to the end point 7 on the grid map 11.

In FIG. 3, the configuration of this system will be explained. The route search control unit 14 includes the section data storage unit 13
1 section data is inputted, and the route search processing section 15 is instructed to start the search from the slit 10a including the starting point 6 in FIG. processor 9a,
9b, 9c, . . . 9n are assigned to each grid in the slit 10a in FIG. . The direction of the found route is stored in the grid map storage section 17.
Next, each processor is assigned to each grid in the slit 10b of FIG. 2, and searches for a route as described above. Thereafter, the route to the end point 7 is searched by sequentially shifting the slits in the same manner. When the route reaches the end point 7, the route tracing unit 18 shown in FIG. determine the route. That is, as is well known in the art, a grid that stores a route direction mark toward the end point 7 among the grids adjacent to the end point 7 on the grid map 11 is searched for. Next, for the found grid, one of the adjacent grids that stores the route direction mark toward the grid is similarly found. By sequentially performing this procedure and repeating it until the starting point 6 is reached, a route from the ending point 7 to the starting point 6 is found. The route data output unit 19 stores the determined route data in the route data storage unit 20, and at the same time sets the used status for the grid of the route in the grid map storage unit 17, and stores the determined route data in the route data storage unit 20. Erase direction. The above operation is repeatedly executed for all section data.

〔Effect of the invention〕

The present invention involves slicing the substrate into slits,
By sequentially shifting the slits and simultaneously searching for routes between adjacent slits in parallel, the computer time required for route searching can be significantly reduced.

[Brief explanation of drawings]

FIG. 1 is a lattice map sliced into a plurality of slits, FIG. 2 is a diagram for explaining the basic operation of the present invention, and FIG. 3 is a diagram showing an embodiment of the present invention. In Figures 1 to 3, 1... Lattice map, 2... Lattice width of the X coordinate, 3... Slit divided into slices, 4... Lattice, 5... Lattice map (state before route search) , 6...Start point of section data,
7...End point of section data, 8...Used state of grid, 9a, 9b, 9e,...9n...Processor, 10a, 10b, 10c,...10m...Slit (before route search), 10a', 10b ′,10c′,…
10m'...Slit (after route search), 11...Lattice map (state after route search), 12...Route direction, 13...Section data storage section, 14...Route search control section, 15... Route search processing unit, 16...
Lattice map input/output control unit, 17... Lattice map storage unit, 18... Route tracing unit, 19... Route data output unit, 20... Route data storage unit.

Claims (1)

[Claims] 1. 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 a usage state of the grid of the entire wiring board. a lattice map storage unit that stores a lattice map storage unit, a route search processing unit that has processors that search for routes arranged in a one-dimensional array, a route search control unit that controls the execution of the processors, and a route that backtrace the searched routes. a trace section; a route data storage section and the lattice map storage section that store determined route information; and a route data output section that outputs route information to the route data storage section.
Divide the slice into multiple slits at regular intervals parallel to the axis, assign one processor to each lattice arranged in a one-dimensional array included in one slit, and sequentially divide the slits parallel to the X or Y axis. A route search processing system characterized by shifting to