JPS59186067A - System for processing path retrieval - Google Patents

Abstract

PURPOSE:To decrease a time required for computer for retrieving a path by slicing and dividing a board into slits, shifting slits sequentially and retrieving the path between adjacent slits in parallel at the same time. CONSTITUTION:Processors 9a-9n are assigned to each grating in a slit 10a including a start point 6 and the path in the Y direction is retrieved from the start point 6. The result of retrieval is expressed by a direction 12 of the path found out and preserved in a slit 10a' of a grating map 11. Then, the processors 9a-9n are assigned to each grating of a slit 10b, and the path in the X direction from the grating preserved for the path in the slit 10a the slit 10b is retrieved in parallel at the same time between adjacent gratings of the slits 10a and 10b. As to the grating whose path from the slit 10a is not found out, the path in the Y direction is retrieved. The result of the retrieval is preserved in the slit 10b'. The slits are shifted sequentially in the X direction and the path is being retrieved until the point reaches the end point 7.

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 capacity of memory. The general-purpose combinator 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 high-speed in-search method is used, a considerable amount of converter 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 board, so 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 converter time, and to provide a route search processing system that simultaneously searches for routes between instantaneous contact grids of adjacent slits. be.

[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 grid of the entire board, and a processor that searches for a route in a one-dimensional manner. A route search processing unit arranged in an array; a route search control unit that controls execution of the processor; a route tracing unit that backtraces the searched route; a route data storage unit that stores determined route information; It is equipped with a lattice map storage section and a route data output section that outputs route information to the route data storage section, and the lattice map is sliced into a plurality of slits at regular intervals parallel to the The present invention is characterized in that one processor is assigned to each grid arranged in a one-dimensional array included in the slit, and the slit is sequentially shifted across the x-axis and parallel to the Y-axis.

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

The present invention can be extended to multilayer printed boards, LSIs, etc. with two or more wiring layers by regularizing the search direction in each wiring layer and providing through holes at lattice points where the search direction changes.

[Principle and operation of the invention]

The feature of the present invention is that a lattice map is divided into slices 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. Routes between adjacent lattices of adjacent slits are routed in parallel at the same time.

[Embodiments of the invention]

Next, the present invention will be explained in detail with reference to the drawings.

Referring to FIG. 1, a grid map 1 is sliced into a plurality of vertically long slits 3 parallel to the Y axis in units of a grid width 2 of the X coordinate. 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 the state before the route search, and the grid map 5 is already used.
, the starting point 6 and ending point 7 of the section data to be connected this time are shown. First, a processor 9a is installed in each grid in the lattice (surin) 10a including the starting point 6.

9b, 9c, . . . 9n are assigned, and a path in the Y direction from the starting point 6 within the slit 10a is searched. The search result is expressed by the direction 12 of the found route and is stored in the grid map 11 (Surin) 10a' where the route search result is stored. Next, processors 9a, 9b, 9c, ... 9n are assigned to each grid of the adjacent Surin) 10b, and the path within Surin) 10a is selected from the saved grid.
The path in the X direction to 0b is slit □ 10a and slit)
10b and are simultaneously searched in parallel between each adjacent grid.

For grids for which no route from the slit 10a was found, a route in the Y direction within the slit iob is searched. The search results are stored in the slit 10b'. In this way, the route search is performed by sequentially shifting the slits in the X direction until reaching the end point 7.

In FIG. 3, the configuration of this system will be explained.

The route search control unit 14 inputs the section data of section 1 from the section data storage section 13, and selects the route search section 10a including the starting point 6 in FIG.
The route search processing unit 15 is instructed to start the search from. Processors 9a, 9b.

9c, . . . , 9n are assigned to each grid in the grid 10a in FIG. Explore routes. 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 1" Ob shown in FIG. 2, and searches for a route as described above.

Thereafter, the route to the end point 7 is searched by similarly performing the jh-th slit shift. End point 7 @: The route has arrived, and at point 9, the route tracing unit 18 in FIG. A route for one award shall be established by law. The route data storage unit 19 stores the determined route data in the PjV data storage unit 20, and at the same time sets the used status for the grid of the route in the grid-tube storage unit 17. Clear route direction. The above operation is repeated 17 for all section data.

[The germ of invention]

The present invention has the effect of greatly reducing computer time for route searching by dividing the substrate into slits, shifting the slits sequentially, and simultaneously searching for routes between adjacent slits in parallel.

[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 are diagrams showing two embodiments of the present invention. In Figures 1 to 3, 1... Lattice map, 2... Grid width of the X coordinate, 3... Slit divided into slices, 4... ... Lattice, 5...
... Lattice Mazda (state before route search), 6...
... Start point of section data, 7 ... End point of section data, 8 ... Used grid state of grid, 9a, 9b, 9
e,...9n...Processor, 10
a. 10b, 10c,...10m...Slit (before route search), 10a', 10b', 10c',
---・-・10m'-・Self・-slit (after route search), 11... Lattice map (state after route search)
, 12...Route direction, 13...Section data storage unit, 14...Route search control unit, 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. Written amendment to a certain three-pronged procedure, dated 41st 1948, Director General of the Patent Office, 1, Indication of the case, 1988 Patent Application No. 61143
No. 2, Title of the invention Route search processing system 3, Person making the amendment Relationship to the case Applicant: 5-33-1-4 Shiba, Minato-ku, Tokyo, Agent 5, Subject of amendment ゛(1) Drawings (2) ) Column 6 of the detailed explanation of the invention in the specification, contents of amendment (1) Figure 2 of the drawing attached to the application will be replaced with a new drawing. (2) The statement "Result j" on page 6, line 2 of the specification will be corrected to "Result."

Claims (1)

[Scope of Claims] A section data storage unit that stores section data consisting of pairs of grid points to be connected on a wiring board in which a grid is provided in orthogonal directions of X and Y; A lattice map storage unit for storing, a route search processing unit in which processors for searching routes are arranged in a one-dimensional array, a route search control unit for controlling the execution of the processors, and a route tracing unit for backtracing the searched route. a route data storage unit that stores determined route information and the lattice map storage unit; and a route data output unit that outputs route information to the route data storage unit; Divide the slice into multiple slits at regular intervals in parallel, assign one processor to the mulberry lattice arranged in a one-dimensional array included in one slit, and shift the slit sequentially in parallel to the X or Y axis. A route search processing system characterized by: