Add to ORKGDiscusses the design and implementation of 3 parallel algorithms: one algorithm for the transshipment problem, and 2 algorithms for the dual transshipment problem. Also considers an application of these algorithms in solving VLSI layout compaction and wire balancing problems
In this paper we propose new heuristic numerical algorithm for determination of the optimal wires di...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
This paper describes the parallel implementation of the TRANSIMS traffic micro-simulation. The paral...
Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent ef...
Data parallel programming provides a simple and powerful framework for designing parallel algorithms...
The theme of this work is parallel computing for a CAD application. The layout compaction and wire-b...
Caption title.Includes bibliographical references (p. 82-95).Supported by the NSF. CCR-9103804Dimitr...
The computational requirements for high quality synthesis, analysis, and verification of VLSI design...
This book covers layout design and layout migration methodologies for optimizing multi-net wire stru...
Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes...
We consider several basic problems in VLSI routing such as river routing between rectangles, routing...
Two parallel shared-memory algorithms are presented for the optimization of generalized networks. T...
Partitioning can speed up overlong VLSI design processes by enabling process parallelization. To ach...
This research presents a new model which can be used to formulate cost functions for various VLSI pl...
The physical design of a VLSI circuit involves circuit partitioning as a subtask. Typically, it is n...
In this paper we propose new heuristic numerical algorithm for determination of the optimal wires di...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
This paper describes the parallel implementation of the TRANSIMS traffic micro-simulation. The paral...
Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent ef...
Data parallel programming provides a simple and powerful framework for designing parallel algorithms...
The theme of this work is parallel computing for a CAD application. The layout compaction and wire-b...
Caption title.Includes bibliographical references (p. 82-95).Supported by the NSF. CCR-9103804Dimitr...
The computational requirements for high quality synthesis, analysis, and verification of VLSI design...
This book covers layout design and layout migration methodologies for optimizing multi-net wire stru...
Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes...
We consider several basic problems in VLSI routing such as river routing between rectangles, routing...
Two parallel shared-memory algorithms are presented for the optimization of generalized networks. T...
Partitioning can speed up overlong VLSI design processes by enabling process parallelization. To ach...
This research presents a new model which can be used to formulate cost functions for various VLSI pl...
The physical design of a VLSI circuit involves circuit partitioning as a subtask. Typically, it is n...
In this paper we propose new heuristic numerical algorithm for determination of the optimal wires di...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
This paper describes the parallel implementation of the TRANSIMS traffic micro-simulation. The paral...