DocumentCode
3142702
Title
A Parallel Bit Map Processor Architecture for DA Algorithms
Author
Blank, Tom ; Stefik, Mark ; VanCleemput, Willcm
Author_Institution
Stanford University, Stanford, CA and Xerox PARC, Palo Alto, CA
fYear
1981
fDate
29-1 June 1981
Firstpage
837
Lastpage
845
Abstract
Bit maps have been used in many Design Automation (DA) algorithms such as printed circuit board (PCB) layout and integrated circuit (IC) design rule checking (DRC). The attraction of bit maps is that they provide a direct representation of two-dimensional images. The difficulty with large scale use of bit maps (e.g., for DRC on VLSI) is that the large amounts of data can consume impractical amounts of computation on sequential machines. This paper describes a processing architecture that is specifically designed to operate on bit maps. It has an inherently two-dimensional construction and has a very large parallel processing capability. Also included in this paper are descriptions of algorithms that exploit the architecture. Algorithms for routing, DRC, and bit vector manipulation are included.
Keywords
Algorithm design and analysis; Computer architecture; Costs; Data structures; Design automation; Hardware; Integrated circuit layout; Printed circuits; Routing; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1981. 18th Conference on
Type
conf
DOI
10.1109/DAC.1981.1585453
Filename
1585453
Link To Document