[go: up one dir, main page]

Dasdan et al., 1997 - Google Patents

Two novel multiway circuit partitioning algorithms using relaxed locking

Dasdan et al., 1997

View PDF
Document ID
5753267002761849074
Author
Dasdan A
Aykanat C
Publication year
Publication venue
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

External Links

Snippet

All the previous Kernighan-Lin-based (KL-based) circuit partitioning algorithms employ the locking mechanism, which enforces each cell to move exactly once per pass. In this paper, we propose two novel approaches for multiway circuit partitioning to overcome this …
Continue reading at core.ac.uk (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5072—Floorplanning, e.g. partitioning, placement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5077—Routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30634—Querying
    • G06F17/30657—Query processing
    • G06F17/30675—Query execution
    • G06F17/30678—Query execution using boolean model
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc

Similar Documents

Publication Publication Date Title
Dasdan et al. Two novel multiway circuit partitioning algorithms using relaxed locking
Sanchis Multiple-way network partitioning
Catalyurek et al. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication
Bodlaender et al. Approximating treewidth, pathwidth, and minimum elimination tree height
Chevalier et al. Comparison of coarsening schemes for multilevel graph partitioning
Chiang et al. Global routing based on Steiner min-max trees
Chen et al. A hybrid simulated annealing algorithm for nonslicing VLSI floorplanning
Huang et al. When clusters meet partitions: new density-based methods for circuit decomposition
Roy et al. A timing driven n-way chip and multi-chip partitioner
Acer et al. Improving medium-grain partitioning for scalable sparse tensor decomposition
Saab An effective multilevel algorithm for bisecting graphs and hypergraphs
Ayani Lr-algorithm: concurrent operations on priority queues
Kaplan et al. Meldable heaps and boolean union-find
Kirchbach et al. Better process mapping and sparse quadratic assignment
Shi A fast algorithm for area minimization of slicing floorplans
Matias et al. Dynamic generation of discrete random variates
Matias et al. Dynamic generation of discrete random variates
Resende et al. Interior point algorithms for network flow problems
Chen et al. Tutorial on VLSI partitioning
Vijayan Generalization of min-cut partitioning to tree structures and its applications
Khasawneh et al. Hill climbing with trees: Detail placement for large windows
Cheon et al. Design hierarchy guided multilevel circuit partitioning
Gallivan et al. The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization
Areibi GRASP: An effective constructive technique for VLSI circuit partitioning
Shi An optimal algorithm for area minimization of slicing floorplans